A New Approach to Solving the Fixed Destination Multi-Depot Multiple Traveling Salesman Problem using Genetic Algorithms

Kamran Kardel; Nikbakhsh Javadian; Freydoun Adbesh

doi:10.13140/RG.2.1.3958.2244

A New Approach to Solving the Fixed Destination Multi-Depot Multiple Traveling Salesman Problem using Genetic Algorithms

Kamran Kardel, Nikbakhsh Javadian, Freydoun Adbesh

Manufacturing Engineering

Mazandaran University of Science and Technology

Research output: Contribution to book or proceeding › Chapter

Abstract

The fixed destination multi depot multiple traveling salesmen problem (MmTSP) in which more than one salesmen depart from several starting cities and having returned to the starting city, form tours so that each city is visited with exactly one salesman and the tour lengths stay within certain limits. This problem is of a great complexity and few investigations have been done on it before. In this paper we propose a new GA chromosome and related operators for the MmTSP and compare the theoretical properties and computational performance of the some common operators and strategies of genetic algorithms. We also compare results in problems with small dimensions to the optimal answers obtained by solving the problems by Lingo 8.

Original language	American English
Title of host publication	Proceedings of the International Conference on Optimization: Techniques and Applications
DOIs	https://doi.org/10.13140/RG.2.1.3958.2244
State	Published - Dec 2007

Disciplines

Manufacturing

Keywords

Fixed destination
Genetic algorithms
Multi-depot
Multiple traveling salesman problem
New approach
Solving

Access to Document

10.13140/RG.2.1.3958.2244License: Unspecified

Cite this

@inbook{b9d40677ee254fad8e6167fe42a67093,

title = "A New Approach to Solving the Fixed Destination Multi-Depot Multiple Traveling Salesman Problem using Genetic Algorithms",

abstract = " The fixed destination multi depot multiple traveling salesmen problem (MmTSP) in which more than one salesmen depart from several starting cities and having returned to the starting city, form tours so that each city is visited with exactly one salesman and the tour lengths stay within certain limits. This problem is of a great complexity and few investigations have been done on it before. In this paper we propose a new GA chromosome and related operators for the MmTSP and compare the theoretical properties and computational performance of the some common operators and strategies of genetic algorithms. We also compare results in problems with small dimensions to the optimal answers obtained by solving the problems by Lingo 8.",

keywords = "Fixed destination, Genetic algorithms, Multi-depot, Multiple traveling salesman problem, New approach, Solving",

author = "Kamran Kardel and Nikbakhsh Javadian and Freydoun Adbesh",

year = "2007",

month = dec,

doi = "10.13140/RG.2.1.3958.2244",

language = "American English",

booktitle = "Proceedings of the International Conference on Optimization: Techniques and Applications",

}

TY - CHAP

T1 - A New Approach to Solving the Fixed Destination Multi-Depot Multiple Traveling Salesman Problem using Genetic Algorithms

AU - Kardel, Kamran

AU - Javadian, Nikbakhsh

AU - Adbesh, Freydoun

PY - 2007/12

Y1 - 2007/12

N2 - The fixed destination multi depot multiple traveling salesmen problem (MmTSP) in which more than one salesmen depart from several starting cities and having returned to the starting city, form tours so that each city is visited with exactly one salesman and the tour lengths stay within certain limits. This problem is of a great complexity and few investigations have been done on it before. In this paper we propose a new GA chromosome and related operators for the MmTSP and compare the theoretical properties and computational performance of the some common operators and strategies of genetic algorithms. We also compare results in problems with small dimensions to the optimal answers obtained by solving the problems by Lingo 8.

AB - The fixed destination multi depot multiple traveling salesmen problem (MmTSP) in which more than one salesmen depart from several starting cities and having returned to the starting city, form tours so that each city is visited with exactly one salesman and the tour lengths stay within certain limits. This problem is of a great complexity and few investigations have been done on it before. In this paper we propose a new GA chromosome and related operators for the MmTSP and compare the theoretical properties and computational performance of the some common operators and strategies of genetic algorithms. We also compare results in problems with small dimensions to the optimal answers obtained by solving the problems by Lingo 8.

KW - Fixed destination

KW - Genetic algorithms

KW - Multi-depot

KW - Multiple traveling salesman problem

KW - New approach

KW - Solving

UR - https://doi.org/10.13140/RG.2.1.3958.2244

U2 - 10.13140/RG.2.1.3958.2244

DO - 10.13140/RG.2.1.3958.2244

M3 - Chapter

BT - Proceedings of the International Conference on Optimization: Techniques and Applications

ER -

A New Approach to Solving the Fixed Destination Multi-Depot Multiple Traveling Salesman Problem using Genetic Algorithms

Abstract

Disciplines

Keywords

Access to Document

Other files and links

Fingerprint

Cite this