Efficient GRASP based heuristics for the capacitated continuous location-allocation problem
This paper explores the np-hard capacitated continuous location-allocation problem, where the number of facilities to be located is specified and each of which has a constant capacity. Efficient greedy randomised adaptive search procedure (GRASP) based heuristics are proposed to tackle the problem.A...
Main Authors: | Luis, Martino, Ramli, Mohammad Fadzli, Surya Saputra, Ruswiati |
---|---|
Format: | Conference or Workshop Item |
Published: |
2015
|
Subjects: |
Similar Items
-
A large neighbourhood search to solve capacitated planar location-allocation problem
by: Luis, Martino, et al.
Published: (2014) -
Ant colony optimization using different heuristic strategies for capacitated vehicle routing problem
by: Ayop S., S. F. M., et al.
Published: (2020) -
An appraisal of meta-heuristic resource allocation techniques for IaaS cloud
by: Madni, S. H. H., et al.
Published: (2016) -
An efficient robust hyper-heuristic algorithm to clustering problem
by: Bonab, M. B., et al.
Published: (2019) -
Solving the bi-objective capacitated p-median problem with multilevel capacities using compromise programming and VNS
by: Irawan, Chandra Ade, et al.
Published: (2017)