2021
DOI: 10.1016/j.trc.2021.103077
|View full text |Cite
|
Sign up to set email alerts
|

Toward a more flexible VRP with pickup and delivery allowing consolidations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 27 publications
(8 citation statements)
references
References 31 publications
0
8
0
Order By: Relevance
“…Ancele et al investigated cooperation among carriers by setting up a VRP model considering both collection and delivery operations. CPLEX combined with the use of simulated-annealing-based heuristics was designed for model solution, with high computational efficiency ( 10 ). Pan et al formulated a multi-trip time-dependent VRP model with time windows (TDVRPTW) with the objective of minimizing the overall driving distance while simultaneously satisfying time window requirements, vehicle loading capacity constraint, and maximum driving time constraint ( 11 ).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Ancele et al investigated cooperation among carriers by setting up a VRP model considering both collection and delivery operations. CPLEX combined with the use of simulated-annealing-based heuristics was designed for model solution, with high computational efficiency ( 10 ). Pan et al formulated a multi-trip time-dependent VRP model with time windows (TDVRPTW) with the objective of minimizing the overall driving distance while simultaneously satisfying time window requirements, vehicle loading capacity constraint, and maximum driving time constraint ( 11 ).…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the local search stage, when reaching or approaching the local optimum, some neighborhood actions may worsen the current solution to a certain extent. In order to further explore more potential solutions, these suboptimal solutions will be saved first, stored in the memory list, and then continue to be optimized [1]. In addition, in order to improve the effective search of the current solution, a tabu list is set in the local search stage to store the current neighborhood solution and avoid the detour search caused by the invalid loop in the local optimization.…”
Section: Adaptive Selection Of Neighborhood Operator Based On History...mentioning
confidence: 99%
“…With the maturity of IoT and ML techniques, 2020 witnessed a rise of works in utilising big data-driven and ML-supported solutions to different DT-based SC problems (Kantasa-ard et al, 2020;Vanvuchelen et al, 2020). During the first half of 2021, most research was to tackle transportation, and vehicle routing problem (Ancele et al, 2021;H Luo et al, 2021;Yee et al, 2021). works were mainly focused on the introduction of DT concept into manufacturing (Brenner and Hummel, 2017;Tao and Zhang, 2017;Uhlemann et al, 2017;Zhang et al, 2017), and exploring DT's potential in virtualising machines (Angrish et al, 2017) or manufacturing process (Moreno et al, 2017).…”
Section: Research Evolution Of Physical Internet-based Supply Chainmentioning
confidence: 99%