대한교통학회지 (Journal of Korean Society of Transportation)

  • 제30권5호
  • /
  • Pages.71-82
  • /
  • 2012
  • /
  • 1229-1366(pISSN)
  • /
  • 2234-4217(eISSN)
대한교통학회 (Korean Society of Transportation)
권호 표지
DOI QR코드

DOI QR Code

화음탐색법을 이용한 교통망 링크 통행비용함수 정산기법 개발

Calibration of a Network Link Travel Cost Function with the Harmony Search Algorithm

  • 김현명 (명지대학교 교통공학과) ;
  • 황용환 (명지대학교 교통공학과) ;
  • 양인철 (한국건설기술연구원 도로연구실)
  • Kim, Hyun Myung (Department of Transportation Engineering, Myungji University) ;
  • Hwang, Yong Hwan (Department of Transportation Engineering, Myungji University) ;
  • Yang, In Chul (Highway Research Division, Korea Institute of Construction Technology)
  • 투고 : 2012.04.24
  • 심사 : 2012.08.29
  • 발행 : 2012.10.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 연구에서는 최근 개발된 화음 탐색법을 이용해 교통망 통행배정 모형의 통행비용 함수의 하나인 BPR 함수의 계수들을 추정하였다. 기존 연구에서는 교통량과 통행시간 자료를 실측해 이를 통계적으로 분석해 계수를 추정하는 방법과 관측교통량과 통행배정 교통량을 일치시키는 계수값을 찾는 것을 목표로 통행배정 모형과 최적화 기법을 결합시킨 방법을 이용하여왔다. 이중 대형 교통망의 계수 정산에 자주 이용되어온 최적화 기법은 관측 통행패턴을 최대한 근접하게 재현하는 계수를 추정할 수 있다는 장점이 있으나 그 수학적 성질과 추정 계수값에 대한 수학적 검토가 충분히 이루어지지 못했다. 본 연구에서는 이러한 문제 인식아래 최근 개발된 전역 탐색 기법인 화음탐색법 기반의 교통망 비용함수 정산 방법을 개발하였다. 화음탐색법은 2000년대 초반 개발된 이후 다양한 분야에서 기존에 사용되던 전역탐색기법들에 비해 우수한 성질을 입증하여 왔으나 교통분야에는 그 적용 예가 거의 없었다. 본 연구는 화음탐색법의 개념을 설명하고 이를 이용해 개발된 정산 알고리즘을 기존 연구에서 사용된 점진증가법 및 황금율법과 성능 비교하였다. 화음탐색법 기반 정산기법은 기존 기법들에 비해 관측 통행패턴을 보다 근접하게 재현할 수 있는 비용함수 계수값들을 찾을 수 있는 것으로 나타났다. 또, 관측 교통량 기반 계수추정법은 BPR식의 ${\beta}$값 추정에는 적합하지만 초기속도나 ${\alpha}$값 정산을 위해서는 통행 속도나 시간과 같은 추가 자료가 필요한 것으로 판단된다.

Some previous studies adopted a method statistically based on the observed traffic volumes and travel times to estimate the parameters. Others tried to find an optimal set of parameters to minimize the gap between the observed and estimated traffic volumes using, for instance, a combined optimization model with a traffic assignment model. The latter is frequently used in a large-scale network that has a capability to find a set of optimal parameter values, but its appropriateness has never been demonstrated. Thus, we developed a methodology to estimate a set of parameter values of BPR(Bureau of Public Road) function using Harmony Search (HS) method. HS was developed in early 2000, and is a global search method proven to be superior to other global search methods (e.g. Genetic Algorithm or Tabu search). However, it has rarely been adopted in transportation research arena yet. The HS based transportation network calibration algorithm developed in this study is tested using a grid network, and its outcomes are compared to those from incremental method (Incre) and Golden Section (GS) method. It is found that the HS algorithm outperforms Incre and GS for copying the given observed link traffic counts, and it is also pointed out that the popular optimal network calibration techniques based on an objective function of traffic volume replication are lacking the capability to find appropriate free flow travel speed and ${\alpha}$ value.

키워드

참고문헌

  1. Akcelik R. (1978), A New Look at Davidson's Travel Time Function, Traffic Eng. and Control, Vol.19, No.10, pp.459-463.
  2. Boyce D. E., Janson B. N., Eash R. W. (1981), The effect on equilibrium trip assignment of different link congestion functions, Transp. Rec., Part A, Vo.15, No.3, pp.223-232. https://doi.org/10.1016/0191-2607(81)90003-0
  3. Campbell E. W., Keefer L. E., Adams R. W. (1959), A Method For Predicting Speeds Through Signalized Street Sections, Highway Research Record Bulletin 230.
  4. Chun-Nam National University (2007), Validation of road VDF Function; The Improvement and Fundamental Survey Method Research on Passenger Travel OD Table 여객O/D의 신뢰성 제고 및 조사방법론 기초연구 중 도로의 통행비용함수 파라미터 보완 및 검증.
  5. Choi K. C. (1986), Comparative Analysis and Application of Capacity-deterrence Function 용량저항함수의 비교.분석 및 그 적용방안에 관한 연구, Master Dissertation, Seoul National University.
  6. Daganzo C. F. (1977a), On the Traffic Assignment Problem with Flow Dependent Costs-I, Transp. Rec. 11, pp.433-437. https://doi.org/10.1016/0041-1647(77)90009-0
  7. Daganzo C. F. (1977b), On the Traffic Assignment Problem with Flow Dependent Costs-II, Transp. Rec. 11, pp.439-441. https://doi.org/10.1016/0041-1647(77)90010-7
  8. Davidson K. B. (1966), A Flow Travel-time Relationship For Use in Transportation Planning, Proc. 3rd Australia Road Research Board, pp.183-194.
  9. Florian M., Nguyen S. (1976), An Application and Validation of Equilibrium Trip Assignment Methods, Transp. Sci. 10, pp.374-390. https://doi.org/10.1287/trsc.10.4.374
  10. Geem Z. W., Geem W. B. (2007), Cutting-edge Optimization Technique and its Application to the Covil Engineering, The Magazine of the Korean Society of Civil Engineers, Vol.57, No.1, pp.155-171.
  11. Geem Z. W., Lee K. S., Park Y. J. (2005), Application of Harmony Search to Vehicle Routing, American J. Appl. Sci. 2, No.12, pp.1552-1557. https://doi.org/10.3844/ajassp.2005.1552.1557
  12. Irwin N. A., Dodd N., Von Cube H. G. (1961), Capacity Restraint in Assignment Programs, Highway Res., Board Bulletin, No.297, pp.109-127
  13. Jang D. H. (1993), The Sensitivity of Delay Function and Traffic Deterrence Parameters on Highway Sections 고속도로 통행의 지체함수와 통행저항 파라메타의 민감도에 관한 연구, Ph.D Dissertation, Seoul National University.
  14. Ju J. Y. (1993), Comparison and Application of Traffic Capacity Function for Traffic Assignment Model 통행배정모형 교통용량함수 비교 및 적용에 관한 연구: BPR식과 Davidson식을 중심으로, Master dissertation, Seoul National University
  15. Kang H. I. (1996), Development of Classified Congestion Functions and Impact Analysis on Traffic Assignment, Ph. D Dissertation, Seoul National University.
  16. Kim H. (2008), New Dynamic Travel Demand Modeling Methods in Advanced Data Collecting Environments, Ph.D. Dissertation, University of California, Irvine.
  17. Lee K. S., Geem Z. W. (2005), A New Meta-heuristic Algorithm For Continuous Engineering Optimization: Harmony Search Theory and Practice, Comput. Methods in Applied Mechanics and Eng., No.194, pp.3902-3933. https://doi.org/10.1016/j.cma.2004.09.007
  18. Lee E. E. (1986), Review on the Application of the Link Delay Function and the Traffic Deterrence Function 링크 체증함수 및 일반화 비용함수 적용에 관한 일고찰, Master Dissertation, Seoul National University.
  19. Mahmassani H. S., Mouskos K. C. (1988), Some Numerical Results on the Diagonalization Algorithm for Network Assignment with Asymmetric Interactions Between Cars and Trucks, Transp. Rec., B Vol.22, No.4, pp.275-290. https://doi.org/10.1016/0191-2615(88)90004-5
  20. Mosher W. W. (1963), A Capacity Restraint Algorithm for Assigning Flow to A Transport Network, Highway Res. Board 6, pp.41-70.
  21. Overgaard K. R. (1967), Urban Transportation Planning : Traffic Estimation, Traffic Quarterly, pp.197-218.
  22. Smock R. (1962), An Iterative Assignment Approach to Capacity Restraint on Arterial Networks, Highway Res. Board Bulletin, No.347, pp.60-66.
  23. Soltman T. J. (1965), Effects of Alternate Loading Sequences on Results from Chicago Trip Distribution and Assignment Model, Highway Res. Rec., No.114, pp.122-140.
  24. Spicess H. (1990), Conical Volume-Delay Functions, Transp. Sci. Vol.24, No.2, pp.153-158. https://doi.org/10.1287/trsc.24.2.153
  25. Steenbrink P. A. (1974), Otimization of Transport Network, John Wiley and Sons, New York, NY.
  26. Suh S. D. (1990), The Validation of Road Capacity Function in Korea 한국의 도로 용량함수 검증에 관한 연구, Transport Studies 1, The Korea Transport Institute, pp.75-93.
  27. The Korea Transportation Institute(2009), The Development of Road Travel Cost Function: The National Travel Demand Survey and DB Construction in 2008 2008년도 국가교통수요 조사 및 DB 구축사업 중 도로통행비용함수 구축관련 조사 연구, Ministry of Land, Transport and Maritime Affairs
  28. Wardrop J. G. (1968), Journy Speed and Flow in Central London, Traffic Eng. and Control, Vol.8, No.9, pp.528-532.
  29. Wynter L. M. (1995), Advances in the Theory and Application of the Multiclass Traffic Assignment Problem, Ph. D Dissertation, Ecole Nationale Des Ponts et Chaussees.