The capacitated plant location problem with multiple facilities in the same site

DOI10.1016/S0305-0548(01)00065-XzbMath1259.90059WikidataQ58921759 ScholiaQ58921759MaRDI QIDQ1941959

Roberto Musmanno, Gianpaolo Ghiani, Francesca Guerriero

Publication date: 25 March 2013

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangean relaxationheuristicp-median problemplant location problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Discrete location and assignment (90B80)

Related Items

Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system ⋮ A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers ⋮ Dynamic pooled capacity deployment for urban parcel logistics ⋮ The multimode covering location problem ⋮ Locating Satellite Yards in Forestry Operations ⋮ Managing mobile production-inventory systems influenced by a modulation process ⋮ Design and operation for an electric taxi fleet ⋮ A Lagrangean heuristic for the plant location problem with multiple facilities in the same site ⋮ Capacitated facility location problem with general setup cost ⋮ A facility location and installation of resources model for level of repair analysis ⋮ Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach

Uses Software

• LINDO
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• A comparison of heuristics and relaxations for the capacitated plant location problem
• Heuristics for the capacitated plant location model
• An algorithm for solving large capacitated warehouse location problems
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Valid inequalities and facets of the capacitated plant location problem
• Lagrangean heuristics for location problems
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• An efficient heuristic procedure for the capacitated warehouse location problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search