TSPLIB—A Traveling Salesman Problem Library

DOI10.1287/ijoc.3.4.376zbMath0775.90293DBLPjournals/informs/Reinelt91OpenAlexW2163428398WikidataQ59760363 ScholiaQ59760363MaRDI QIDQ4015422

Gerhard Reinelt

Publication date: 11 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.3.4.376

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (only showing first 100 items - show all)

Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Exact algorithms for the minimum latency problem ⋮ Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems ⋮ The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm ⋮ The traveling salesman problem with time-dependent service times ⋮ A branch-and-cut framework for the consistent traveling salesman problem ⋮ MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem ⋮ Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem ⋮ \(p\)-facility Huff location problem on networks ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ New analysis and computational study for the planar connected dominating set problem ⋮ Solving the \(p\)-median problem with a semi-Lagrangian relaxation ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Double bound method for solving the \(p\)-center location problem ⋮ Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services ⋮ Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ Two level general variable neighborhood search for attractive traveling salesman problem ⋮ An iterated local search heuristic for the split delivery vehicle routing problem ⋮ Model-based automatic neighborhood design by unsupervised learning ⋮ Local search heuristics for the mobile facility location problem ⋮ New heuristic algorithms for solving the planar \(p\)-median problem ⋮ A new heuristic for solving the \(p\)-median problem in the plane ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ Design of survivable IP-over-optical networks ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ An immune memory clonal algorithm for numerical and combinatorial optimization ⋮ Application of the cross-entropy method to clustering and vector quantization ⋮ MineLib: a library of open pit mining problems ⋮ Multi-depot multiple TSP: a polyhedral study and computational results ⋮ Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions ⋮ Evolutionary self-adaptation: a survey of operators and strategy parameters ⋮ A heuristic procedure for the capacitated \(m\)-ring-star problem ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem ⋮ Practical algorithms for branch-decompositions of planar graphs ⋮ Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ Models for the single-vehicle preemptive pickup and delivery problem ⋮ The tree representation for the pickup and delivery traveling salesman problem with LIFO loading ⋮ The delivery man problem with time windows ⋮ Using Markov chains to analyze the effectiveness of local search algorithms ⋮ On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain ⋮ Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Variable neighborhood search for harmonic means clustering ⋮ An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem ⋮ A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior ⋮ Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem ⋮ The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm ⋮ Approximating the metric TSP in linear time ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ An approximation algorithm for network design problems with downwards-monotone demand functions ⋮ Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem ⋮ A tabu search heuristic for the generalized minimum spanning tree problem ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ Single-facility huff location problems on networks ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Improving genetic algorithm with fine-tuned crossover and scaled architecture ⋮ A discrete gravitational search algorithm for solving combinatorial optimization problems ⋮ Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm ⋮ A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs ⋮ Design of hybrids for the minimum sum-of-squares clustering problem ⋮ New local searches for solving the multi-source Weber problem ⋮ Multiple depot ring star problem: a polyhedral study and an exact algorithm ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem ⋮ A comparative analysis of several asymmetric traveling salesman problem formulations ⋮ A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand ⋮ Rank aggregation in cyclic sequences ⋮ Solving combinatorial optimization problems using augmented Lagrange chaotic simulated annealing ⋮ Canonical dual approach to solving the maximum cut problem ⋮ Symmetric weight constrained traveling salesman problem: Local search ⋮ A memetic algorithm for the generalized traveling salesman problem ⋮ Genetic algorithm for combinatorial path planning: the subtour problem ⋮ Computing compatible tours for the symmetric traveling salesman problem ⋮ Variable neighbourhood search: methods and applications ⋮ A framework for analyzing sub-optimal performance of local search algorithms ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ The effective application of a new approach to the generalized orienteering problem ⋮ The neighbor-net algorithm ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems ⋮ A library of local search heuristics for the vehicle routing problem ⋮ On the domino-parity inequalities for the STSP ⋮ Solving the family traveling salesman problem ⋮ Strong multi-commodity flow formulations for the asymmetric traveling salesman problem ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ A hyperbolic smoothing approach to the multisource Weber problem ⋮ TSPLIB ⋮ Efficiently solving the traveling thief problem using hill climbing and simulated annealing ⋮ Parallelization strategies for rollout algorithms ⋮ Performance analysis of cyclical simulated annealing algorithms ⋮ A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms ⋮ Enhancements to two exact algorithms for solving the vertex \(P\)-center problem ⋮ Metaheuristic applications on discrete facility location problems: a survey ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem

This page was built for publication: TSPLIB—A Traveling Salesman Problem Library