A COMPARISON OF HEURISTICS AND RELAXATIONS FOR THE CAPACITATED PLANT LOCATION PROBLEM

被引：170

作者：

CORNUEJOLS, G

SRIDHARAN, R

THIZY, JM

机构：

[1] INDIAN INST MANAGEMENT,AHMEDABAD 380015,GUJARAT,INDIA

[2] UNIV OTTAWA,OTTAWA K1N 6N5,ONTARIO,CANADA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1991年 / 50卷 / 03期

基金：

加拿大自然科学与工程研究理事会; 美国国家科学基金会;

关键词：

LOCATION THEORY; CAPACITATED FACILITY LOCATION; LAGRANGIAN RELAXATION; LAGRANGIAN HEURISTIC;

D O I：

10.1016/0377-2217(91)90261-S

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Approaches proposed in the literature for the Capacitated Plant Location Problem are compared. The comparison is based on new theoretical and computational results. The main emphasis is on relaxations. In particular, dominance relations among the various relaxations found in the literature are identified. In the computational study, the relaxations are compared as a function of various characteristics of the test problems. Several of these relaxations can be used to generate heuristic feasible solutions that are better than the classical greedy or interchange heuristics, both in computing time and in the quality of the solutions found.

引用

页码：280 / 297

页数：18