Tabu search applied to a capacitated location problem
Conference
·
OSTI ID:35878
In this talk we present a tabu search approach for a Capacitated Location Problem where partial assignment of clients to facilities is allowed. We developed several heuristics, using aspiration level conditions, intensification and diversification strategies and also the cancellation sequence method and the reverse elimination method. We present and discuss computational results obtained for a large set of test problems.
- OSTI ID:
- 35878
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tabu search: Improved solution alternatives
Tabu search techniques for large high-school timetabling problems
Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36064
Tabu search techniques for large high-school timetabling problems
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:430681
Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.
Journal Article
·
Wed Sep 01 00:00:00 EDT 2004
· Proposed for publication in the Journal of Artificial Intelligence Research.
·
OSTI ID:951734