A partial dual algorithm for the capacitated warehouse location problem
The Capacitated Warehouse Location Problem (CWLP) consists of the ordinary transportation problem with the additional feature of a fixed cost associated with each supplier. A supplier can be used towards meeting the demands of the customers only if the corresponding fixed cost is incurred. The problem is to determine which suppliers to use and how the customer demands should be met, so that total cost is minimised. Most of the recently published algorithms, for CWLP use branch and bound based on a Lagrangian relaxation of demand constraints. Here, a partial dual of a tight LP formulation is used in order to take advantage of the properties of transportation problems. Computational results are given which show good overall performance of the algorithm, with the size of the tree search being reduced compared with previous published results.
- An algorithm for solving large capacitated warehouse location problems
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- A branch and bound algorithm for the partial coverage capacitated plant location problem
- Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
- A large-scale application of the partial coverage uncapacitated facility location problem
- A branch‐bound algorithm for the capacitated facilities location problem
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Validation of subgradient optimization
- A branch and bound algorithm for the partial coverage capacitated plant location problem
- An algorithm for solving large capacitated warehouse location problems
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Lagrangean heuristics for location problems
- Evaluating strong, weak and hybrid formulations of the single stage capacitated warehouse location problem
- Dominance Criteria for the Capacitated Warehouse Location Problem
- Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
- An improved particle swarm optimization for the automobile spare part warehouse location problem
- Optimizing the location-allocation problem of pharmacy warehouses: A case study in Gaziantep
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
- Approximate solutions to large scale capacitated facility location problems
This page was built for publication: A partial dual algorithm for the capacitated warehouse location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067966)
