New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
A tabu search heuristic for the vehicle routing problem
Management Science
The vehicle routing problem
Using Experimental Design to Find Effective Parameter Settings for Heuristics
Journal of Heuristics
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Parameter tuning of evolutionary algorithms: generalist vs. specialist
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
An exact algorithm for multi depot and multi period vehicle scheduling problem
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Operations Research
| Hi-index | 0.00 |
In this paper, we consider a multi-depot periodic vehicle routing problem which is characterized by the presence of a homogeneous fleet of vehicles, multiple depots, multiple periods, and two types of constraints that are often found in reality, i.e., vehicle capacity and route duration constraints. The objective is to minimize total travel costs. To tackle the problem, we propose an efficient path relinking algorithm whose exploration and exploitation strategies enable the algorithm to address the problem in two different settings: (1) As a stand-alone algorithm, and (2) As a part of a co-operative search algorithm called integrative co-operative search. The performance of the proposed path relinking algorithm is evaluated, in each of the above ways, based on standard benchmark instances. The computational results show that the developed PRA performs well, in both solution quality and computational efficiency.