TY - JOUR

T1 - A car pooling model and solution method with stochastic vehicle travel times

AU - Yan, Shangyao

AU - Chen, Chun Ying

AU - Chang, Sheng Chieh

PY - 2014/2

Y1 - 2014/2

N2 - Carpooling is one method that can be easily instituted and can help resolve a variety of problems that continue to plague urban areas, ranging from energy demands and traffic congestion to environmental pollution. However, most carpooling organizations currently use a trial-and-error process, in accordance with the projected vehicle travel times, for carpooling, which is neither effective nor efficient. In other words, stochastic disturbances arising from variations in vehicle travel times in actual operations are neglected. In the worst case scenario, where vehicle travel times fluctuate wildly during operations, the planned schedule could be disturbed enough to lose its optimality. Therefore, we constructed a stochastic carpooling model that considers the influence of stochastic travel times. The model is formulated as an integer multiple commodity network flow problem. Since real problem sizes can be large, it could be difficult to find optimal solutions within a reasonable period of time. Therefore, we develop a solution algorithm to solve the model. To test how well the model and the solution algorithm can be applied to the real world, we also developed a simulation-based evaluation method. To test the model and the solution algorithm, a case study is performed based upon data reported from a past study carried out in northern Taiwan. The results show that the model and solution algorithm are good and could be useful for carpooling practices.

AB - Carpooling is one method that can be easily instituted and can help resolve a variety of problems that continue to plague urban areas, ranging from energy demands and traffic congestion to environmental pollution. However, most carpooling organizations currently use a trial-and-error process, in accordance with the projected vehicle travel times, for carpooling, which is neither effective nor efficient. In other words, stochastic disturbances arising from variations in vehicle travel times in actual operations are neglected. In the worst case scenario, where vehicle travel times fluctuate wildly during operations, the planned schedule could be disturbed enough to lose its optimality. Therefore, we constructed a stochastic carpooling model that considers the influence of stochastic travel times. The model is formulated as an integer multiple commodity network flow problem. Since real problem sizes can be large, it could be difficult to find optimal solutions within a reasonable period of time. Therefore, we develop a solution algorithm to solve the model. To test how well the model and the solution algorithm can be applied to the real world, we also developed a simulation-based evaluation method. To test the model and the solution algorithm, a case study is performed based upon data reported from a past study carried out in northern Taiwan. The results show that the model and solution algorithm are good and could be useful for carpooling practices.

KW - Carpooling

KW - multiple commodity network flow problem

KW - stochastic travel time

KW - time-space network

UR - http://www.scopus.com/inward/record.url?scp=84894080147&partnerID=8YFLogxK

U2 - 10.1109/TITS.2013.2272085

DO - 10.1109/TITS.2013.2272085

M3 - 期刊論文

AN - SCOPUS:84894080147

SN - 1524-9050

VL - 15

SP - 47

EP - 61

JO - IEEE Transactions on Intelligent Transportation Systems

JF - IEEE Transactions on Intelligent Transportation Systems

IS - 1

M1 - 6567895

ER -