Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
From MaRDI portal
Publication:1919844
DOI10.1007/BF02125458zbMath0851.90033MaRDI QIDQ1919844
Michel Toulouse, Teodor Gabriel Crainic, Michel Gendreau
Publication date: 18 September 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
tabu searchmulticommodity location-allocation problemsasynchronous parallelization strategiesasynchronous strategies
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)
Related Items
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, 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, An approach for solving competitive location problems with variable demand using multicore systems, Parallel Solution Methods for Vehicle Routing Problems, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
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
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- 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
- A branch-and-bound algorithm for depot location and container fleet management
- Parallel iterative search methods for vehicle routing problems
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem