Seeking global edges for traveling salesman problem in multi-start search

DOI10.1007/S10898-010-9643-4MaRDI QIDQ652693zbMATH OpenOpenAlexFDO

Authors Weiqi Li

Publication date 15 December 2011

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-010-9643-4

zbMATH Keywords

convergencetraveling salesman problemPareto optimal solutionmultiobjective optimization problemmulti-start searchsolution attractor

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Recommendations

• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• A Multilevel Approach to the Travelling Salesman Problem
• Two multi-start heuristics for the \(k\)-traveling salesman problem
• Sequential and parallel local search for the time-constrained traveling salesman problem
• scientific article; zbMATH DE number 1754728
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space

Cites work

• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 1973378 (Why is no real title available?)
• scientific article; zbMATH DE number 2079890 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• A new adaptive multi-start technique for combinatorial global optimizations
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An approach to multi-start clustering for global optimization with non-linear constraints
• Combinatorial optimization. Theory and algorithms.
• Computer Solutions of the Traveling Salesman Problem
• Dynamics of local search trajectory in traveling salesman problem
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• GRASP and path relinking for the max-min diversity problem
• Greedy randomized adaptive search procedures
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Landscapes, operators and heuristic search
• Minimization by Random Search Techniques
• Multi-Start Methods
• Multicriteria optimization
• Nonlinear multiobjective optimization
• Reducing the bandwidth of a sparse matrix with tabu search.
• Scatter Search and Path Relinking: Advances and Applications
• Solving the k-best traveling salesman problem
• TSPLIB—A Traveling Salesman Problem Library
• The traveling salesman problem. A computational study.
• Tour merging via branch-decomposition

Cited in

(3)

• Evolutionary Multi-Criterion Optimization
• Global versus local search: the impact of population sizes on evolutionary algorithm performance
• Solution attractor of local search in travelling salesman problem: concept, construction and application

Describes a project that uses

Uses Software

• Tabu search
• Concorde
• TSPLIB

This page was built for publication: Seeking global edges for traveling salesman problem in multi-start search

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