International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 129 | Views: 229

Research Paper | Computer Science & Engineering | India | Volume 4 Issue 6, June 2015

A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery

Monika Sharma [8] | Deepak Sharma [12]

Abstract: A Steady State Genetic Algorithm (GA) is proposed for the Traveling Salesman Problem with Pickup and Delivery (TSPPD). TSPPD is an extension of the well known Traveling Salesman Problem (TSP). TSPPD is a graph and grouping optimization problem. In this thesis, TSPPD is differentiated by a group of cities as customers, each of them supplying (picking customer) or demanding (delivery customer) a given amount of a single product. The objective is to find out minimum tour length of the route for a capacitated vehicle in order to transport the product from the pickup to the delivery customers. Each city must be visited exactly once and capacity of vehicle should not be violate. In this thesis we have used a pheromone based crossover operator that utilizes both local and global information to construct offspring. In addition, we have also used a local search procedure in the genetic algorithm to accelerate convergence. To selecting parents for crossover and mutation operator to generate feasible offspring, we have binary tournament section method. The results of our algorithm have been tested on benchmark instances and computational results show that we have got comparable results to the optimal results.

Keywords: Genetic Algorithm, Crossover operator, offspring, Travelling Salesman Problem

Edition: Volume 4 Issue 6, June 2015,

Pages: 353 - 360

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait