Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem

From MaRDI portal
Revision as of 17:20, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:918425

DOI10.1007/BF02022093zbMath0705.90069OpenAlexW2123608273MaRDI QIDQ918425

Mohan Guruswamy, Miroslaw Malek, Mihir Pandya

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02022093




Related Items (32)

A user's guide to tabu searchHashing vectors for tabu searchPart type selection problem in flexible manufacturing systems: Tabu search algorithmsGenetic algorithms and tabu search: Hybrids for optimizationMulti-start iterated tabu search for the minimum weight vertex cover problemRouting problems: A bibliographySynchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirementsEjection chains, reference structures and alternating path methods for traveling salesman problemsParallel asynchronous tabu search for multicommodity location-allocation with balancing requirementsGenetic algorithms for the traveling salesman problemMetaheuristics: A bibliographyParallel local searchHeuristics for biquadratic assignment problems and their computational comparisonLeast-cost network topology design for a new service: An application of tabu searchExperimental analysis of simulated annealing based algorithms for the layout problemOptimizing the system of virtual paths by tabu search.An iterative three-component heuristic for the team orienteering problem with time windowsMultiperiod multi traveling salesmen problem considering time window constraints with an application to a real world caseEvaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and schedulingA tabu search algorithm for the routing and capacity assignment problem in computer networksArtificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costsTwo simulated annealing optimization schemas for rational Bézier curve fitting in the presence of noiseSO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applicationsSolving the medium newspaper production/distribution problemOptimizing tabu list size for the traveling salesman problemA simple tabu search method to solve the mixed-integer linear bilevel programming problemParallel processing for difficult combinatorial optimization problemsThe life span method -- a new variant of local searchCyber swarm algorithms - improving particle swarm optimization using adaptive memory strategiesAn empirical study of a new metaheuristic for the traveling salesman problemAdaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman ProblemClustering categorical data sets using tabu search techniques



Cites Work




This page was built for publication: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem