A Rotary Heuristic for Location-Allocation Problems

Gamal, M. D. H

dc.contributor.author	Gamal, M. D. H
dc.date.accessioned	2017-10-16T03:34:41Z
dc.date.available	2017-10-16T03:34:41Z
dc.date.issued	2017-10-16
dc.identifier.other	wahyu sari yeni
dc.identifier.uri	http://repository.unri.ac.id:8080/xmlui/handle/123456789/9016
dc.description.abstract	This 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 located	en_US
dc.description.provenance	Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2017-10-16T03:34:41Z No. of bitstreams: 3 Judul.pdf: 123986 bytes, checksum: 69d84fc2425f43c76c7085e8b78b2cc4 (MD5) Daftar Isi.pdf: 545395 bytes, checksum: 2f4e9493023e89c349a3b1b995589841 (MD5) Artikel.pdf: 6031614 bytes, checksum: 5741840411505d40026a09bcf14a64e6 (MD5)	en
dc.description.provenance	Made available in DSpace on 2017-10-16T03:34:41Z (GMT). No. of bitstreams: 3 Judul.pdf: 123986 bytes, checksum: 69d84fc2425f43c76c7085e8b78b2cc4 (MD5) Daftar Isi.pdf: 545395 bytes, checksum: 2f4e9493023e89c349a3b1b995589841 (MD5) Artikel.pdf: 6031614 bytes, checksum: 5741840411505d40026a09bcf14a64e6 (MD5) Previous issue date: 2017-10-16	en
dc.description.sponsorship	The 3rd International Seminar on Operational Research (InteriOR 2015)	en_US
dc.language.iso	en	en_US
dc.subject	facility location	en_US
dc.subject	location-allocation	en_US
dc.subject	heuristic	en_US
dc.title	A Rotary Heuristic for Location-Allocation Problems	en_US
dc.type	Article	en_US