Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
From MaRDI portal
Publication:1908996
DOI10.1007/BF01719254zbMath0843.90067OpenAlexW1997202925MaRDI QIDQ1908996
Michel Gendreau, Michel Toulouse, Teodor Gabriel Crainic
Publication date: 19 August 1996
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01719254
Combinatorial optimization (90C27) Discrete location and assignment (90B80) Parallel numerical computation (65Y05)
Related Items
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, A parallel branch-and-bound algorithm for multicommodity location with balancing requirements, Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements, Metaheuristics: A bibliography, A cooperative hyper-heuristic search framework, Parallel local search, Combining metaheuristics with mathematical programming, constraint programming and machine learning, An approach for solving competitive location problems with variable demand using multicore systems, Combining metaheuristics with mathematical programming, constraint programming and machine learning
Uses Software
Cites Work
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Models for multimode multicommodity location problems with interdepot balancing requirements
- A connectionist approach to the quadratic assignment problem
- A branch-and-bound method for multicommodity location with balancing requirements
- Future paths for integer programming and links to artificial intelligence
- A user's guide to tabu search
- Massively parallel tabu search for the quadratic assignment problem
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Tabu Search—Part I
- Tabu Search—Part II
- Bandwidth Packing: A Tabu Search Approach
- A branch-and-bound algorithm for depot location and container fleet management
- Parallel iterative search methods for vehicle routing problems
- Unnamed Item