A hybrid lagrangian relaxation and tabu search method for interdependent-choice network design problems
Research output: Contribution to book/conference proceedings/anthology/report › Chapter in book/anthology/report › Contributed › peer-review
Contributors
Abstract
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.
Details
Original language | English |
---|---|
Title of host publication | Hybrid Algorithms for Service, Computing and Manufacturing Systems |
Publisher | IGI Global |
Pages | 294-324 |
Number of pages | 31 |
ISBN (print) | 9781613500866 |
Publication status | Published - 2011 |
Peer-reviewed | Yes |
Externally published | Yes |
External IDs
ORCID | /0000-0002-2939-2090/work/141543880 |
---|