A guided reactive GRASP for the capacitated multi-source Weber problem

被引：21

作者：

Luis, Martino ^{[1
]}

Salhi, Said ^{[2
]}

Nagy, Gabor ^{[2
]}

机构：

[1] Univ Utara Malaysia, Coll Business, Sintok, Kedah Darul Ama, Malaysia

[2] Univ Kent, Kent Business Sch, Ctr Logist & Heurist Optimisat, Canterbury CT2 7PE, Kent, England

来源：

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

关键词：

Reactive GRASP; Learning; Continuous location; Capacitated location; Restricted regions; HEURISTIC METHODS; EUCLIDEAN DISTANCE; LOCATION; ALGORITHM;

D O I：

10.1016/j.cor.2010.10.015

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The capacitated multi-source Weber problem entails finding both the locations of capacitated facilities on a plane and their customer allocations. A framework that uses adaptive learning and functional representation to construct the restricted candidate list (RCL) within a greedy randomized adaptive search procedure (GRASP) is put forward. An implementation of restricted regions that forbids new facilities to be located too close to the previously found facilities is also embedded into the search to build up the RCL more efficiently. The performance of this GRASP based approach is tested on three classes of instances with constant and variable capacities. Very competitive results are obtained when compared to the best known results from the literature. (C) 2010 Elsevier Ltd. All rights reserved.

引用

页码：1014 / 1024

页数：11

共 50 条

[41] The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals
Akyuz, M. Hakan
Oncan, Temel
Altinel, I. Kuban
IIE TRANSACTIONS, 2010, 42 (11) : 825 - 841
[42] A Beam Search Heuristic for the Multi-commodity Capacitated Multi-facility Weber Problem
Oncan, Temel
Akyuz, M. Hakan
Altinel, I. Kuban
INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTIST, IMECS 2012, VOL II, 2012, : 1617 - 1622
[43] The Multi-commodity Capacitated Multi-facility Weber Problem: Heuristics and Confidence Intervals
Akyuez, M. Hakan
Oencan, Temel
Altinel, I. Kuban
IMECS 2009: INTERNATIONAL MULTI-CONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2009, : 2042 - +
[44] An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
Jianlin Jiang
Su Zhang
Yibing Lv
Xin Du
Ziwei Yan
Journal of Global Optimization, 2020, 76 : 793 - 818
[45] GRASP Heuristics for a Generalized Capacitated Ring Tree Problem
Baya, Gabriel
Mauttone, Antonio
Robledo, Franco
Romero, Pablo
MACHINE LEARNING, OPTIMIZATION, AND BIG DATA, MOD 2017, 2018, 10710 : 436 - 448
[46] The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methods
Akyuz, M. Hakan
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 113 : 221 - 240
[47] Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
Akyuz, M. Hakan
Oncan, Temel
Altinel, I. Kuban
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) : 225 - 237
[48] Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Akyuz, M. Hakan
Oncan, Temel
Altinel, I. Kuban
ANNALS OF OPERATIONS RESEARCH, 2019, 279 (1-2) : 1 - 42
[49] Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
M. Hakan Akyüz
Temel Öncan
İ. Kuban Altınel
Annals of Operations Research, 2019, 279 : 1 - 42
[50] Combined Single-Source and Multi-source Capacitated Facility Location Problems with Data Envelopment Analysis
Jamalian, Ali
Salahi, Maziar
MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020

← 1 2 3 4 5 →