An Effective Heuristic Algorithm for the Traveling-Salesman Problem
From MaRDI portal
Publication:5671788
DOI10.1287/opre.21.2.498zbMath0256.90038DBLPjournals/ior/LinK73OpenAlexW2042986967WikidataQ57406542 ScholiaQ57406542MaRDI QIDQ5671788
No author found.
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cf111ab889611f1b08f885ab783bde7157807641
Related Items (only showing first 100 items - show all)
The clustered orienteering problem ⋮ Master surgery scheduling with consideration of multiple downstream units ⋮ Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP ⋮ An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem ⋮ A distribution-free TSP tour length estimation model for random graphs ⋮ TSP race: minimizing completion time in time-sensitive applications ⋮ The \(k\)-dissimilar vehicle routing problem ⋮ Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem ⋮ A matheuristic for the team orienteering arc routing problem ⋮ The multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Classical simulated annealing using quantum analogues ⋮ MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem ⋮ Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations ⋮ A memetic algorithm for the travelling salesperson problem with hotel selection ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ A hybrid data mining GRASP with path-relinking ⋮ The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ Ambulance routing for disaster response with patient groups ⋮ A simulated annealing heuristic for the open location-routing problem ⋮ A two-phase hybrid heuristic algorithm for the capacitated location-routing problem ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ A nonmonotone GRASP ⋮ Social structure optimization in team formation ⋮ Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking ⋮ On the number of local minima for the multidimensional assignment problem ⋮ A Lagrangean relaxation heuristic for vehicle routing ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic ⋮ Design and control of warehouse order picking: a literature review ⋮ A heuristic procedure for the capacitated \(m\)-ring-star problem ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ The balanced traveling salesman problem ⋮ Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem ⋮ Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ Cyclic transfers in school timetabling ⋮ Determination method for power-saved driving motions of manipulators by heuristic algorithms (in case of PTP control) ⋮ Survivable network design with demand uncertainty ⋮ Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times ⋮ Using Markov chains to analyze the effectiveness of local search algorithms ⋮ Hybridizing evolutionary algorithms with variable-depth search to overcome local optima ⋮ An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem ⋮ Local search: is brute-force avoidable? ⋮ Introduction to computation and learning in artificial neural networks ⋮ A variable depth search branching ⋮ An efficient implementation of local search algorithms for constrained routing problems ⋮ Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem ⋮ The Hamiltonian p-median problem ⋮ Facet identification for the symmetric traveling salesman polytope ⋮ Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ Political districting: From classical models to recent approaches ⋮ Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ On single courier problem ⋮ On fast trust region methods for quadratic models with linear constraints ⋮ Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ Golden ratio versus pi as random sequence sources for Monte Carlo integration ⋮ A \(k\)-level data structure for large-scale traveling salesman problems ⋮ A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand ⋮ Bounding, filtering and diversification in CP-based local branching ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem ⋮ A filter-and-fan approach to the job shop scheduling problem ⋮ Shift-and-propagate ⋮ A modified Lin--Kernighan traveling-salesman heuristic ⋮ A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem ⋮ A hybrid evolutionary algorithm for the periodic location-routing problem ⋮ A survey of very large-scale neighborhood search techniques ⋮ Models, relaxations and exact approaches for the capacitated vehicle routing problem ⋮ A solution approach to the inventory routing problem in a three-level distribution system ⋮ Adaptive memory programming for matrix bandwidth minimization ⋮ Budgeted matching and budgeted matroid intersection via the gasoline puzzle ⋮ NeuroGenetic approach for combinatorial optimization: an exploratory analysis ⋮ A framework for analyzing sub-optimal performance of local search algorithms ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Match twice and stitch: a new TSP tour construction heuristic. ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ A GRASP\(\times \)ELS approach for the capacitated location-routing problem ⋮ A heuristic approach for the travelling purchaser problem ⋮ A library of local search heuristics for the vehicle routing problem ⋮ An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem ⋮ A diagonal completion and 2-optimal procedure for the travelling salesman problem ⋮ Randomized gravitational emulation search algorithm for symmetric traveling salesman problem ⋮ A novel iterative shape from focus algorithm based on combinatorial optimization ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms ⋮ Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem ⋮ Markovian neural networks ⋮ A study of the application of Kohonen-type neural networks to the travelling salesman problem ⋮ Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem ⋮ Efficiently solving the traveling thief problem using hill climbing and simulated annealing ⋮ Recent trends in combinatorial optimization ⋮ Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry ⋮ Solution of large-scale symmetric travelling salesman problems ⋮ Performance analysis of cyclical simulated annealing algorithms ⋮ Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
This page was built for publication: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
