dc.creator |
Luis, M |
|
dc.creator |
Irawan, CA |
|
dc.creator |
Imran, A |
|
dc.date |
2018-11-30T11:56:32Z |
|
dc.date |
2019-07-23 |
|
dc.date |
2018-11-30T11:56:32Z |
|
dc.date.accessioned |
2022-05-27T01:03:19Z |
|
dc.date.available |
2022-05-27T01:03:19Z |
|
dc.identifier |
Vol. 35 (3), pp. 366-377 |
|
dc.identifier |
10.1504/IJOR.2019.101200 |
|
dc.identifier |
http://hdl.handle.net/10871/34939 |
|
dc.identifier |
1745-7645 |
|
dc.identifier |
International Journal of Operational Research |
|
dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/241939 |
|
dc.description |
This is the author accepted manuscript. The final version is available from Inderscience via the DOI in this record |
|
dc.description |
This paper examines the capacitated planar multi-facility
location-allocation problem, where the number of facilities to be located is
specified and each of which has a capacity constraint. A two-stage method is
put forward to deal with the problem where in the first stage a technique that
discretises continuous space into discrete cells is used to generate a relatively
good initial facility configurations. In stage 2, a variable neighbourhood search
(VNS) is implemented to improve the quality of solution obtained by the
previous stage. The performance of the proposed method is evaluated using
benchmark datasets from the literature. The numerical experiments show that
the proposed method yields competitive results when compared to the best
known results from the literature. In addition, some future research avenues are
also suggested. |
|
dc.language |
en |
|
dc.publisher |
Inderscience |
|
dc.rights |
2020-07-23 |
|
dc.rights |
Under embargo until 23 July 2020 in compliance with publisher policy |
|
dc.subject |
capacitated |
|
dc.subject |
continuous location problem |
|
dc.subject |
heuristics |
|
dc.subject |
variable neighbourhood search |
|
dc.subject |
VNS |
|
dc.title |
A two-stage method for the capacitated multi-facility location-allocation problem |
|
dc.type |
Article |
|