A large neighbourhood search to solve capacitated planar location-allocation problem
This paper presents a large neighbourhood search for solving the planar location-allocation problem. This location-allocation problem entails to find the location of specified number of facilities on a plane and their customer allocations on a plane. It is generally assumed that all facilities have...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/18598/ http://doi.org/10.1063/1.4903646 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|