A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms

DOI10.1016/j.ejor.2013.01.043zbMath1332.90332OpenAlexW2033915107MaRDI QIDQ257224

Bradley Skinner, Shoudong Huang, Shuai Yuan, Dikai Liu

Publication date: 15 March 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.01.043

zbMATH Keywords

genetic algorithmscrossover operatorMTSPtwo-part chromosome

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy ⋮ Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem ⋮ Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach ⋮ A matheuristic algorithm for the pollution and energy minimization traveling salesman problems ⋮ To improve the performance of genetic algorithms by using a novel selection operator ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem ⋮ Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem ⋮ A new selection operator for genetic algorithms that balances between premature convergence and population diversity ⋮ Minimizing dispersion in multiple drone routing ⋮ Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case ⋮ Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation

Uses Software

• TSPLIB
• GALib
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• Genetic algorithms and traveling salesman problems
• A genetic algorithm for service level based vehicle scheduling
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
• A crane scheduling method for port container terminals
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• TSPLIB—A Traveling Salesman Problem Library
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
• Computational Experience with an M-Salesman Traveling Salesman Algorithm