dc.contributor.author |
Gamal, M. D. H |
|
dc.date.accessioned |
2017-10-16T03:24:31Z |
|
dc.date.available |
2017-10-16T03:24:31Z |
|
dc.date.issued |
2017-10-16 |
|
dc.identifier.other |
wahyu sari yeni |
|
dc.identifier.uri |
http://repository.unri.ac.id:8080/xmlui/handle/123456789/9015 |
|
dc.description.abstract |
A constructive heuristic is introduced to solve a continuous location-allocation problem in the presence of convex polygonal barriers. Potensial sites for the facility can be anywhere in the space except in the interior of the barriers. Also the Euclidean distance travelled cannot cross the interior of the barriers. The main steps of the method is put forward. The preliminary results is presented based on benchmark problems. |
en_US |
dc.description.provenance |
Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2017-10-16T03:24:31Z
No. of bitstreams: 3
Judul.pdf: 1586183 bytes, checksum: 7826015b161b4225fcbea1e422819637 (MD5)
Daftar Isi.pdf: 624505 bytes, checksum: 4e0cc2ef5b069ba8d7464f4cbbddb365 (MD5)
Artikel.pdf: 5246644 bytes, checksum: b53cb66be670e9d4e053cc0070e03a7e (MD5) |
en |
dc.description.provenance |
Made available in DSpace on 2017-10-16T03:24:31Z (GMT). No. of bitstreams: 3
Judul.pdf: 1586183 bytes, checksum: 7826015b161b4225fcbea1e422819637 (MD5)
Daftar Isi.pdf: 624505 bytes, checksum: 4e0cc2ef5b069ba8d7464f4cbbddb365 (MD5)
Artikel.pdf: 5246644 bytes, checksum: b53cb66be670e9d4e053cc0070e03a7e (MD5)
Previous issue date: 2017-10-16 |
en |
dc.description.sponsorship |
International Seminar in Operational Research (InteriOR) 2011
LOCATION-ALLOCATION PROBLEMS WITH THE PRESENCE OF BARRIERS
M. D. H. Gamal
Department of Mathematics, FMIPA, University of Riau, Pekanbaru 28293, Indonesia mdhgamal@unri.ac.id
ABSTRACT
A constructive heuristic is introduced to solve a continuous location-allocation problem in the presence of convex polygonal barriers. Potensial sites for the facility can be anywhere in the space except in the interior of the barriers. Also the Euclidean distance travelled cannot cross the interior of the barriers. The main steps of the method is put forward. The preliminary results is presented based on benchmark problems.
Keywords: Heuristic, continuous location-allocation problem |
en_US |
dc.language.iso |
en |
en_US |
dc.subject |
Heuristic |
en_US |
dc.subject |
continuous location-allocation problem |
en_US |
dc.title |
Location-Allocation Problems With The Presence Of Barriers |
en_US |