期刊
COMPUTERS & OPERATIONS RESEARCH
卷 29, 期 9, 页码 1129-1141出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0305-0548(00)00109-X
关键词
pickup and delivery traveling salesman problem; perturbation heuristics
This article describes and compares seven perturbation heuristics for the Pickup and Delivery Traveling Salesman Problem (PDTSP). In this problem, a shortest Hamiltonian cycle is sought through a depot and several pickup and delivery pairs, Perturbation heuristics are diversification schemes which help a local search process move away from a local optimum. Three such schemes have been implemented and compared: Instance Perturbation, Algorithmic Perturbation, and Solution Perturbation. Computational results on PDTSP instances indicate that the latter scheme yields the best results. On instances for which the optimum is known., it consistently produces optimal or near-optimal solutions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据