New Heuristic Algorithms for Solving Single-Vehicle and Multi-VehicleGeneralized Traveling Salesman Problems (GTSP)

محورهای موضوعی : Design of Experiment

Ellips Masehian ¹ (Industrial Engineering Department, Tarbiat Modares University, Tehran, 14155-4838, Iran.)

تاریخ دریافت : 1388/03/13 تاریخ پذیرش : 1388/04/19 تاریخ انتشار : 1388/11/18

کلید واژه: Traveling salesman problem, Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problem,

چکیده مقاله :

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to find a minimum-length tour containing exactly one node from each cluster. In this paper, a new heuristic method is presented for solving singlevehicle single-depot GTSP with the ability of controlling the search strategy from conservative to greedy and vice versa. A variant algorithm is then developed to accommodate the multi-vehicle single-depot condition, which is modified afterwards to accommodate the multi-vehicle multi-depot GTSP.