Heuristic solution of the multisource Weber problem as a p-median problem

被引：91

作者：

Hansen, P

Mladenovic, N

Taillard, E

机构：

[1] GERAD, Montreal, PQ H3T 2A7, Canada

[2] Ecole Hautes Etud Commerciales, Montreal, PQ H3T 2A7, Canada

[3] IDSIA, CH-6900 Lugano, Switzerland

来源：

OPERATIONS RESEARCH LETTERS | 1998年 / 22卷 / 2-3期

基金：

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

关键词：

location; continuous; heuristic;

D O I：

10.1016/S0167-6377(98)00004-2

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Good heuristic solutions for large multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users locations and then solving Weber problems for the sets of users of each facility. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：55 / 62

页数：8

共 26 条

[1]

BAUM EB, 1996, NEURAL NETWORKS COMP

[2] A NEW ADAPTIVE MULTI-START TECHNIQUE FOR COMBINATORIAL GLOBAL OPTIMIZATIONS [J].