Scatter search for network design problem

DOI10.1007/s10479-005-2451-4zbMath1091.90006OpenAlexW2085525077MaRDI QIDQ817138

José Luis González-Velarde, Karim De-Alba, Ada M. 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

zbMATH Keywords

metaheuristicsGRASPnetwork designscatter search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

A capacity scaling heuristic for the multicommodity capacitated network design problem, Mixed network design using hybrid scatter search, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, A parallel local search framework for the fixed-charge multicommodity network flow problem, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, Two-level evolutionary approach to the survivable mesh-based transport network topological design, A meta-heuristic approach for solving the urban network design problem

Uses Software

• CPLEX
• Scatter Search

Cites Work

• Unnamed Item
• A dual ascent approach to the fixed-charge capacitated network design problem
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• Service network design in freight transportation
• A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
• Greedy randomized adaptive search procedures
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• Tailoring Benders decomposition for uncapacitated network design
• A Simplex-Based Tabu Search Method for Capacitated Network Design
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design