Upper and lower bounds for the single source capacitated location problem

Cortinhal, Maria João; Captivo, M. Eugénia

doi:10.1016/s0377-2217(02)00829-9

Cited by 77 publications

(32 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A Lagrangean relaxation-based heuristic solution procedure is proposed, which exhibits a good performance over a wide range of problems. Cortinhal and Captivo (2003) use a similar Lagrangean approach, along with a tabu search metaheuristic, to obtain upper and lower bounds for the single source capacitated location problem. Although not necessarily related to the location aspect, Basnet and Wilson (2005) propose a number of heuristics to minimize the number of warehouses with limited storage capacity required to store a given set of products.…”

Section: A Brief Review Of the Relevant Literaturementioning

confidence: 99%

“…The problem is now defined as opening warehouses on a subset W W, assigning each customer to a single opened warehouse and determining the amount of each commodity to be stored at each opened warehouse, such that the total cost of distributing the commodities to customers is minimized. Although assigning customers to multiple warehouses is also possible, we use the single assignment assumption, known in the literature as single sourcing (Cortinhal and Captivo, 2003;Hindi and Pien´kosz, 2003). However, the proposed models can easily be adapted to the multiple assignment case.…”

Section: A Formal Description Of the Problemmentioning

confidence: 99%

“…Further, the available potential locations may not necessarily have the sufficient total capacity to meet all the demand coming from customers. Thus, the assumption made by the previous studies, such as those by Barcelo et al (1993), Beasley (1988Beasley ( , 1993, Cortinhal and Captivo (2003), Hindi and Pien´kosz (2003), Klose and Go¨rtz (2007), and Sridharan (1995), is very restrictive in such practical situations.…”

Section: Introductionmentioning

confidence: 97%

“…In fact, constraints based on this assumption are widely used to strengthen lower bounds in most of the proposed approaches (e.g., Klose, 1998;Cortinhal and Captivo, 2003;Klose and Go¨rtz, 2007). While this assumption facilitates defining and modeling a wellstructured problem, it is rarely held in practice.…”

Section: Introductionmentioning

confidence: 99%

“…When the number of commodities is rather large (this is the case when the commodities are small and produced in huge quantities, such as toys or car parts), metaheuristic techniques may be of more use to produce good quality solutions in small computational times (e.g., Keskin and Ü ster, 2007). In particular, we suggest the use of simulated annealing (e.g., Jayaraman and Ross, 2003) and tabu search (e.g., Cortinhal and Captivo, 2003) which are known to produce good results when applied in similar distribution problem settings.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses

Bektaş

Bulgak

2008

Int Trans Operational Res

View full text Add to dashboard Cite

The traditional capacitated warehouse location problem consists of determining the number and the location of capacitated warehouses on a predefined set of potential sites such that the demands of a set of customers are met. A very common assumption made in modeling this problem in almost all of the existing research is that the total capacity of all potential warehouses is sufficient to meet the total demand. Whereas this assumption facilitates to define a well-structured problem from the mathematical modeling perspective, it is in fact restrictive, not realistic, and hence rarely held in practice. The modeling approach presented in this paper breaks away from the existing research in relaxing this very restrictive assumption. This paper therefore investigates the generalized problem of locating warehouses in a supply chain setting with multiple commodities with no restriction on the total capacity and the demand. A new integer programming formulation for this problem is presented, and an algorithm based on Lagrangean relaxation and decomposition is described for its solution. Three Lagrangean heuristics are proposed. Computational results indicate that reasonably good solutions can be obtained with the proposed algorithms, without having to use a general purpose optimizer.

show abstract

Section: A Brief Review Of the Relevant Literaturementioning

confidence: 99%

Section: A Formal Description Of the Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses

Bektaş

Bulgak

2008

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

Hub Location Problems: The Location of Interacting Facilities

Kara

Taner

2011

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. PrefaceThis book is the final result of a number of incidents that occurred to us while discussing location issues with colleagues at conferences. Frequently we attended presentations, in which the authors quoted the well-known references that helped to make the discipline what it is today. Upon further inquiry, though, it turned out that some of these colleagues had never actually read the original papers. We then discussed among ourselves which contributions could be credited with shaping the field. And, lo and behold, we found that we, too, had neglected to read some of the papers that form the foundation of our science. Whether it was laziness or other things that got in the way, it had become clear that something had to be done. Our first thought was to collect the original contributions (once we could agree on what they were) and reprint them. When discussing this possibility with a publisher, we immediately ran into a roadblock in the form of copyright. While this appeared to have stopped our enthusiastic effort dead in its tracks, we kept on collecting and reading what we considered original contributions.This went on until we met Camille Price, who suggested that, rather than reprinting the original contributions, we should invite some of the leaders in our field and ask them to describe the original contribution, explain and interpret it, and comment on the impact that it had to the field. This was, of course, an excellent idea, and the response by our colleagues to our pertinent requests was equally enthusiastic. What you hold in your hands is the result of this effort.In other words, the purpose of this book is to provide easy access to the main contributions to location theory. The book is organized as follows. The introductory chapter provides an overview of some of the many facets of location analysis. This is followed by contributions in the main three fields of inquiry: minisum, minimax, and covering problems. The next chapters are part of an ever-growing list of nonstandard location models: models including competitive components, those that locate undesirable facilities, those with probabilistic features, and those that allow interactions between facilities. The following chapters discuss solution techniques: after a discussion of exact and heuristic techniques, we devote an entire chapter to Weiszfeld's method, and another to Lagrangean techniques. The last chapters of this book deal with the spheres of influence that the facilities generate and that attract viii customers to them, an...

show abstract

Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems

Galvão

Marianov

2011

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

Upper and lower bounds for the single source capacitated location problem

Cited by 77 publications

References 21 publications

Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses

Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses

Hub Location Problems: The Location of Interacting Facilities

Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems

Contact Info

Product

Resources

About