Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
From MaRDI portal
Publication:1908996
DOI10.1007/BF01719254zbMATH Open0843.90067OpenAlexW1997202925MaRDI QIDQ1908996FDOQ1908996
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
Recommendations
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Tabu Search With Exact Neighbor Evaluation For Multicommodity Location With Balancing Requirements
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
Parallel numerical computation (65Y05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- A user's guide to tabu search
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- Tabu Search—Part II
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Bandwidth Packing: A Tabu Search Approach
- Parallel iterative search methods for vehicle routing problems
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Massively parallel tabu search for the quadratic assignment problem
- A branch-and-bound method for multicommodity location with balancing requirements
- Models for multimode multicommodity location problems with interdepot balancing requirements
- A connectionist approach to the quadratic assignment problem
- A branch-and-bound algorithm for depot location and container fleet management
- Title not available (Why is that?)
Cited In (11)
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Parallel local search
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- An approach for solving competitive location problems with variable demand using multicore systems
- A cooperative hyper-heuristic search framework
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- Metaheuristics: A bibliography
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
Uses Software
This page was built for publication: Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908996)
