Mass Transport Vehicle Routing Problem (MTVRP) and the Associated Network Design Problem (MTNDP)

R. Jayakrishnan and Laia Pages

University of California Transportation Center, Working Papers from University of California Transportation Center

Abstract: This research studies a new class of dynamic problem MTVRP where n vehicles are routed in real time in a fast varying environment to pickup and deliver m passengers when both n and m are big. The problem is very relevant to future transportation options involving large scale real-time routing of shared-ride fleet transit vehicles. Traditionally, dynamic routing solutions were found as static approximations for smaller-scale problems or using local heuristics for the larger-scale ones. Generally heuristics used for these types of problems do not consider global optimality. A hierarchical method to solve the MTVRP in three different stages has been developed. Within the optimization process, a particular case of Network Design Problem (NDP) is solved. This paper introduces MTVRP and presents a scheme to solve it. Then, it describes the associated Mass Transport Network Design Problem (MTNDP) and solves the problem. The computational complexities as well as the results are compared.

Keywords: Social; and; Behavioral; Sciences (search for similar items in EconPapers)
Date: 2005-06-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.escholarship.org/uc/item/3nw52138.pdf;origin=repeccitec (application/pdf)

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:cdl:uctcwp:qt3nw52138

Access Statistics for this paper

More papers in University of California Transportation Center, Working Papers from University of California Transportation Center Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().