Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location

DOI10.2307/2582078MaRDI QIDQ3221722zbMATH OpenOpenAlexFDO

Authors R. A. Whitaker

Publication date 1985

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2582078

zbMATH Keywords

heuristic algorithmsminimum total distribution costsnetwork of demandswarehouse location

Mathematics Subject Classification ID

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

Recommendations

• A warehouse-location problem
• An algorithm for solving large capacitated warehouse location problems
• Add/drop procedures for the capacitated plant location problem
• Discrete facility location with nonlinear facility costs
• Dominance Criteria for the Capacitated Warehouse Location Problem

Cited in

(7)

• An algorithm for solving large capacitated warehouse location problems
• Designing distribution systems with transport economies of scale
• Heuristic methods and applications: A categorized survey
• An integrated plant loading model with economies of scale and scope
• Dominance Criteria for the Capacitated Warehouse Location Problem
• Subdrop: A modified drop heuristic for location problems
• Supply chain design considering economies of scale and transport frequencies

This page was built for publication: Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221722)