A genetic algorithm for the traveling salesman problem with pickup and delivery using depot removal and insertion moves

Authors:
Volkan Çınar;Temel Öncan;Haldun Süral
Affiliations:
GEMPORT Port and Warehousing, Bursa, Turkey;Department of Industrial Engineering, Galatasaray University Ortaköy, İstanbul, Turkey;Department of Industrial Engineering, Middle East Technical University, Ankara, Turkey
Venue:
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Year:
2010

Citing 5
Cited 1

Heuristics for the traveling salesman problem with pickup and delivery

Computers and Operations Research
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
How to solve it: modern heuristics

How to solve it: modern heuristics
Performance of Various Computers Using Standard Linear Equations Software

Performance of Various Computers Using Standard Linear Equations Software
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

Transportation Science

Evaluation of vehicle routing problem with time windows by using metaheuristics algorithm

ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), which is an extension of the well-known NP-hard Traveling Salesman Problem. We propose a Genetic Algorithm (GA) based on a specially tailored tour improvement procedure for the TSPPD. Computational experiments are reported on the test instances taken from the literature. The experimental results suggest that the proposed GA yields a promising performance in terms of both accuracy and efficiency compared to existing algorithms in the literature.