A Rotary Heuristic for Location-Allocation Problems

dc.contributor.authorGamal, M. D. H
dc.date.accessioned2017-10-16T03:34:41Z
dc.date.available2017-10-16T03:34:41Z
dc.date.issued2017-10-16
dc.description.abstractThis paper proposes a constructive heuristic method to solve location-allocation problems. Specifically, we consider the problem of locating m new facilities in a continuous region such that the sum of the weighted distances from the new facilities to n existing facilities is minimized. The distance is measured using the Euclidean-distance metric. This simple technique shows that the solution found is encouraging for the case where the number of users is much larger than the number of facilities to be locateden_US
dc.description.sponsorshipThe 3rd International Seminar on Operational Research (InteriOR 2015)en_US
dc.identifier.otherwahyu sari yeni
dc.identifier.urihttp://repository.unri.ac.id:8080/xmlui/handle/123456789/9016
dc.language.isoenen_US
dc.subjectfacility locationen_US
dc.subjectlocation-allocationen_US
dc.subjectheuristicen_US
dc.titleA Rotary Heuristic for Location-Allocation Problemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 3 of 3
No Thumbnail Available
Name:
Judul.pdf
Size:
121.08 KB
Format:
Adobe Portable Document Format
Description:
cover
No Thumbnail Available
Name:
Daftar Isi.pdf
Size:
532.61 KB
Format:
Adobe Portable Document Format
Description:
daftar isi
No Thumbnail Available
Name:
Artikel.pdf
Size:
5.75 MB
Format:
Adobe Portable Document Format
Description:
artikel
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: