881
Views
62
CrossRef citations to date
0
Altmetric
Article

Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic

, , &
Pages 1161-1176 | Received 14 Dec 2015, Accepted 16 Nov 2016, Published online: 21 Dec 2017

References

  • AhnSCooperCCornuejolsGFriezeAProbabilistic analysis of a relaxation for the k-median problemMathematics of Operations Research198813113110.1287/moor.13.1.1
  • AlvesMAlmeidaMSimulated annealing algorithm for the simple plant location problemRevista Investigação Operacional1992122145157
  • ArabaniABFarahaniRZFacility location dynamics: An overview of classifications and applicationsComputers & Industrial Engineering201262140842010.1016/j.cie.2011.09.018
  • BalachandranVJainSOptimal facility location under random demand with general cost structureNaval Research Logistics Quarterly197623342143610.1002/nav.3800230305
  • Balinski M (1966). On finding integer solutions to linear programs. In: Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems, pp. 225–248.
  • Barahona F and Chudak F (1999). Near-optimal solutions to large scale facility location problem. Technical Report RC21606. IBM, Yorktown Heights, NY, USA.
  • BarteltJRostPWubbenDLessmannJMelisBFettweisGFronthaul and backhaul requirements of flexibly centralized radio access networksIEEE Wireless Communications201522510511110.1109/MWC.2015.7306544
  • BendersJPartitioning procedures for solving mixed-variables programming problemsNumerische Mathematik19624123825210.1007/BF01386316
  • BrahimiNKhanSAWarehouse location with production, inventory, and distribution decisions: A case study in the lube oil industry4OR201412217519710.1007/s10288-013-0237-0
  • Chudak FA (1998). Improved approximation algorithms for uncapacitated facility location. In: Bixby R, Boyd E, Ríos-Mercado R (Eds.) Integer Programming and Combinatorial Optimization. Springer, Berlin, Heidelberg. volume 1412 of Lecture Notes in Computer Science, pp. 180–194.
  • ContrerasICordeauJFLaporteGStochastic uncapacitated hub locationEuropean Journal of Operational Research2011212351852810.1016/j.ejor.2011.02.018
  • CornuejolsGFisherMLNemhauserGLExceptional paper–location of bank accounts to optimize float: An analytic study of exact and approximate algorithmsManagement Science197723878981010.1287/mnsc.23.8.789
  • CornuejolsGNemhauserGWolseyLMirchandaniPBFrancisRLThe uncapacitated facility location problemDiscrete Location Theory1990New YorkWiley119171
  • CorreiaIGamaFSFacility Location Under Uncertainty2015ChamSpringer International Publishing177203
  • DominguezOJuanAABarriosBFaulinJAgustinAUsing biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleetAnnals of Operations Research2016236238340410.1007/s10479-014-1551-4
  • DreznerZHeuristic solution methods for two location problems with unreliable facilitiesJournal of the Operational Research Society198738650951410.1057/jors.1987.88
  • DreznerZFacility location: a survey of applications and methods. Springer series in Operations Research and Financial Engineering1995New YorkSpringer
  • EfroymsonMARayTLA branch-bound algorithm for plant locationOperations Research19661436136810.1287/opre.14.3.361
  • EiseltHALaporteGThisseJFCompetitive location models: A framework and bibliographyTransportation Science1993271445410.1287/trsc.27.1.44
  • ErlenkotterDA dual-based procedure for uncapacitated facility locationOperations Research1978266992100910.1287/opre.26.6.992
  • FotakisDOnline and incremental algorithms for facility locationSIGACT News20114219713110.1145/1959045.1959065
  • Frank C and Römer K (2007). Distributed Facility Location Algorithms for Flexible Configuration of Wireless Sensor Networks. In: Proceedings of Third IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2007, Santa Fe, NM, USA, June 18–20, 2007. Springer, Berlin, Heidelberg, pp. 124–141.
  • GendreauMLaporteGSemetFA dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Applications of parallel computing in transportationParallel Computing200127121641165310.1016/S0167-8191(01)00103-X
  • GhoshDNeighborhood search heuristics for the uncapacitated facility location problemEuropean Journal of Operational Research2003150115016210.1016/S0377-2217(02)00504-0
  • GloverFBarrRSHelgasonRVKenningtonJLTabu search and adaptive memory programming—advances, applications and challengesInterfaces in Computer Science and Operations Research1997BostonSpringer175
  • GrasasAJuanAARamalhinhoHSimils: A simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimizationJournal of Simulation2016101697710.1057/jos.2014.25
  • HansenPThe simple plant location problemOmega19764334734910.1016/0305-0483(76)90027-X
  • HochbaumDSApproximation algorithms for the set covering and vertex cover problemsSIAM Journal on Computing198211355555610.1137/0211045
  • HodderJEJuckerJVA simple plant-location model for quantity-setting firms subject to price uncertaintyEuropean Journal of Operational Research1985211394610.1016/0377-2217(85)90085-2
  • Hoefer M (2014). Max planck institut informatik benchmarks. http://resources.mpi-inf.mpg.de/departments/d1/projects/benchmarks/UflLib/.
  • JainKMahdianMMarkakisESaberiAVaziraniVVGreedy facility location algorithms analyzed using dual fitting with factor-revealing lpJournal of the ACM (JACM)200350679582410.1145/950620.950621
  • Jain K and Vazirani VV (1999). Primal-dual approximation algorithms for metric facility location and k-median problems. In: 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 2–13.
  • JuanAAFaulinJGrasmanSERabeMFigueiraGA review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problemsOperations Research Perspectives201521627210.1016/j.orp.2015.03.001
  • JuanAAFaulinJGrasmanSERieraDMarullJMendezCUsing safety stocks and simulation to solve the vehicle routing problem with stochastic demandsTransportation Research Part C: Emerging Technologies201119575176510.1016/j.trc.2010.09.007
  • JuanAAFaulinJJorbaJRieraDMasipDBarriosBOn the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristicsOperational Research Society20116261085109710.1057/jors.2010.29
  • JuanAALourençoHRMateoMLuoRCastellaQUsing iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issuesInternational Transactions in Operational Research201421110312610.1111/itor.12028
  • JuckerJVCarlsonRCThe simple plant-location problem under uncertaintyOperations Research19762461045105510.1287/opre.24.6.1045
  • KolesarPWalkerWEAn algorithm for the dynamic relocation of fire companiesOperations Research197422224927410.1287/opre.22.2.249
  • KörkelMOn the exact solution of large-scale simple plant location problemsEuropean Journal of Operational Research198939215717310.1016/0377-2217(89)90189-6
  • KouvelisPKurawarwalaAAGutiérrezGJAlgorithms for robust single and multiple period layout planning for manufacturing systemsEuropean Journal of Operational Research199263228730310.1016/0377-2217(92)90032-5
  • KraticaJTošicDFilipovićVLjubićISolving the simple plant location problem by genetic algorithmRAIRO-Operations Research200135112714210.1051/ro:2001107
  • KuehnAAHamburgerMJA heuristic program for locating warehousesManagement Science19639464366610.1287/mnsc.9.4.643
  • LaiMCSohnHsTsengTLBChiangCA hybrid algorithm for capacitated plant location problemExpert Systems with Applications201037128599860510.1016/j.eswa.2010.06.104
  • Lazic N, Givoni IE, Frey BJ and Aarabi P (2009). Floss: Facility location for subspace segmentation. In: IEEE 12th International Conference on Computer Vision, ICCV 2009, Kyoto, Japan, September 27–October 4, 2009, pp. 825–832.
  • LeeGMurrayATMaximal covering with network survivability requirements in wireless mesh networksEnvironment and Urban Systems2010341495710.1016/j.compenvurbsys.2009.05.004
  • LiSA 1.488 approximation algorithm for the uncapacitated facility location problemInformation and Computation2013222455810.1016/j.ic.2012.01.007
  • LuMRanLShenZJReliable facility location design under uncertain correlated disruptionsManufacturing and Service Operations Management201517444545510.1287/msom.2015.0541
  • MalletteAJFrancisRLA generalized assignment approach to optimal facility layoutAIIE Transactions19724214414710.1080/05695557208974841
  • MaricMStanimirovicZBozovicSHybrid metaheuristic method for determining locations for long-term health care facilitiesAnnals OR2015227132310.1007/s10479-013-1313-8
  • Meyerson A (2001). Online facility location. In: Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, 2001, pp. 426–431.
  • MichelLHentenryckPA simple tabu search for warehouse locationEuropean Journal of Operational Research2004157357659110.1016/S0377-2217(03)00247-9
  • RaviRSinhaAHedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems2004Berlin Heidelberg, Berlin, HeidelbergSpringer101115
  • ResendeMGWerneckRFA hybrid multistart heuristic for the uncapacitated facility location problemEuropean Journal of Operational Research20061741546810.1016/j.ejor.2005.02.046
  • SchrageLBalinskiMLHellermanEImplicit representation of variable upper bounds in linear programmingComputational Practice in Mathematical Programming1975Berlin, HeidelbergSpringer118132
  • Shmoys DB, Tardos É and Aardal K (1997). Approximation algorithms for facility location problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, ACM, pp. 265–274.
  • SnyderLDaskinMStochastic p-robust location problemsIIE Transactions (Institute of Industrial Engineers)20063811971985
  • SnyderLVFacility location under uncertainty: A reviewIIE Transactions200638754756410.1080/07408170500216480
  • Snyder LV, Daskin MS and Teo CP (2007). The stochastic location model with risk pooling. European Journal of Operational Research179(3):1221–1238.
  • SpielbergKAlgorithms for the simple plant-location problem with some side conditionsOperations Research19691718511110.1287/opre.17.1.85
  • Stollsteimer JF (1961). The effect of technical change and output expansion on the optimum number, size and location of pear marketing facilities in a California pear producing region. Ph.D. thesis. University of California at Berkeley.
  • ThouinFCoatesMEquipment allocation in video on demand network deploymentsACM Transaction on Multimedia Computing, Communications and Applications20085112410.1145/1404880.1404885
  • UnoTKatagiriHKatoKA facility location for fuzzy random demands in a competitive environmentInternational Journal of Applied Mathematics2010403172177
  • VermaAVermaRMahantiNA new approach to fuzzy uncapacitated facility location problemInternational Journal of Soft Computing20105314915410.3923/ijscomp.2010.149.154
  • VerterVEiseltHAMarianovVUncapacitated and capacitated facility location problemsFoundations of Location Analysis2011BostonSpringer
  • WagnerMRBhaduryJPengSRisk management in uncapacitated facility location models with random demandsComputers & Operations Research20093641002101110.1016/j.cor.2007.12.008
  • Wang D, Wu CH, Ip A, Wang D and Yan Y (2008). Parallel multi-population particle swarm optimization algorithm for the uncapacitated facility location problem using OpenMP. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pp. 1214–1218.
  • WangNHossainEBhargavaVKBackhauling 5g small cells: A radio resource management perspectiveIEEE Wireless Communications2015225414910.1109/MWC.2015.7306536

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.