Browse > Article

Weighted Optimal Location of Mail Distribution Center Using GOSST  

Kim, In-Bum (School of Information Technology, Kimpo College)
Kim, Joon-Mo (Computer Science & Engineering, Dankook University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea TC / v.47, no.11, 2010 , pp. 7-13 More about this Journal
Abstract
For swiftness and economic feasibility of parcel delivery, optimal location of mail exchanging centers considering not only section delivery distance but also some weights like the number of delivery vehicles are necessary. In this paper, a mechanism with section delivery distance and vehicle number for locating of mail distribution centers which connect some mail centers of major cities in Republic Korea by applying GOSST theory is proposed. This mechanism for locating mail exchange centers can make the total delivery distance of postal matters less than not only present method which assigns Daejun as mail exchange center, but also Steiner tree method which does not consider weights like number of delivery vehicles. The mechanism is good for protecting the environment as well as rapid and economic delivery. In experiment, the proposed mechanism could curtail total delivery distance by 2.52 percentages compared with Steiner tree method and by 6.66 percentages compared with present method. The mechanism may be used in electric power transmission routing, distribution line topology design, power relay station locating where various voltages and other weights should be considered.
Keywords
Grade of Services Steiner Minimum Tree; Steiner Tree; Mail Distribution Center; Weight;
Citations & Related Records
Times Cited By KSCI : 5  (Citation Analysis)
연도 인용수 순위
1 김재각, 김인범, 김수인, "원격 검침 시스템에서 근사 최소 스타이너 트리를 이용한 집중기 및 중계기의 효율적인 배치와 연결," 한국통신학회 논문지B, Vol. 34 No. 10, pp.994-1003, 2009.   과학기술학회마을
2 이성근, 한치근, "다중 제약이 있는 멀티캐스트 트리 문제에 관한 연구," 한국 인터넷정보학회 논문지, Vol. 5, No.5, pp.129-138, 2004.   과학기술학회마을
3 B. Bell, "Steiner Minimal Tree Problem," http://www.css.taylor.edu/～bbell/steiner/, 1999
4 I. Kim and C. Kim, "An Enhanced Heuristic Using Direct Steiner Point Locating and Distance Preferring MST Building Strategy for GOSST Problem," International Journal of Computer Science and Network Security, Vol.7, No.2, pp.164-175, 2007.
5 C.J. Colbourn and G. Zue, "Grade of Service Steiner Trees in Serial-Parallel Networks," Advances in Steiner Trees, pp.1-10, 1998.
6 M. Karpiniski, I.I. Mandoiu, A. Olshevsky and A. Zelikovsky, "Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem," Algorithmica, 42, pp.109-120, 2005.   DOI   ScienceOn
7 J. Park and C. Choi, "Bayes Stopping Rule for MAC Scheme in Wireless Sensor Networks," Journal of IEEK, vol. 45-TC, no. 7, pp.53-61, July 2008.   과학기술학회마을
8 J. Park, J. Ha and C. Choi, "Bayesian Cognizance of RFID Tegs," Journal of IEEK, vol. 46-TC, no. 5, pp.524-531, May 2009.   과학기술학회마을
9 http://maps.google.co.kr/maps?hl=kol, 2010
10 G.L. Xue, G.H. Lin. and D.Z. Du, "Grade of Service Steiner Minimum Trees in Euclidean Plane," Algorithmica, Vol.31, pp.479-500, 2001.   DOI   ScienceOn
11 J. Kim, M. Cardei, I. Cardei and X. Jia, "A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem," Algorithmica, Vol.42, pp.109-120, 2005.   DOI   ScienceOn
12 양성덕, 유용규, 이상중, "Steiner Tree 이론을 이용한 우편물 교환센터의 최적 위치 선정," 한국 조명 전기 설비학회 논문지. Vol.22, No.9 pp.82-87, 2008.   과학기술학회마을
13 F.K. Hwang, "A Primer of the Euclidean Steiner problem," Annals of Operations Research, Vol.33, pp.73-84, 1991.   DOI
14 E.J. Cockayne and D.E. Hewgrill, "Improved computation of plane Steiner minimal tree," Algorithmica, Vol.7, pp.219-229, 1992.   DOI