A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
From MaRDI portal
Publication:323161
DOI10.1016/j.ejor.2015.12.051zbMath1346.90224OpenAlexW2234356561MaRDI QIDQ323161
Dimitris C. Paraskevopoulos, Tolga Bektaş, Chris N. Potts, Teodor Gabriel Crainic
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
evolutionary algorithmsscatter searchiterated local searchejection chainsmulti-commodity network design
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
A parallel local search framework for the fixed-charge multicommodity network flow problem, The transit time constrained fixed charge multi-commodity network design problem, Minimum‐cost flow problems having arc‐activation costs, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, Multi-warehouse package consolidation for split orders in online retailing, A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Scatter search for 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
- Local branching
- Greedy randomized adaptive search procedures
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
