article

Bounds for the single source modular capacitated plant location problem

Authors:

Isabel Correia,

Maria Eugénia CaptivoAuthors Info & Claims

Computers and Operations Research, Volume 33, Issue 10

Pages 2991 - 3003

https://doi.org/10.1016/j.cor.2005.02.030

Published: 01 October 2006 Publication History

Abstract

In this paper, we propose a discrete location problem, which we call the Single Source Modular Capacitated Location Problem (SS-MCLP). The problem consists of finding the location and capacity of the facilities, to serve a set of customers at a minimum total cost. The demand of each customer must be satisfied by one facility only and the capacities of the open facilities must be chosen from a finite and discrete set of allowable capacities. Because the SS-MCLP is a difficult problem, a lagrangean heuristic, enhanced by tabu search or local search was developed in order to obtain good feasible solutions. When needed, the lower bounds are used in order to evaluate the quality of the feasible solutions. Our method was tested computationally on randomly generated test problems some of which are with large dimensions considering the literature related to this type of problem. The computational results obtained were compared with those provided by the commercial software Cplex.

References

[1]

{1} Correia I, Captivo ME. A Lagrangean heuristics for a modular capacitated location problem. Annals of Operations Research 2003;122:141-61.

Google Scholar

[2]

{2} Holmberg K. Solving the staircase cost facility location problem with decomposition and piecewise linearization. European Journal of Operational Research 1994;75:41-61.

Google Scholar

[3]

{3} Holmberg K, Ling J. A lagrangean heuristic for the facility location problem with staircase costs. European Journal of Operational Research 1997;97:63-74.

Google Scholar

[4]

{4} Harkness J, Revelle C. A Lagrangean heuristic for the staircase cost facility location problem. International Journal of Industrial Engineering-Theory, Applications and Practice 2002;9(1):36-44.

Google Scholar

[5]

{5} Beasley J. An algorithm for solving large capacitated warehouse location problems. European Journal of Operational Research 1988;33:314-25.

Google Scholar

[6]

{6} Beasley J. Lagrangean heuristics for location problems. European Journal of Operational Research 1993;65:383-99.

Google Scholar

[7]

{7} Cortinhal MJ, Captivo ME. Upper and lower bounds for the single source capacitated location problem. European Journal of Operational Research 2003;151(2):333-51.

Google Scholar

[8]

{8} Glover F, Laguna M. Tabu search. Dordrecht: Kluwer Academic Publishers; 1997.

Digital Library

Google Scholar

[9]

{9} Klincewicz J. Avoiding local optima in the p-hub location problem using Tabu Search and GRASP. Annals of Operations Research 1992;40:283-302.

Digital Library

Google Scholar

[10]

{10} Rolland E, Schilling D, Current J. An efficient Tabu Search procedure for the p-median problem. European Journal of Operational Research 1997;96:329-42.

Google Scholar

[11]

{11} Geoffrion A. Lagrangean relaxation for integer programming. Mathematical Programming Study 1974;2:82-114.

Google Scholar

[12]

{12} Held M, Wolfe P, Crowder H. Validation of subgradient optimization. Mathematical Programming 1974;6:62-6.

Google Scholar

[13]

{13} Tuzun D, Burke L. A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 1999;116:87-99.

Google Scholar

[14]

{14} Cplex. Using the Cplex callable library, Version 8.0, ILOG, Inc., 2002.

Google Scholar

Cited By

View all

Alarcon-Gerbier EBuscher U(2022)Modular and mobile facility location problemsComputers and Industrial Engineering10.1016/j.cie.2022.108734173:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.cie.2022.108734
Gergin ZTunçbilek NEsnaf Ş(2019)Clustering Approach Using Artificial Bee Colony Algorithm for Healthcare Waste Disposal Facility Location ProblemInternational Journal of Operations Research and Information Systems10.4018/IJORIS.201901010410:1(56-75)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.4018/IJORIS.2019010104
Jena SCordeau JGendron B(2017)Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular CapacitiesINFORMS Journal on Computing10.1287/ijoc.2016.073829:2(388-404)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1287/ijoc.2016.0738
Show More Cited By

Index Terms

Bounds for the single source modular capacitated plant location problem
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching

Recommendations

An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem

Graphical abstractDisplay Omitted HighlightsStudies the Single Source Capacitated Facility Location Problem.Develops an iterated tabu search heuristic.Computational results show that this simple heuristic produces high-quality solutions. This paper ...
An efficient tabu search for solving the uncapacitated single allocation hub location problem

Given an efficient tabu search the uncapacitated single allocation hub location problem.Given some new tabu rules.Given some new theoretical results for computing the changes in the objective function's value for three types of moves.Improved the best ...
Strategic oscillation for the capacitated hub location problem with modular links

The capacitated single assignment hub location problem with modular link capacities is a variant of the classical hub location problem in which the cost of using edges is not linear but stepwise, and the hubs are restricted in terms of transit capacity ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computers and Operations Research

Computers and Operations Research Volume 33, Issue 10

October 2006

291 pages

ISSN:0305-0548

Issue’s Table of Contents

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 October 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alarcon-Gerbier EBuscher U(2022)Modular and mobile facility location problemsComputers and Industrial Engineering10.1016/j.cie.2022.108734173:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.cie.2022.108734
Gergin ZTunçbilek NEsnaf Ş(2019)Clustering Approach Using Artificial Bee Colony Algorithm for Healthcare Waste Disposal Facility Location ProblemInternational Journal of Operations Research and Information Systems10.4018/IJORIS.201901010410:1(56-75)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.4018/IJORIS.2019010104
Jena SCordeau JGendron B(2017)Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular CapacitiesINFORMS Journal on Computing10.1287/ijoc.2016.073829:2(388-404)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1287/ijoc.2016.0738
Gendron BKhuong PSemet F(2015)Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignmentNetworks10.1002/net.2162666:3(214-234)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1002/net.21626
Tang JTang LWang X(2013)Solution method for the location planning problem of logistics park with variable capacityComputers and Operations Research10.1016/j.cor.2012.07.01140:1(406-417)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1016/j.cor.2012.07.011
Fazel-Zarandi MBeck J(2012)Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location ProblemINFORMS Journal on Computing10.1287/ijoc.1110.045824:3(387-398)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1287/ijoc.1110.0458

Abstract

References

Cited By

Index Terms

Recommendations

An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem

An efficient tabu search for solving the uncapacitated single allocation hub location problem

Strategic oscillation for the capacitated hub location problem with modular links

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations