A first multilevel cooperative algorithm for capacitated multicommodity network design
DOI10.1016/J.COR.2005.07.015zbMATH Open1086.90009OpenAlexW2106852598MaRDI QIDQ2489307FDOQ2489307
Authors: Teodor Gabriel Crainic, Ye Li, Michel Toulouse 
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
Recommendations
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- Scatter search for network design problem
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
Capacitated multicommodity network designCycle-based tabu searchMultilevel cooperationParallel search
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Service network design in freight transportation
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Multilevel optimization in VLSICAD
- Probabilistic diversification and intensification in local search for vehicle routing
- Toward a Taxonomy of Parallel Tabu Search Heuristics
- Title not available (Why is that?)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Title not available (Why is that?)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Composite Variable Formulations for Express Shipment Service Network Design
- Title not available (Why is that?)
- Strategies for the parallel implementation of metaheuristics
- Title not available (Why is that?)
- Parallel Strategies for Meta-Heuristics
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Multimodal Express Package Delivery: A Service Network Design Application
- Parallel local search
- Subgradient Methods for the Service Network Design Problem
- Title not available (Why is that?)
- Global optimization properties of parallel cooperative search algorithms: A simulation study
Cited In (12)
- A scheme for determining vehicle routes based on Arc-based service network design
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Multimodal freight transportation planning: a literature review
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- Parallel solution methods for vehicle routing problems
- A multilevel tabu search algorithm for the feature selection problem in biomedical data
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
This page was built for publication: A first multilevel cooperative algorithm for capacitated multicommodity network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489307)
