Abstract
We introduce a non-Euclidean metric for transportation sys- tems with a dened minimum transportation cost (initial fare) and in- vestigate the continuous single-facility Weber location problem based on this metric. The proposed algorithm uses the results for solving the We- ber problem with Euclidean metric by Weiszfeld procedure as the initial point for a special local search procedure. The results of local search are then checked for optimality by calculating directional derivative of modi- ed objective functions in nite number of directions. If the local search result is not optimal then algorithm solves constrained Weber problems with Euclidean metric to obtain the nal result. An illustrative example is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
