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

被引：13

作者：

Albareda-Sambola, Maria ^{[1
]}

Fernandez, Elena ^{[1
]}

Laporte, Gilbert ^{[2
]}

机构：

[1] Univ Politecn Cataluna, Dept Estadist & Invest Operat, E-08028 Barcelona, Spain

[2] HEC Montreal, Canada Res Chair Distribut Management, Montreal, PQ, Canada

来源：

COMPUTERS & OPERATIONS RESEARCH | 2011年 / 38卷 / 08期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Discrete location; LOWER BOUNDS; ALGORITHM;

D O I：

10.1016/j.cor.2010.10.030

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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. (C) 2010 Elsevier Ltd. All rights reserved.

引用

页码：1109 / 1116

页数：8

共 15 条

[1] The capacity and distance constrained plant location problem [J].

Albareda-Sambola, Maria ;

Fernandez, Elena ;

Laporte, Gilbert .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (02) :597-611

[2]

[Anonymous], 1988, Vehicle routing: Methods and studies

[3]

[Anonymous], 1990, Knapsack Problems: Algorithms and ComputerImplementations

[4] COMPUTATIONAL RESULTS FROM A NEW LAGRANGEAN RELAXATION ALGORITHM FOR THE CAPACITATED PLANT LOCATION PROBLEM [J].

BARCELO, J ;

FERNANDEZ, E ;

JORNSTEN, KO .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 53 (01) :38-45

[5] On the asymmetric representatives formulation for the vertex coloring problem [J].

Campelo, Manoel ;

Campos, Victor A. ;

Correa, Ricardo C. .

DISCRETE APPLIED MATHEMATICS, 2008, 156 (07) :1097-1111

[6] A Class Representative Model for Pure Parsimony Haplotyping [J].

Catanzaro, Daniele ;

Godi, Alessandra ;

Labbe, Martine .

INFORMS JOURNAL ON COMPUTING, 2010, 22 (02) :195-209

[7] SOLVING LARGE-SCALE ZERO-ONE LINEAR-PROGRAMMING PROBLEMS [J].

CROWDER, H ;

JOHNSON, EL ;

PADBERG, M .

OPERATIONS RESEARCH, 1983, 31 (05) :803-834

[8]

*DASH ASS, 2007, DASH OPT XPRESS MP O

[9] A branch-and-price algorithm for the single source capacitated plant location problem [J].

Diaz, JA ;

Fernández, E .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (07) :728-740

[10]

Fazel-Zarandi MM, 2009, LECT NOTES COMPUT SC, V5732, P344, DOI 10.1007/978-3-642-04244-7_28

← 1 2 →