Tabu search for the real-world carpooling problem

Can Huang, Defu Zhang (), Yain-Whar Si and Stephen C. H. Leung
Additional contact information
Can Huang: Xiamen University
Defu Zhang: Xiamen University
Yain-Whar Si: University of Macau
Stephen C. H. Leung: The University of Hong Kong

Journal of Combinatorial Optimization, 2016, vol. 32, issue 2, No 10, 492-512

Abstract: Abstract Carpooling is a flexible shared transportation system which can effectively reduce the vehicle numbers and fuel consumption. Although many carpooling systems have been proposed, most of them lack practicality, veracity, and efficiency. In this paper, we propose a new useful variant model of the long-term carpooling problem which involves multiple origins and one destination. Such problems commonly occur in a wide number of carpooling situations in real-world scenarios. Our work is motivated by the practical needs to solve environmental pollution, parking problems, traffic jams and low utilization of resources. A Tabu search algorithm is proposed in this paper to solve the carpooling problem. The proposed algorithm aims at a wide range of passenger distribution and routing problems. The computational results based on real world user data show the effectiveness of the proposed algorithm. Moreover, we developed a mobile application based on our carpooling model.

Keywords: Carpooling problem; Tabu search; Routing problem; Transportation system (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0015-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-016-0015-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0015-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().