The capacity and distance constrained plant location problem

DOI10.1016/J.COR.2007.10.017zbMATH Open1163.90583OpenAlexW2130798138MaRDI QIDQ954059FDOQ954059

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

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

zbMATH Keywords

bin packingtabu searchlocation-allocation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

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

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)