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

DOI10.1007/s10898-010-9643-4zbMath1229.90166OpenAlexW2064346863MaRDI QIDQ652693

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)

Related Items (1)

Global versus local search: the impact of population sizes on evolutionary algorithm performance

Uses Software

• TSPLIB
• Concorde
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• GRASP and path relinking for the max-min diversity problem
• Landscapes, operators and heuristic search
• Solving the \(k\)-best traveling salesman problem
• Nonlinear multiobjective optimization
• A new adaptive multi-start technique for combinatorial global optimizations
• Multicriteria optimization
• Greedy randomized adaptive search procedures
• Dynamics of local search trajectory in traveling salesman problem
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• Tour Merging via Branch-Decomposition
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Minimization by Random Search Techniques
• TSPLIB—A Traveling Salesman Problem Library
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Scatter Search and Path Relinking: Advances and Applications
• Multi-Start Methods
• An approach to multi-start clustering for global optimization with non-linear constraints
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Combinatorial optimization. Theory and algorithms.
• Reducing the bandwidth of a sparse matrix with tabu search.

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