Scatter search for network design problem
From MaRDI portal
Publication:817138
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
Cites work
- scientific article; zbMATH DE number 2209655 (Why is no real title available?)
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- 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 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
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Greedy randomized adaptive search procedures
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Service network design in freight transportation
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- Tailoring Benders decomposition for uncapacitated network design
Cited in
(17)- Implementation of scatter search for multi-objective optimization: a comparative study
- A meta-heuristic approach for solving the urban network design problem
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- A scatter search-based heuristic to locate capacitated transshipment points
- A scatter search heuristic for the fixed-charge capacitated network design problem
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- Multiterminal net assignments by scatter search
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- scientific article; zbMATH DE number 2159379 (Why is no real title available?)
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Scatter search algorithm for collaborative optimal allocation of complex product
- 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
- Two-level evolutionary approach to the survivable mesh-based transport network topological design
- Memetic algorithms
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
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)
