efficient heuristic procedure for the capacitated warehouse location problem

  • 24 Pages
  • 0.20 MB
  • 5879 Downloads
  • English
by
Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Industrial Administration, Purdue University , West Lafayette, Ind
Warehouses -- Location -- Mathematical models., Heuristic program
Statementby Basheer M. Khumawala.
SeriesPaper - Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Industrial Administration, Purdue University ; no. 461, Paper (Krannert Graduate School of Industrial Administration. Institute for Research in the Behavioral, Economic, and Management Sciences)
Classifications
LC ClassificationsHD6483 .P8 no. 461, HF5485 .P8 no. 461
The Physical Object
Pagination24, 2 p. ;
ID Numbers
Open LibraryOL4857309M
LC Control Number75622452

Details efficient heuristic procedure for the capacitated warehouse location problem EPUB

This paper introduces an efficient heuristic procedure for solving a special class of mixed integer programming problem called the capacitated warehouse (plant) location problem.

This procedure parallels the work reported earlier in [9] on the uncapacitated warehouse location problem. The procedure can be viewed as tracing a judiciously selected path of the branch and bound tree (from the initial Cited by: An efficient heuristic procedure for the capacitated warehouse location problem Basheer M.

Khumawala Graduate School of Business Administration University of North Carolina at Chapel HillCited by: This paper introduces an efficient heuristic procedure for a special class of mixed integer programming problems called the uncapacitated warehouse (plant) location problem.

This procedure is derived from the branching decision rules proposed for the branch and bound algorithm by Cited by: Keywords: Facilities, location, heuristics 1. ]introduction In a paper published in EJOR, Jacobsen () generalized some well-known heuristics for the p-median model and for the uncapacitated plant location model in such a way as to apply them also for the capacitated by:   In this paper, a mathematical model and a solution algorithm are developed for solving an extended capacitated concentrator location problem.

Our model extends the conventional formulation by simultaneously addressing the two capacity constraints, total connection ports and maximum data processing rate, on each concentrator to be selected for satisfying the communication demands of the Cited by: 4.

The capacitated \(p\)-median problem (CPMP) is one of the well-known facility-location objective of the problem is to minimize total cost of locating a set of capacitated service points and allocating a set of demand points to the located service points, while the total allocated demand for each service point is not be greater than its capacity by: 7.

transportation-location-allocation-location heuristic is put fo rward to solve the capacitated problem. This is a This is a modification scheme from Cooper’s ATL algorithm with th e addition of.

Abstract. The Two Stage Capacitated Facility Location Problem is the problem of finding the locations of depots from a set of potential depot sites to satisfy given customer demands, the assignment of customers to the selected depots and the product flow from the plants to the depots such that the total system cost is minimized.

The total demand of all customers assigned to any depot can not Cited by: 3. A heuristic Lagrangean algorithm for the capacitated plant location problem -- A comment. This is a comment on the paper “A heuristic Lagrangean relaxation algorithm for the capacitated plant location problem” by J.

Barcelo and J. Casanovas. European Journal of Operational Research 33 () North-Holland An algorithm for solving large capacitated warehouse location problems J.E. BEASLEY Department of Management Science, Imperial College, London SW7 2BX, England Abstract: In this paper we present a lower bound for the capacitated warehouse location problem based upon lagrangean relaxation of a mixed-integer Cited by: The purpose of this paper is to refine and test a distribution system design model and evaluate its performance with respect to solution quality, model validation, and algorithm performance.

The paper reports on the development of a multiproduct warehouse logistics by: The capacitated plant location problem with linear transportation costs is considered.

Exact rules and heuristics are presented for opening or closing of facilities. A heuristic algorithm based on ADD/DROP strategies is proposed. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Khumawala, B. (): An efficient heuristic procedure for the capacitated warehouse location problem.

Naval Research Logistics Quarterly, – CrossRef Google ScholarCited by: 1. An efficient heuristic procedure for the capacitated warehouse location problem Naval Research Logistics Quarterly, Vol. 21, No. 4 The maximal covering location problemCited by: Capacitated facility location problem with general setup cost are provided and the heuristic algorithm is shown to be efficient.

for solving lar ge capacitated warehouse location problems. This paper explores the np-hard capacitated continuous location-allocation problem, where the number of facilities to be located is specified and each of which has a constant capacity. Efficient greedy randomised adaptive search procedure (GRASP) based heuristics are proposed to tackle the problem.

A scheme that applies the furthest distance rule (FDR) and self-adjusted threshold parameters to Cited by: 1. A systematic comparison of heuristics and relaxations for the capacitated plant location problem is provided by Cornuejols et al. Based on both a theoretical analysis and extensive computational results, they suggest the use of a Lagrangean heuristic to solve large instances of the by: Downloadable.

This paper describes an efficient solution procedure for the warehouse location problem in which limitations on the amount of goods which can be handled are also imposed. The proposed branch-and-bound solution method is made efficient by developing dominance, lower and upper bounding procedures and branch and node selection rules utilizing the special structure of this problem.

Download efficient heuristic procedure for the capacitated warehouse location problem EPUB

The PLANWAR model is a new formulation to the multi-commodity, multi-plant, capacitated facility location problem that seeks to locate a number of production plants and distribution centers so that total operating costs for the distribution network are by: This paper describes an efficient solution procedure for the warehouse location problem in which limitations on the amount of goods which can be handled are also imposed.

The proposed branch-and-bound solution method is made efficient by developing dominance, lower and upper bounding procedures and branch and node selection rules utilizing the Cited by:   Part of the Lecture Notes in Networks and Systems book series (LNNS, volume Developing new formulations and relaxations of single stage capacitated warehouse location problem: empirical investigation for assessing relative strengths and computational effort.

Khumawala, B.M.: An efficient heuristic procedure for the uncapacitated Author: Ilona Jacyna-Gołda, Mariusz Izdebski. In the next section, a formulation for the PLANWAR (PLANt and WARehouse) location problem is presented.

We then provide a Lagrangian relaxation of the model and also the necessary steps required to find a lower bound at every iteration of the problem. A heuristic solution procedure for solving the problem is by: 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. An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem 11 November | International Journal of Advances in Intelligent Informatics, Vol.

Description efficient heuristic procedure for the capacitated warehouse location problem EPUB

4, No. 3 A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demandsCited by: Abstract. A tabu search heuristic procedure for the capacitated facility location problem is developed, implemented and computationally tested.

The heuristic procedure uses both short term and long term memories to perform the main search process as well as the diversification and intensification : Minghe Sun. A three level joint location-inventory problem with correlated demand, shortages and periodic review system: Robust meta-heuristics Computers & Industrial Engineering, Vol.

Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: A multi-echelon formulationCited by: B. KHUMAWALA, "An Efficient Heuristic Procedure for the Uncapacitated Warehouse Location Problem," Naval Res.

Logist. Quart. 20, (). Google Scholar Cross Ref; T. KOOPMANS AND M. BECKMANN, "Assignment Problems and the Location of Economic Activities," Econometr ().

Google Scholar Cross Ref. In this paper, we consider an integrated supply chain network design problem, which incorporates inventory and pricing decisions into the capacitated facility location model. We assume that each warehouse has a capacity limitation that limits the average demand flowing through the warehouse and that the supplier can choose whether to satisfy each potential retailer&#x;s by: 1.

Heuristic solution approach for the capacitated lot-sizing and scheduling problem with sequence-dependent setup times and retunrs Auteur: Hoang Ngoc Tuan, one of the efficient heuristics to deal with MIP often solved by the standard Branch and Bound procedure.

The Capacitated Lot-sizing and Scheduling Problem with Sequence Author: Hoang Ngoc Tuan. 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 : Minghe Sun. Efficient primal-dual heuristic for a dynamic location problem Computers & Operations Research, Vol.

34, No. 6 A genetic algorithm-based heuristic for the Cited by: Heuristic approach for solving capacitated location-routing problems To cite this article: H N Ahmad et al IOP Conf. Ser.: Mater. Sci. Eng. View the article online for updates and enhancements.

This content was downloaded from IP address on 18/10/ at Author: H N Ahmad, T Bakhtiar, P T Supriyo.Capacitated Dynamic Location Problems with Opening, consider the multi-commodity version of the capacitated plant and warehouse location problem (customers are served from open warehouses which, in turn, receive products from manufacturing plants), and develop an efficient heuristic based on lagrangean relaxation.

Hinojosa et al.