Masehian, E. (2010). New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle
Generalized Traveling Salesman Problems (GTSP). Journal of Optimization in Industrial Engineering, Volume 2(Issue 3), 49-58.
Ellips Masehian. "New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle
Generalized Traveling Salesman Problems (GTSP)". Journal of Optimization in Industrial Engineering, Volume 2, Issue 3, 2010, 49-58.
Masehian, E. (2010). 'New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle
Generalized Traveling Salesman Problems (GTSP)', Journal of Optimization in Industrial Engineering, Volume 2(Issue 3), pp. 49-58.
Masehian, E. New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle
Generalized Traveling Salesman Problems (GTSP). Journal of Optimization in Industrial Engineering, 2010; Volume 2(Issue 3): 49-58.
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle
Generalized Traveling Salesman Problems (GTSP)
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.
Top
