A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM
This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neigh- borhood structures are induced by customer multi-exchanges and by facility moves. We consider both single-customer multi-exchanges,...
Main Authors: | Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutella, M.G. |
---|---|
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/1797 |
Similar Items
-
Heuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems
by: Mohammad Rohaninejad, et al.
Published: (2015-09-01) -
Constructive and tabu search heuristics for capacitated continuous location-allocation problem /
by: 564849 Zaitul Marlizawati Zainuddin
Published: (2004) -
Heuristic Approaches for Location Assignment of Capacitated Services in Smart Cities
by: Gerbrich Hoekstra, et al.
Published: (2018-12-01) -
A variable neighborhood descent based heuristic to solve the capacitated location-routing problem
by: M. S. Jabal-Ameli, et al.
Published: (2011-01-01) -
DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS
by: Ahuja, Ravindra, et al.
Published: (2003)