A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
type: Item
instance of: scholarly article
title: A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
zbMATH Open document ID: 1102.90025
author: Athanassios Nikolakopoulos
author: Haralambos Sarimveis
published in: European Journal of Operational Research
publication date: 2006-12-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5080326
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: metaheuristics
zbMATH Keywords: threshold accepting
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: scheduling
describes a project that uses: TSPLIB
describes a project that uses: TSPTW
describes a project that uses: JOBSHOP
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.12.010
OpenAlex ID: W2075743956
cites work: Q3994799
cites work: Order picking in an automatic warehouse: Solving online asymmetric TSPs
cites work: On the convergence of ``threshold accepting''
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
cites work: A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
cites work: Q4875843
cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
cites work: Q3686500
cites work: The asymmetric traveling salesman problem with replenishment arcs
cites work: A new memetic algorithm for the asymmetric traveling salesman problem
cites work: Exact solution of large-scale, asymmetric traveling salesman problems
cites work: Q4886786
cites work: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
cites work: Q4801179
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: An inexact algorithm for the sequential ordering problem
cites work: Solving the continuous flow-shop scheduling problem by metaheuristics.
cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
cites work: A hybrid exact algorithm for the TSPTW
cites work: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
cites work: Q4198056
cites work: Construction heuristics for the asymmetric TSP.
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Validation of subgradient optimization
cites work: Q4263716
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Q4461912
cites work: Q4365133
cites work: Local Search for the Asymmetric Traveling Salesman Problem
cites work: Q4142699
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: Q3707785
cites work: Optimization by Simulated Annealing
cites work: Q3785827
cites work: Q3677509
cites work: Q5187226
cites work: A novel threshold accepting meta-heuristic for the job-shop scheduling problem
cites work: A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Cluster based branching for the asymmetric traveling salesman problem
cites work: Q3981972
cites work: An efficient genetic algorithm for the traveling salesman problem with precedence constraints
cites work: A modification of threshold accepting and its application to the quadratic assignment problem
cites work: The period traveling salesman problem: A new heuristic algorithm
cites work: Q3221403
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The time-dependent traveling salesman problem
cites work: A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
cites work: Special cases of traveling salesman and repairman problems with time windows
cites work: Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
DOI: 10.1016/J.EJOR.2005.12.010