A parallel tabu search algorithm for large traveling salesman problems
From MaRDI portal
Publication:1329785
DOI10.1016/0166-218X(92)00033-IzbMath0938.68942OpenAlexW2095546721WikidataQ127908973 ScholiaQ127908973MaRDI QIDQ1329785
Publication date: 21 June 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)00033-i
Related Items
Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry, Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, A tabu search algorithm for computing an operational timetable, A review of combinatorial problems arising in feedforward neural network design, A study of diversification strategies for the quadratic assignment problem, A cooperative parallel tabu search algorithm for the quadratic assignment problem, Genetic operators for combinatorial optimization in TSP and microarray gene ordering, Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices, Routing problems: A bibliography, Ejection chains, reference structures and alternating path methods for traveling salesman problems, A randomized tabu search-based approach for perfect stranger matching in economic experiments, Divide and conquer strategies for parallel TSP heuristics, Metaheuristics: A bibliography, Parallel local search, Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints, Generating Fingerings for Polyphonic Piano Music with a Tabu Search Algorithm, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, On estimating the distribution of optimal traveling salesman tour lengths using heuristics, The traveling salesman problem: An overview of exact and approximate algorithms, Developing equilibrium optimization methods for hub location problems, A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion, An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms, SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications, Routing heuristics for automated pick and place machines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- A parallel shortest path algorithm
- The tabu search metaheuristic: How we used it
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- A user's guide to tabu search
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
- Tabu Search—Part I
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
