Advanced
ALGORITHM FOR WEBER PROBLEM WITH A METRIC BASED ON THE INITIAL FARE
ALGORITHM FOR WEBER PROBLEM WITH A METRIC BASED ON THE INITIAL FARE
Journal of applied mathematics & informatics. 2015. Jan, 33(1_2): 157-172
  • Received : February 14, 2014
  • Published : January 30, 2015
Download
PDF
e-PUB
PubReader
PPT
Export by style
Share
Article
Author
Metrics
Cited by
TagCloud
About the Authors
Kazakovtsev Lev A.
Stanimirovic Predrag S.

Abstract
We introduce a non-Euclidean metric for transportation systems with a defined minimum transportation cost (initial fare) and investigate the continuous single-facility Weber location problem based on this metric. The proposed algorithm uses the results for solving the Weber 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 modified objective functions in finite number of directions. If the local search result is not optimal then algorithm solves constrained Weber problems with Euclidean metric to obtain the final result. An illustrative example is presented.
Keywords
View Fulltext