research-article

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

Author:

Sin C. HoAuthors Info & Claims

Applied Soft Computing, Volume 27, Issue C

Pages 169 - 178

https://doi.org/10.1016/j.asoc.2014.11.004

Published: 01 February 2015 Publication History

Abstract

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 discusses the Single Source Capacitated Facility Location Problem (SSCFLP) where the problem consists in determining a subset of capacitated facilities to be opened in order to satisfy the customers' demands such that total costs are minimized. The paper presents an iterated tabu search heuristic to solve the SSCFLP. The iterated tabu search heuristic combines tabu search with perturbation operators to avoid getting stuck in local optima. Experimental results show that this simple heuristic is capable of generating high quality solutions using small computing times. Moreover, it is also competitive with other metaheuristic approaches for solving the SSCFLP.

References

[1]

H. Timmons, Ford to increase its plant capacity in India, 2011. http://www.nytimes.com/2011/07/28/business/ford-to-increase-its-plant-capacity-in-india.html

[2]

A. Klose, A. Drexl, Facility location models for distribution system design, Eur. J. Oper. Res., 162 (2005) 4-29.

[3]

M.T. Melo, S. Nickel, F. Saldanha-da-Gama, Facility location and supply chain management - A review, Eur. J. Oper. Res., 196 (2009) 401-412.

[4]

H.A. Eiselt, V. Marianov, Foundations of Location Analysis, Springer, 2011.

[5]

V.F. Yu, S.-W. Lin, Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery, Appl. Soft Comput., 24 (2014) 284-290.

Digital Library

[6]

I. Harris, C.L. Mumford, M.M. Naim, A hybrid multi-objective approach to capacitated facility location with flexible store allocation for green logistics modeling, Transp. Res. E, 66 (2014) 1-22.

[7]

A.W. Neebe, M.R. Rao, An algorithm for the fixed-charge assigning users to sources problem, J. Oper. Res. Soc., 34 (1983) 1107-1113.

[8]

K. Holmberg, M. Rönnqvist, D. Yuan, An exact algorithm for the capacitated facility location problems with single sourcing, Eur. J. Oper. Res., 113 (1999) 544-559.

[9]

M. Rönnqvist, S. Tragantalerngsak, J. Holt, A repeated matching heuristic for the single-source capacitated facility location problem, Eur. J. Oper. Res., 116 (1999) 51-68.

[10]

J.A. Díaz, E. Fernández, A branch-and-price algorithm for the single source capacitated plant location problem, J. Oper. Res. Soc., 53 (2002) 728-740.

[11]

Z. Yang, F. Chu, H. Chen, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Eur. J. Oper. Res., 221 (2012) 521-532.

[12]

R.D. Galv ao, V. Marianov, Lagrangean relaxation-based techniques for solving facility location problems, in: Foundations of Location Analysis, Springer, 2011, pp. 391-420.

[13]

J.G. Klincewicz, H. Luss, A lagrangian relaxation heuristic for capacitated facility location with single-source constraints, J. Oper. Res. Soc., 37 (1986) 495-500.

[14]

K.S. Hindi, K. Pienkosz, Efficient solution of large scale, single-source, capacitated plant location problems, J. Oper. Res. Soc., 50 (1999) 268-274.

[15]

M.J. Cortinhal, M.E. Captivo, Upper and lower bounds for the single source capacitated location problem, Eur. J. Oper. Res., 151 (2003) 333-351.

[16]

H. Delmaire, J.A. Díaz, E. Fernández, M. Ortega, Comparing new heuristics for the pure integer capacitated plant location problem, Invest. Oper., 8 (1999) 217-242.

[17]

H. Delmaire, J.A. Díaz, E. Fernández, M. Ortega, Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem, INFOR, 37 (1999) 194-225.

[18]

R.K. Ahuja, J.B. Orlin, S. Pallottino, M.P. Scaparra, M.G. Scutellí, A multi-exchange heuristic for the single-source capacitated facility location problem, Manage. Sci., 50 (2004) 749-760.

Digital Library

[19]

I.A. Contreras, J.A. Díaz, Scatter search for the single source capacitated facility location problem, Ann. Oper. Res., 157 (2008) 73-89.

[20]

C.-H. Chen, C.-J. Ting, Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem, Transp. Res. E, 44 (2008) 1099-1122.

[21]

H.R. Lourenço, O. Martin, T. Stützle, Iterated local search, in: Handbook of Metaheuristics, Kluwer Academic Publishers, 2003, pp. 321-353.

[22]

F. Glover, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res., 13 (1986) 533-549.

Digital Library

[23]

G. Dueck, New optimization heuristics: The great deluge algorithm and the record-to-record travel, J. Comput. Phys., 104 (1993) 86-92.

Digital Library

Cited By

de Almeida Gde Sá Ede Souza SSouza M(2024)A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problemsJournal of Heuristics10.1007/s10732-023-09524-930:3-4(145-172)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10732-023-09524-9
Baş EYildizdan G(2024)A new binary arithmetic optimization algorithm for uncapacitated facility location problemNeural Computing and Applications10.1007/s00521-023-09261-x36:8(4151-4177)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s00521-023-09261-x
Maia MReula MParreño-Torres CVuppuluri PPlastino ASouza UCeschia SPavone MSchaerf A(2022)Metaheuristic techniques for the capacitated facility location problem with customer incompatibilitiesSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-022-07600-z27:8(4685-4698)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1007/s00500-022-07600-z
Show More Cited By

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

Recommendations

A tabu search heuristic procedure for the capacitated facility location problem

A tabu search heuristic procedure is developed, implemented and computationally tested for the capacitated facility location problem. The procedure uses different memory structures. Visited solutions are stored in a primogenitary linked quad tree. For ...
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 ...
Solving the uncapacitated facility location problem using tabu search
Anniversary focused issue of computers & operations research on tabu search

A tabu search heuristic procedure is developed to solve the uncapacitated facility location problem. Tabu search is used to guide the solution process when evolving from one solution to another. A move is defined to be the opening or closing of a ...

Comments

Information & Contributors

Information

Published In

cover image Applied Soft Computing

Applied Soft Computing Volume 27, Issue C

February 2015

627 pages

ISSN:1568-4946

Issue’s Table of Contents

Copyright © Elsevier B.V.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 February 2015

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

de Almeida Gde Sá Ede Souza SSouza M(2024)A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problemsJournal of Heuristics10.1007/s10732-023-09524-930:3-4(145-172)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10732-023-09524-9
Baş EYildizdan G(2024)A new binary arithmetic optimization algorithm for uncapacitated facility location problemNeural Computing and Applications10.1007/s00521-023-09261-x36:8(4151-4177)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s00521-023-09261-x
Maia MReula MParreño-Torres CVuppuluri PPlastino ASouza UCeschia SPavone MSchaerf A(2022)Metaheuristic techniques for the capacitated facility location problem with customer incompatibilitiesSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-022-07600-z27:8(4685-4698)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1007/s00500-022-07600-z
Oliveira ÓMatos TGamboa D(2021)A dual RAMP algorithm for single source capacitated facility location problemsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-021-09756-089:8-9(815-834)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1007/s10472-021-09756-0
Polak IBoryczka M(2019)Tabu Search in revealing the internal state of RC4+ cipherApplied Soft Computing10.1016/j.asoc.2019.01.03977:C(509-519)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1016/j.asoc.2019.01.039
Zhang HBeltran-Royo CWang BZhang Z(2019)Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerceComputational Optimization and Applications10.1007/s10589-019-00061-572:3(827-848)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s10589-019-00061-5
Oliveira ÓMatos TGamboa D(2019)A RAMP Algorithm for Large-Scale Single Source Capacitated Facility Location ProblemsLearning and Intelligent Optimization10.1007/978-3-030-38629-0_14(171-183)Online publication date: 27-May-2019
https://dl.acm.org/doi/10.1007/978-3-030-38629-0_14
(2018)An efficient approximation algorithm for the extension facility location problem on torus internetwork topologyInternational Journal of Computing Science and Mathematics10.1504/IJCSM.2018.0917369:2(189-196)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1504/IJCSM.2018.091736
Smart EBrown DToumi Borges KGranger-Brown N(2017)Reducing energy usage in drive storage clusters through intelligent allocation of incoming commandsApplied Soft Computing10.1016/j.asoc.2016.10.00552:C(673-686)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1016/j.asoc.2016.10.005
Ferdi ILayeb ADjeddi CSiddiqi IBennour AChibani YEl Abed H(2016)A Novel Heuristic Based Simulated Annealing for the Capacitated Location Routing ProblemProceedings of the Mediterranean Conference on Pattern Recognition and Artificial Intelligence10.1145/3038884.3038888(17-24)Online publication date: 22-Nov-2016
https://dl.acm.org/doi/10.1145/3038884.3038888

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents