A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm

DOI10.1007/978-3-642-15220-7_12zbMath1206.90146OpenAlexW146257244MaRDI QIDQ3058091

János Abonyi, András Király

Publication date: 18 November 2010

Published in: Computational Intelligence in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15220-7_12

zbMATH Keywords

genetic algorithmmultiple traveling salesmen problemmulti-chromosome

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem ⋮ Synchronized Traveling Salesman Problem ⋮ Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming ⋮ Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance

This page was built for publication: A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm