분야별 논문보기
APP별 논문보기
- 2d_comp_p
- 2d_continuum_analysis
- 2d_incomp_p
- 2d_yuibm_1
- 3d_electrophysiology_humanhf
- brownian_dynamics
- caffeineedison
- cnt_fet
- cr2d_dyn
- cr2d_st
- csd_elast
- csd_eplast
- dock
- dpd_linear_polymer
- edava
- edisondesigner
- edwave2d
- eklgcmc2
- emega
- galaxytbm
- galaxydock
- galaxyrefine
- galaxytbm
- gamess
- ksec2d_ae
- ksec2d_wm
- lcaodftlab
- m-sketch
- nanowire_fet
- plate_shell_analysis
- pnjunclab
- sfe_calc
- sfe_calc_v2
- solarcell
- solv_freee
- tb_em_negf
- tb_em_negf_tmd
- tb_em_nw
- utb_fet
유전 알고리즘을 이용한 최적 경로 탐색
유전 알고리즘을 이용한 최적 경로 탐색
Challenge 애게서 업로드 하였습니다. 17. 8. 9 오후 2:48 경진대회: 전산설계 전산설계 » 4회 경진대회
버전 1.0
In case of the big city, choosing the adequate root of which we can reach the destination can affect the driver’s condition and driving time. So it is quite important to find the optimal routes for arriving the destination as considering the factors, such as driving conditions or travel time and so on. In this paper, we develop route choice model with considering driving conditions and travel time, and it can search the optimal path which make drivers reduce their fatigues using genetic algorithm.
다운로드 (1.4MB) URL 또는 Webdav URL 가져오기