Location-Allocation Problems With The Presence Of Barriers
No Thumbnail Available
Date
2017-10-16
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Heuristic, continuous location-allocation problem