Bounds for the single source modular capacitated plant location problem

Authors:
Isabel Correia;Maria Eugénia Captivo
Affiliations:
Departamento de Matemática - C.M.A., Faculdade de Cências e Tecnologia, Universidade Nova de Lisboa, Quinta da Torre, Monte da Caparica, Portugal;Universidade de Lisboa, Faculdade de Ciências, Centro de Investigção Operacional Bloco, Piso, Campo Grande, Lisboa, Portugal
Venue:
Computers and Operations Research
Year:
2006

Citing 2
Cited 4

Avoiding local optima in the p-hub location problem using tabu search and grasp

Annals of Operations Research - Special issue on locational decisions
Tabu Search

Tabu Search

Stochastic facility location with general long-run costs and convex short-run costs

Computers and Operations Research
Integrated use of fuzzy c-means and convex programming for capacitated multi-facility location problem

Expert Systems with Applications: An International Journal
Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

INFORMS Journal on Computing
Solution method for the location planning problem of logistics park with variable capacity

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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.