A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

Authors:
Maria Albareda-Sambola;Elena Fernández;Gilbert Laporte
Affiliations:
Departament d'Estadística i Investigació Operativa, Universitat Politècnica de Catalunya, Spain;Departament d'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:
2011

Citing 6
Cited 1

Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
On the asymmetric representatives formulation for the vertex coloring problem

Discrete Applied Mathematics
The capacity and distance constrained plant location 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 Class Representative Model for Pure Parsimony Haplotyping

INFORMS Journal on Computing

The exact solution of several classes of inventory-routing problems

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Capacity and Distance Constrained Plant Location Problem is an extension of the discrete capacitated plant location problem, where the customers assigned to each plant have to be assigned to vehicles. In addition to the capacity constraints on the plants, there is a limit on the total distance traveled by each vehicle to serve its assigned customers by means of round trips. This paper presents several formulations for the problem and proposes different families of valid inequalities. The results of extensive computational experiments are presented and analyzed.