Improved partheno-genetic algorithm for solving addressable multiple traveling salesman problem

DOI10.16163/J.CNKI.22-1123/N.2019.04.010MaRDI QIDQ3308018zbMATH OpenFDO

Authors Shijuan Hu, Haiyan Lu, Yang Huang, Kaibo Xu

Publication date 12 August 2020

Full work available at URL https://doi.org/10.16163/J.CNKI.22-1123/N.2019.04.010

zbMATH Keywords

multiple traveling salesmen problempartheno-genetic algorithmreproductive mechanismselect operatortourism route planning

Mathematics Subject Classification ID

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

Recommendations

• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• A novel approach to solve multiple traveling salesmen problem by genetic algorithm
• Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm
• scientific article; zbMATH DE number 2079898

Cited in

(4)

• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
• A combination of sweep algorithm and elite ant colony optimization for solving the multiple traveling salesman problem
• Application of a new acceleration particle swarm optimization for solving multiple traveling salesman problems
• Research on multi-objective simulated annealing algorithm for multi-traveling salesman problem

This page was built for publication: Improved partheno-genetic algorithm for solving addressable multiple traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3308018)