Scatter search for network design problem
From MaRDI portal
Publication:817138
DOI10.1007/S10479-005-2451-4zbMATH Open1091.90006OpenAlexW2085525077MaRDI QIDQ817138FDOQ817138
José Luis González-Velarde, Karim De-Alba, Ada Alvarez
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-2451-4
Recommendations
- A scatter search heuristic for the fixed-charge capacitated network design problem
- Memetic algorithms
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- A dual ascent approach to the fixed-charge capacitated network design problem
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- A dual ascent approach to the fixed-charge capacitated network design problem
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- Service network design in freight transportation
- Greedy randomized adaptive search procedures
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Tailoring Benders decomposition for uncapacitated network design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Title not available (Why is that?)
Cited In (12)
- MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem
- Title not available (Why is that?)
- Two-level evolutionary approach to the survivable mesh-based transport network topological design
- Memetic algorithms
- A meta-heuristic approach for solving the urban network design problem
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- Mixed network design using hybrid scatter search
- 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 scatter search heuristic for the fixed-charge capacitated network design problem
- Multiterminal net assignments by scatter search
Uses Software
This page was built for publication: Scatter search for network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817138)
