Scatter search for the linear ordering problem
New ideas in optimization
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps
Journal of Heuristics
Application of GRASP to the Multiconstraint Knapsack Problem
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
INFORMS Journal on Computing
A Simplex-Based Tabu Search Method for Capacitated Network Design
INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Minimizing Labor Requirements in a Periodic Vehicle Loading Problem
Computational Optimization and Applications
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Computers and Operations Research
Particle swarm optimisation for the design of two-connected networks with bounded rings
International Journal of High Performance Systems Architecture
Hi-index | 0.00 |
A GRASP embedded Scatter Search is developed for the multicommodity capacitated network design problem. Difficulty for this problem arises from the fact that selection of the optimal network design is an NP-complete combinatorial problem. There exist no polynomial exact algorithms which can solve this problem in a reasonable period of time for realistically sized instances. In such cases, heuristic procedures are commonly used. Two strategies were designed for GRASP: a traditional approach and a memory based technique. As for Scatter Search, 5 different strategies were used to update the reference set. Computational results on a large set of randomly generated instances show the convenience of the proposed procedures.