The capacity and distance constrained plant location problem

DOI10.1016/J.COR.2007.10.017MaRDI QIDQ954059zbMATH OpenOpenAlexFDO

Authors Maria Albareda-Sambola, Elena Fernández, G. Laporte

Publication date 7 November 2008

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

Full work available at URL https://doi.org/10.1016/j.cor.2007.10.017

zbMATH Keywords

bin packingtabu searchlocation-allocation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
• The capacitated plant location problem
• Efficient solution of large scale, single-source, capacitated plant location problems
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• Optimal Routing under Capacity and Distance Restrictions

Cites work

• scientific article; zbMATH DE number 4051316 (Why is no real title available?)
• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A compact model and tight bounds for a combined location-routing problem
• A tabu search heuristic for the generalized assignment problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Bison
• Combined location-routing problems: A synthesis and future research directions
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Location-routing: issues, models and methods
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(18)

• Plant location factors: a field research
• Nutmeg: a MIP and CP hybrid solver using branch-and-check
• Bounds for the single source modular capacitated plant location problem
• scientific article; zbMATH DE number 4095174 (Why is no real title available?)
• The plant location problem with discrete capacities and indivisible customers
• The vendor location problem
• The close-open mixed vehicle routing problem
• Plant Capacity and Attainability: Exploration and Remedies
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
• Multiobjective capacitated plant location problem
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• The return plant location problem: Modelling and resolution
• A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
• Solution method for the location planning problem of logistics park with variable capacity
• A distribution network design problem in the automotive industry: MIP formulation and heuristics
• The capacitated plant location problem
• Multiperiod location-routing with decoupled time scales
• Closest assignment constraints in discrete location problems

Describes a project that uses

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF
• Bison

This page was built for publication: The capacity and distance constrained plant location problem

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