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

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 adaptiv...

Full description

Bibliographic Details
Main Authors: Luis, Martino, Salhi, Said, Nagy, Gabor
Format: Article
Published: Elsevier 2011
Subjects:
_version_ 1803624604901572608
author Luis, Martino
Salhi, Said
Nagy, Gabor
author_facet Luis, Martino
Salhi, Said
Nagy, Gabor
author_sort Luis, Martino
collection UUM
description 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.
first_indexed 2024-07-04T05:21:02Z
format Article
id uum-3136
institution Universiti Utara Malaysia
last_indexed 2024-07-04T05:21:02Z
publishDate 2011
publisher Elsevier
record_format dspace
spelling uum-31362016-04-24T04:11:04Z https://repo.uum.edu.my/id/eprint/3136/ A guided reactive GRASP for the capacitated multi-source Weber problem Luis, Martino Salhi, Said Nagy, Gabor QA Mathematics 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. Elsevier 2011-07 Article PeerReviewed Luis, Martino and Salhi, Said and Nagy, Gabor (2011) A guided reactive GRASP for the capacitated multi-source Weber problem. Computers and Operations Research, 38 (7). pp. 1014-1024. ISSN 0305-0548 http://dx.doi.org/10.1016/j.cor.2010.10.015
spellingShingle QA Mathematics
Luis, Martino
Salhi, Said
Nagy, Gabor
A guided reactive GRASP for the capacitated multi-source Weber problem
title A guided reactive GRASP for the capacitated multi-source Weber problem
title_full A guided reactive GRASP for the capacitated multi-source Weber problem
title_fullStr A guided reactive GRASP for the capacitated multi-source Weber problem
title_full_unstemmed A guided reactive GRASP for the capacitated multi-source Weber problem
title_short A guided reactive GRASP for the capacitated multi-source Weber problem
title_sort guided reactive grasp for the capacitated multi source weber problem
topic QA Mathematics
work_keys_str_mv AT luismartino aguidedreactivegraspforthecapacitatedmultisourceweberproblem
AT salhisaid aguidedreactivegraspforthecapacitatedmultisourceweberproblem
AT nagygabor aguidedreactivegraspforthecapacitatedmultisourceweberproblem
AT luismartino guidedreactivegraspforthecapacitatedmultisourceweberproblem
AT salhisaid guidedreactivegraspforthecapacitatedmultisourceweberproblem
AT nagygabor guidedreactivegraspforthecapacitatedmultisourceweberproblem