A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
From MaRDI portal
(Redirected from Publication:323161)
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
Cites work
- scientific article; zbMATH DE number 1175958 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- A local branching heuristic for the capacitated fixed-charge network design problem
- A scatter search heuristic for the fixed-charge capacitated network design problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge 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
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Greedy randomized adaptive search procedures
- Local branching
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Scatter search for network design problem
Cited in
(13)- The transit time constrained fixed charge multi-commodity network design problem
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
- Minimum‐cost flow problems having arc‐activation costs
- A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- 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
- Multi-warehouse package consolidation for split orders in online retailing
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- A scatter search heuristic for the fixed-charge capacitated network design problem
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- A parallel local search framework for the fixed-charge multicommodity network flow problem
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)
