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...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference or Workshop Item |
Published: |
2015
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/16830/ http://doi.org/10.1063/1.4915703 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Utara Malaysia |