A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
From MaRDI portal
Publication:857330
DOI10.1016/j.ejor.2005.12.010zbMath1102.90025MaRDI QIDQ857330
Haralambos Sarimveis, Athanassios Nikolakopoulos
Publication date: 14 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.010
scheduling; combinatorial optimization; metaheuristics; threshold accepting; traveling salesman problem
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- An inexact algorithm for the sequential ordering problem
- On the convergence of ``threshold accepting
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Order picking in an automatic warehouse: Solving online asymmetric TSPs
- The traveling salesman. Computational solutions for RSP applications
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- The asymmetric traveling salesman problem with replenishment arcs
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- The period traveling salesman problem: A new heuristic algorithm
- A new memetic algorithm for the asymmetric traveling salesman problem
- Cluster based branching for the asymmetric traveling salesman problem
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- The time-dependent traveling salesman problem
- BoneRoute: An adaptive memory-based method for effective fleet management
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem
- A modification of threshold accepting and its application to the quadratic assignment problem
- A Hybrid Exact Algorithm for the TSPTW
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Local Search for the Asymmetric Traveling Salesman Problem
- Special cases of traveling salesman and repairman problems with time windows
- TSPLIB—A Traveling Salesman Problem Library
- A Computational Study of the Job-Shop Scheduling Problem
- Exact solution of large-scale, asymmetric traveling salesman problems
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- Validation of subgradient optimization
- An Algorithm for the Traveling Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Construction heuristics for the asymmetric TSP.
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
