MULTI-FACILITY LOCATION PROBLEMS WITH THE PRESENCE OF BARRIERS

Gamal, M. D. H

dc.contributor.author	Gamal, M. D. H
dc.date.accessioned	2014-05-22T04:31:03Z
dc.date.available	2014-05-22T04:31:03Z
dc.date.issued	2014-05-22
dc.identifier.isbn	978-602-18936-0-9
dc.identifier.other	wahyu sari yeni
dc.identifier.uri	http://repository.unri.ac.id/xmlui/handle/123456789/6320
dc.description.abstract	A constructive heuristic method is introduced to solve the multi-facility location problems in the presence of convex polygonal barriers. Potential locations for the facilities 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 method guides the initial chosed location away from the barriers and the Weisgal procedure then improve the location position subject to the user locations and the corner points of the barriers. The preliminary results are presented based on benchmark problems	en_US
dc.description.provenance	Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2014-05-22T04:31:03Z No. of bitstreams: 1 68 makalah oral.pdf: 346943 bytes, checksum: 21b8ce02d39d464ba81143da3fe6cb40 (MD5)	en
dc.description.provenance	Made available in DSpace on 2014-05-22T04:31:03Z (GMT). No. of bitstreams: 1 68 makalah oral.pdf: 346943 bytes, checksum: 21b8ce02d39d464ba81143da3fe6cb40 (MD5)	en
dc.description.sponsorship	Seminar UR-UKM ke-7 2012	en_US
dc.language.iso	en	en_US
dc.subject	Heuristic	en_US
dc.subject	multi-facility location problem	en_US
dc.title	MULTI-FACILITY LOCATION PROBLEMS WITH THE PRESENCE OF BARRIERS	en_US
dc.type	UR-Proceedings	en_US