ADD-heuristics' starting procedures for capacitated plant location models

DOI10.1016/0377-2217(85)90086-4zbMath0582.90028OpenAlexW2005527415MaRDI QIDQ1068688

Andreas Drexl, Wolfgang Domschke

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90086-4

zbMATH Keywords

priority rulegreedy heuristicscapacitated plant locationmodifications of heuristicspriority starting procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items

A cross decomposition algorithm for a multiproduct-multitype facility location problem, An algorithm for solving large capacitated warehouse location problems, 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, Location and layout planning. A survey, Two new heuristic algorithms for the maximal planar layout problem, The capacitated plant location problem, Layout of production lines considering the material movement system, Approximate solutions to large scale capacitated facility location problems, Observations on some heuristic methods for the capacitated facility location problem, A hybrid firefly-genetic algorithm for the capacitated facility location problem, Asymptotic behavior of the Weber location problem on the plane, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, Lagrangean heuristics for location problems, The capacitated distribution and waste disposal problem, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, A Lagrangean heuristic for the facility location problem with staircase costs, Heuristic methods and applications: A categorized survey, Notation and classification for logistic network design models, 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

Cites Work

• Heuristics for the capacitated plant location model
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Locational analysis
• On the use of tree indexing methods in transportation algorithms
• Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• An efficient heuristic procedure for the capacitated warehouse location problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem