A Model With a Heuristic Algorithm for Solving the Long-Term Many-to-Many Car Pooling Problem

NCUIR > Engineering College > Department of Civil Engineering > journal & Dissertation > Item 987654321/49806

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/49806

Title:	A Model With a Heuristic Algorithm for Solving the Long-Term Many-to-Many Car Pooling Problem
Authors:	Yan,SY;Chen,CY;Lin,YF
Contributors:	土木工程學系
Keywords:	A-RIDE PROBLEM;TIME WINDOWS;TRANSPORTATION;CONSTRAINTS
Date:	2011
Issue Date:	2012-03-27 16:17:16 (UTC+8)
Publisher:	國立中央大學
Abstract:	Long-term car pooling is defined as the sharing of a private vehicle by more than one user who need to reach a destination following a semicommon route between the individuals' points of origin and destination in a specific period. In this paper, we employ a network flow technique to systematically develop a long-term many-to-many car pooling model. The model is formulated as a special integer multiple-commodity network flow problem. A Lagrangian relaxation-based algorithm is also developed to solve the model. The performance of the heuristic algorithm is evaluated by carrying out a case study using real data and suitable assumptions. The test results confirm the usefulness of the model and the heuristic algorithm and that they could be useful in practice.
Relation:	IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	663	View/Open

社群 sharing