Research on multi-objective simulated annealing algorithm for multi-traveling salesman problem

DOI10.3969/J.ISSN.1001-4616.2017.03.012MaRDI QIDQ3175247zbMATH OpenFDO

Authors Xingxing Liang, Yang Ma, Yanghe Feng, Guangping Zhang, Hao Ma

Publication date 18 July 2018

zbMATH Keywords

genetic algorithmmulti-objective optimizationsimulated annealing algorithmalgorithm comparisonmultiple traveling salesmen problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Research on an improved multi-strategy ant colony algorithm for TSP problem
• Optimization of non-linear multiple traveling salesman problem using \(k\)-means clustering, shrink wrap algorithm and meta-heuristics
• A novel approach to solve multiple traveling salesmen problem by genetic algorithm
• Improved partheno-genetic algorithm for solving addressable multiple traveling salesman problem
• A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem

Cited in

(2)

• An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
• Solution of uncertain constrained multi-objective travelling salesman problem with aspiration level based multi objective quasi oppositional Jaya algorithm

This page was built for publication: Research on multi-objective simulated annealing algorithm for multi-traveling salesman problem

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