Hybrid nested partitions method for the traveling salesman problem

DOI10.1007/978-3-642-54924-3_6MaRDI QIDQ2963701zbMATH OpenOpenAlexFDO

Authors Decai Zong, Kangkang Wang

Publication date 21 February 2017

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54924-3_6

zbMATH Keywords

traveling salesman problemlocal search algorithmnested partitions method3-opt algorithmLin-Kernighan algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)

Recommendations

• A hybrid nested partitions optimization algorithm for the QAP problem
• A parametric hybrid method for the traveling salesman problem
• New parallel randomized algorithms for the traveling salesman problem
• Nested partitions method for stochastic optimization
• Nested partitions method, theory and applications

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem

Cited in

(4)

• A hybrid nested partitions optimization algorithm for the QAP problem
• Solving large-scale TSP using a fast wedging insertion partitioning approach
• A fast optimization method based on a hierarchical strategy for the travelling salesman problem
• A parametric hybrid method for the traveling salesman problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Hybrid nested partitions method for the traveling salesman problem

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