A combinatorial auction‐based approach for ridesharing in a student transportation system. Issue 3 (19th August 2021)

• Record Type: Journal Article
• Authors: Triki, Chefi; Mahdavi Amiri, Maziar; Tavakkoli‐Moghaddam, Reza; Mokhtarzadeh, Mahdi; Ghezavati, Vahidreza
• Is Part Of: Networks. Volume 78:Issue 3(2021)
• Page Start: 229
• Page End: 247
• Publication Date: 2021-08-19
• Subjects: combinatorial auctions -- hybrid heuristic algorithms -- ridesharing -- vehicle routing problem -- winner determination problem; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.22074
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: Here, a mixed‐integer linear programming model is developed to represent a transportation system of students traveling from/to a university campus. The concept of ridesharing is used and the mechanism of combinatorial auctions is incorporated within a routing‐based model. The mathematical model is based on the vehicle routing problem along with appropriate constraints accommodating features that express the auction clearing phase. A hybrid heuristic‐based optimization framework, that takes advantage of meta‐heuristic algorithms to improve an initial solution, is also developed to solve large‐sized instances of the problem. Three meta‐heuristics, namely particle swarm optimization, dragonfly algorithm, and imperialist competitive algorithm, are implemented in the proposed framework, whose performances are assessed and compared. Moreover, two improvement heuristic procedures that attempt to improve the outcomes of the foregoing meta‐heuristics are proposed and compared as well.