http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Algorithm for Weber problem with a metric based on the initial fare
Lev A. Kazakovtsev,Predrag S. Stanimirovic 한국전산응용수학회 2015 Journal of applied mathematics & informatics Vol.33 No.1
We introduce a non-Euclidean metric for transportation systems with a defined minimum transportation cost (initial fare) and investigatethe 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 fora special local search procedure. The results of local search are then checked for optimality by calculating directional derivative ofmodified objective functions in finite number of directions. If the local search result is not optimal then algorithm solves constrainedWeber problems with Euclidean metric to obtain the final result. An illustrative example is presented.
ALGORITHM FOR WEBER PROBLEM WITH A METRIC BASED ON THE INITIAL FARE
Kazakovtsev, Lev A.,Stanimirovic, Predrag S. The Korean Society for Computational and Applied M 2015 Journal of applied mathematics & informatics Vol.33 No.1
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.