Best carpool planning research
碩士 === 國立臺北科技大學 === 工業工程與管理系碩士班 === 105 === Due to the rapid development of technology, the problem of global warming and low air quality is becoming more serious, especially in the metropolitan areas where population is concentrated. In addition, the overcrowded metropolitan areas also cause diffic...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/p23t56 |
id |
ndltd-TW-105TIT05031081 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-105TIT050310812019-05-15T23:53:44Z http://ndltd.ncl.edu.tw/handle/p23t56 Best carpool planning research 最適共乘規劃之研究 Wei-Chen Dong 董威辰 碩士 國立臺北科技大學 工業工程與管理系碩士班 105 Due to the rapid development of technology, the problem of global warming and low air quality is becoming more serious, especially in the metropolitan areas where population is concentrated. In addition, the overcrowded metropolitan areas also cause difficult traffic problems. In addition to revising the design of the traffic thoroughfare, the search for innovative modes of transportation services has also been the focus of attention in the face of this urban-type traffic problem. Therefore, government intends to implement High Occupancy Vehicle measure in the Neihu Technology Park and promote taxi-pool services to alleviate the traffic congestion problem. In this study will mainly use the taxi to provide more convenience and flexibility carpool services. By using NSGA-II algorithm and cloud computing to match the carpool and to find the shortest path. The taxi driver can check out the passengers information and find the shortest path after planning, the passengers can also find the driver information, routes, departure time, arrival time and charges. Based on mutual trust by an open, real-time and trace-allowed information system, can increase the utilization of carpooling, then create greater value of carpool service. 王河星 2017 學位論文 ; thesis 52 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺北科技大學 === 工業工程與管理系碩士班 === 105 === Due to the rapid development of technology, the problem of global warming and low air quality is becoming more serious, especially in the metropolitan areas where population is concentrated. In addition, the overcrowded metropolitan areas also cause difficult traffic problems. In addition to revising the design of the traffic thoroughfare, the search for innovative modes of transportation services has also been the focus of attention in the face of this urban-type traffic problem. Therefore, government intends to implement High Occupancy Vehicle measure in the Neihu Technology Park and promote taxi-pool services to alleviate the traffic congestion problem.
In this study will mainly use the taxi to provide more convenience and flexibility carpool services. By using NSGA-II algorithm and cloud computing to match the carpool and to find the shortest path. The taxi driver can check out the passengers information and find the shortest path after planning, the passengers can also find the driver information, routes, departure time, arrival time and charges. Based on mutual trust by an open, real-time and trace-allowed information system, can increase the utilization of carpooling, then create greater value of carpool service.
|
author2 |
王河星 |
author_facet |
王河星 Wei-Chen Dong 董威辰 |
author |
Wei-Chen Dong 董威辰 |
spellingShingle |
Wei-Chen Dong 董威辰 Best carpool planning research |
author_sort |
Wei-Chen Dong |
title |
Best carpool planning research |
title_short |
Best carpool planning research |
title_full |
Best carpool planning research |
title_fullStr |
Best carpool planning research |
title_full_unstemmed |
Best carpool planning research |
title_sort |
best carpool planning research |
publishDate |
2017 |
url |
http://ndltd.ncl.edu.tw/handle/p23t56 |
work_keys_str_mv |
AT weichendong bestcarpoolplanningresearch AT dǒngwēichén bestcarpoolplanningresearch AT weichendong zuìshìgòngchéngguīhuàzhīyánjiū AT dǒngwēichén zuìshìgòngchéngguīhuàzhīyánjiū |
_version_ |
1719156000945078272 |