The capacity and distance constrained plant location problem

Authors:
Maria Albareda-Sambola;Elena Fernández;Gilbert Laporte
Affiliations:
Departament Estadística i Investigació Operativa, Universitat Politècnica de Catalunya, Spain;Departament Estadística i Investigació Operativa, Universitat Politècnica de Catalunya, Spain;Canada Research Chair in Distribution Management, HEC Montréal, Canada
Venue:
Computers and Operations Research
Year:
2009

Citing 3
Cited 6

A tabu search heuristic for the vehicle routing problem

Management Science
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Computers and Operations Research
A compact model and tight bounds for a combined location-routing problem

Computers and Operations Research

Solving a location-allocation problem with logic-based Benders' decomposition

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

Computers and Operations Research
Location and allocation decisions in a two-echelon supply chain with stochastic demand - A genetic-algorithm based solution

Expert Systems with Applications: An International Journal
The vendor location problem

Computers and Operations Research
Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

INFORMS Journal on Computing
Solution method for the location planning problem of logistics park with variable capacity

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This article introduces a new problem called the Capacity and Distance Constrained Plant Location Problem. It is an extension of the discrete capacitated plant location problem, where the customers assigned to each plant have to be packed in groups that will be served by one vehicle each. The constraints include two types of capacity. On the one hand plants are capacitated, and the demands of the customers are indivisible. On the other hand, the total distance traveled by each vehicle to serve its assigned customers in round trips plant-customer-plant is also limited. The paper addresses different modeling aspects of the problem. It describes a tabu search algorithm for its solution. Extensive computational tests indicate that the proposed heuristic consistently yields optimal or near-optimal solutions.