A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
DOI10.1016/J.EJOR.2015.12.051zbMATH Open1346.90224OpenAlexW2234356561MaRDI QIDQ323161FDOQ323161
Authors: Dimitris C. Paraskevopoulos, Tolga Bektaş, Teodor Gabriel Crainic, Chris N. Potts 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://openaccess.city.ac.uk/19844/1/A%20cycle-based%20evolutionary%20algorithm%20for%20the%20%20xed-charge.pdf
Recommendations
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
evolutionary algorithmsscatter searchiterated local searchejection chainsmulti-commodity network design
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- Title not available (Why is that?)
- Local branching
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Greedy randomized adaptive search procedures
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Scatter search for network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- A scatter search heuristic for the fixed-charge capacitated network design problem
- 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
- A capacity scaling heuristic for the multicommodity capacitated network design problem
Cited In (13)
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- Multi-warehouse package consolidation for split orders in online retailing
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- The transit time constrained fixed charge multi-commodity network design problem
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- A scatter search heuristic for the fixed-charge capacitated network design problem
- Minimum‐cost flow problems having arc‐activation costs
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
This page was built for publication: A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323161)
