A first multilevel cooperative algorithm for capacitated multicommodity network design
From MaRDI portal
Publication:2489307
DOI10.1016/j.cor.2005.07.015zbMath1086.90009OpenAlexW2106852598MaRDI QIDQ2489307
Teodor Gabriel Crainic, Michel Toulouse, Ye Li
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.015
Capacitated multicommodity network designCycle-based tabu searchMultilevel cooperationParallel search
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design, A scheme for determining vehicle routes based on Arc-based service network design, Multimodal freight transportation planning: a literature review, A capacity scaling heuristic for the multicommodity capacitated network design problem, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, A parallel local search framework for the fixed-charge multicommodity network flow problem, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, A multilevel tabu search algorithm for the feature selection problem in biomedical data, Parallel Solution Methods for Vehicle Routing Problems, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, A local branching heuristic for the capacitated fixed-charge network design problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Multilevel optimization in VLSICAD
- Service network design in freight transportation
- Global optimization properties of parallel cooperative search algorithms: A simulation study
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Parallel local search
- Probabilistic diversification and intensification in local search for vehicle routing
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- An Efficient Heuristic Procedure for Partitioning Graphs
- Subgradient Methods for the Service Network Design Problem
- Toward a Taxonomy of Parallel Tabu Search Heuristics
- Composite Variable Formulations for Express Shipment Service Network Design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Parallel Strategies for Meta-Heuristics
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Multimodal Express Package Delivery: A Service Network Design Application
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
