지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2002.2
- 수록면
- 99 - 139 (41page)
이용수
초록· 키워드
오류제보하기
The aim of the present study is to find a good quality user equilibrium assignments under time varying condition. For this purpose, this study introduces a dynamic network loading method that can maintain correct flow propagation as well as flow conservation, and it develops a novel solution algorithm that does not need evaluation of the objective function by modifying the Schittenhelm (1990)'s algorithm. This novel algorithm turns out to be efficient and convenient compared to the conventional Frank-Wolfe (1956) algorithm because the former finds solutions based on routes rather than links so that it can maintain correct flow propagation intrinsically in the time-varying network conditions. The application of dynamic user equilibrium (DUE) assignment model with this novel solution algorithm to test networks including medium-sized one shows that the present DUE assignment model gives rise to high quality discrete time solutions when we adopt the deterministic queuing model for a link performance function, and we associate flows and costs in a proper way.
목차
등록된 정보가 없습니다.
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Physical Network Algorithm for A Link-Based Dynamic Traffic Assignment Model
KSCE JOURNAL OF CIVIL ENGINEERING
2002 .12
-
실제 도시가로망을 대상으로 한 교통배분Model의 실증적 검토
국토계획
2002 .04
-
An Assignment Problem Algorithm Using Minimum Cost Moving Method
한국컴퓨터정보학회논문지
2015 .08
-
Capacity Assignment and Routing Algorithm in Convergence-type Network
Asia-Pacific Conference on Communications
1995 .01
-
병렬처리를 이용한 Dynamic Network Assignment 기법에 관한 연구
대한교통학회 학술대회지
2002 .10
-
A Proposal of a Quasi-solution State Evolution Algorithm for Channel Assignment Problems
한국정보과학회 학술발표논문집
2002 .01
-
Genetic Algorithms Approach to the Channel Assignment Problem
Asia-Pacific Conference on Communications
1995 .01
-
할당 문제의 최적 알고리즘
한국컴퓨터정보학회논문지
2012 .09
-
A Path-Based Analytical Dynamic Traffic Assignment Model for Real Time Evaluation of Simulation Based Dynamic Traffic Assignment Models
KSCE JOURNAL OF CIVIL ENGINEERING
1999 .09
-
수요예측결과의 평가기준 및 평가방법에 관한 연구
대한교통학회지
1994 .03
-
An Online Wavelength Assignment Algorithm for Optical Network
ICEIC : International Conference on Electronics, Informations and Communications
2004 .08
-
Power Flow Solution Using an Improved Fitness Function in Genetic Algorithms
Journal of Electrical Engineering and information Science
1997 .10
-
랜덤형 2차원 할당문제의 최소 거리-최대 물동량 배정 알고리즘
한국인터넷방송통신학회 논문지
2018 .01
-
Efficient Coupling-Driven Track Assignment Algorithms
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
2005 .07
-
A New Algorithm for Optimal State Assignment in Multi-level Logic Design
JTC-CSCC : Joint Technical Conference on Circuits Systems, Computers and Communications
1989 .01
-
동질의 트리 구조에서의 효율적인 태스크 할당 알고리즘
(구)정보과학회논문지
1993 .01
-
車輛容量을 考慮한 大衆交通 通行配定模型構築에 關한 硏究
대한교통학회지
1996 .09
-
동적과정을 이용한 가변수요 통행배정모형의 알고리듬 개발
대한교통학회지
2006 .04
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2018-053-003261116