Title
A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
Abstract
We consider a generalization of the well-known capacitated facility location problem with single source constraints in which customer demand contains a flexible dimension. This work focuses on providing fast and practically implementable optimization-based heuristic solution methods for very large scale problem instances. We offer a unique approach that utilizes a high-quality efficient heuristic within a neighborhood search to address the combined assignment and fixed-charge structure of the underlying optimization problem. We also study the potential benefits of combining our approach with a so-called very large-scale neighborhood search (VLSN) method. As our computational test results indicate, our work offers an attractive solution approach that can be tailored to successfully solve a broad class of problem instances for facility location and similar fixed-charge problems.
Year
DOI
Venue
2012
10.1007/s10732-011-9179-x
J. Heuristics
Keywords
Field
DocType
Neighborhood search,Facility location,Assignment problem
Mathematical optimization,Heuristic,Facility location problem,Assignment problem,Neighborhood search,1-center problem,Optimization problem,Mathematics
Journal
Volume
Issue
ISSN
18
2
1381-1231
Citations 
PageRank 
References 
2
0.36
18
Authors
3
Name
Order
Citations
PageRank
Chase Rainwater1707.12
Joseph Geunes230828.72
H. Edwin Romeijn376983.88