A model and a solution algorithm for the car pooling problem with pre-matching information

NCU Institutional Repository > 工學院 > 土木工程學系 > 期刊論文 > Item 987654321/49805

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/49805

题名:	A model and a solution algorithm for the car pooling problem with pre-matching information
作者:	Yan,SY;Chen,CY
贡献者:	土木工程學系
关键词:	A-RIDE PROBLEM;TIME WINDOWS;TRANSPORTATION
日期:	2011
上传时间:	2012-03-27 16:17:15 (UTC+8)
出版者:	國立中央大學
摘要:	Most past car pooling studies have focused on the to-work problem (from different origins to a common destination) or the return-from-work problem (from the same origin to different destinations). Pre-matching information, including the carpool partners and the route/schedule for each previously participating vehicle, have rarely been considered. As a result, there has not yet been a suitable method/model developed for solving practical many-to-many car pooling problem with multiple vehicle and person types, as well as pre-matching information, that occur in real-world. In this study we strive to make up this lack by employing a time-space network flow technique to develop a model for this type of car pooling problem with pre-matching information (CPPPMI). The model is formulated as an integer multiple commodity network flow problem. A solution algorithm, based on Lagrangian relaxation and a heuristic for the upper bound solution, is developed to solve the model. To test how well the model and the solution algorithm may be applied to real-world, numerical tests are performed with several problem instances randomly generated based upon data reported from a past study carried out in northern Taiwan. The test results show the effectiveness of the proposed model and solution algorithm. (C) 2011 Elsevier Ltd. All rights reserved.
關聯:	COMPUTERS & INDUSTRIAL ENGINEERING
显示于类别:	[土木工程學系 ] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	712	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....