An efficient heuristic procedure for the capacitated warehouse location problem

DOI10.1002/NAV.3800210405MaRDI QIDQ4048852zbMATH OpenOpenAlexFDO

Authors Basheer M. Khumawala

Publication date 1975

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800210405

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Integer programming (90C10)

Cited in

(23)

• Heuristics for the capacitated plant location model
• ADD-heuristics' starting procedures for capacitated plant location models
• The capacitated distribution and waste disposal problem
• The capacitated plant location problem
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
• Heuristic methods and applications: A categorized survey
• The capacitated plant location problem with multiple facilities in the same site
• A heuristic preprocessor supported algorithm for the capacitated plant location problem
• A cross decomposition algorithm for a multiproduct-multitype facility location problem
• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
• Application of facilities location to an insurance company’s office reconfiguration
• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
• An improved particle swarm optimization for the automobile spare part warehouse location problem
• On the Modeling Tactics of Research Extensions in Production/Operations Management
• An algorithm for the capacitated, multi-commodity multi-period facility location problem.
• A comparison of heuristics and relaxations for the capacitated plant location problem
• An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
• Modelling a fertiliser distribution system
• Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
• A branch-and-price algorithm for the capacitated facility location problem
• A perturbation-based heuristic for the capacitated multisource Weber problem
• Approximate solutions to large scale capacitated facility location problems
• A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application

This page was built for publication: An efficient heuristic procedure 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 Q4048852)