期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 56, 期 4, 页码 1642-1648出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2008.10.014
关键词
Genetic algorithm; Pickup-and-delivery; Traveling salesman
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据