A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem

Authors:
R. K. Ahuja;J. B. Orlin;S. Pallottino;M. P. Scaparra;M. G. Scutellà
Affiliations:
-;-;-;-;-
Venue:
Management Science
Year:
2004

Citing 0
Cited 14

Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem

Journal of Heuristics
A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem

Computers and Operations Research
Ant Based Heuristics for the Capacitated Fixed Charge Location Problem

ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Benders decomposition, Lagrangean relaxation and metaheuristic design

Journal of Heuristics
A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources

Computers and Operations Research
Relaxations and exact solution of the variable sized bin packing problem

Computational Optimization and Applications
Optimizing single-source capacitated FLP in fuzzy decision systems

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Journal of Mathematical Modelling and Algorithms
A variable neighborhood search heuristic for the design of multicommodity production---distribution networks with alternative facility configurations

OR Spectrum
A multi-exchange heuristic for a production location problem

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
An adaptive search heuristic for the capacitated fixed charge location problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand

Journal of Heuristics
Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a very large-scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced by customer multi-exchanges and by facility moves. We consider both traditional single-customer multi-exchanges, detected on a suitably definedcustomer improvement graph, and more innovative multicustomer multi-exchanges, detected on afacility improvement graph dynamically built through the use of a greedy scheme. Computational results for some benchmark instances are reported that demonstrate the effectiveness of the approach for solving large-scale problems. A further test on real data involving an Italian factory is also presented.