A Simplex-Based Tabu Search Method for Capacitated Network Design

2000 ◽  
Vol 12 (3) ◽  
pp. 223-236 ◽  
Author(s):  
Teodor Gabriel Crainic ◽  
Michel Gendreau ◽  
Judith M. Farvolden
Author(s):  
Chi Xie ◽  
Mark A. Turnquist ◽  
S. Travis Waller

Hybridization offers a promising approach in designing and developing improved metaheuristic methods for a variety of complex combinatorial optimization problems. This chapter presents a hybrid Lagrangian relaxation and tabu search method for a class of discrete network design problems with complex interdependent-choice constraints. This method takes advantage of Lagrangian relaxation for problem decomposition and complexity reduction while its algorithmic logic is designed based on the principles of tabu search. The algorithmic advance and solution performance of the method are illustrated by implementing it for solving a network design problem with lane reversal and crossing elimination strategies, arising from urban evacuation planning.


Networks ◽  
2016 ◽  
Vol 68 (2) ◽  
pp. 141-158 ◽  
Author(s):  
André Chassein ◽  
Sven O. Krumke ◽  
Clemens Thielen

2006 ◽  
Vol 106 (6) ◽  
pp. 1406-1412 ◽  
Author(s):  
T. Rusu ◽  
V. Bulacovschi

Sign in / Sign up

Export Citation Format

Share Document