Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 56, Issue 4, Pages 1642-1648Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2008.10.014
Keywords
Genetic algorithm; Pickup-and-delivery; Traveling salesman
Ask authors/readers for more resources
In this paper, we proposed a genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. In the proposed algorithm, we designed a new tour constructing heuristic to generate the initial population, and proposed a novel pheromone-based crossover operator that utilizes both local and global information to construct offspring. in addition, a local search procedure was embedded into the genetic algorithm to accelerate convergence. The proposed genetic algorithm was tested on benchmark instances with up to 500 customers, and the computational results show that it gives it faster and better convergence than existing heuristics. (C) 2008 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available