Heuristic approaches to vehicle routing with backhauls and time windows
Computers and Operations Research
Scatter search and path relinking
New ideas in optimization
Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
An Exact Method for the Vehicle Routing Problem with Backhauls
Transportation Science
Solving the vehicle routing problem with adaptive memory programming methodology
Computers and Operations Research
Path relinking for the vehicle routing problem
Journal of Heuristics
A general heuristic for vehicle routing problems
Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
Discrete Applied Mathematics
A hybrid evolution strategy for the open vehicle routing problem
Computers and Operations Research
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Computers and Operations Research
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows
IEEE Transactions on Evolutionary Computation
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Computers and Operations Research
Hi-index | 0.00 |
This paper deals with one-to-many-to-one vehicle routing and scheduling problems with pickups and deliveries and studies the effect of various backhauling strategies. Initially, focus is given on problem instances with clustered backhauls where all delivery customers must be visited before pickup customers. Afterward, operational settings with mixed backhauls and varying visiting sequence restrictions with respect to the capacity of the vehicles are examined. The proposed solution method evolves a set of reference solutions on the basis of a novel Adaptive Path Relinking framework. The latter encompasses an adaptive multisolution recombination procedure to generate provisional solutions based on the recurrence of particular solution attributes. On return, these solutions are used as guiding points for performing search trajectories from initial reference solutions via tunneling. Computational results on benchmark data sets of the literature illustrate the competitiveness and robustness of the proposed approach compared to state-of-the-art solution methods for well-known vehicle routing and scheduling problems. Finally, various experiments are also reported to demonstrate the economic effect of different mixing levels and densities of linehaul and backhaul customers.