People and parcels sharing a taxi for Tokyo city

Nguyen, Ngoc-Quang; Nghiem, Nguyen-Viet-Dung; Do, Phan-Thuan; Le, Khac-Tuan; Nguyen, Minh-Son; Mukai, Naoto

doi:10.1145/2833258.2833309

Cited by 21 publications

(19 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors dub this the "share-aride" problem and further consider stochastic problem aspects in Li et al (2016b). Nguyen et al (2015) extend the model of Li et al (2014) to support a real road network, as well as including constraints to prevent passenger trips from being interrupted by freight pickups or deliveries. The authors provide heuristics to solve the model quickly in practice and provide experimental results on data from a taxi company in Tokyo, Japan.…”

Section: Ride-sharingmentioning

confidence: 99%

Collaborative urban transportation: Recent advances in theory and practice

Cleophas

Cottrill

Ehmke

et al. 2019

European Journal of Operational Research

252

View full text Add to dashboard Cite

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Highlights • Comprehensive overview of OR approaches for collaborative urban transportation • Analyzes real-world collaborative transportation systems, assessing pros and cons • Research outlook for the emerging field of collaborative transport optimization

show abstract

Section: Ride-sharingmentioning

confidence: 99%

Collaborative urban transportation: Recent advances in theory and practice

Cleophas

Cottrill

Ehmke

et al. 2019

European Journal of Operational Research

252

View full text Add to dashboard Cite

show abstract

“…For the sake of reducing the computational complexity, they also propose a method to optimize the insertion of parcel requests into the predefined taxi routes. Nguyen et al (2015) build upon the model from Li et al (2014) and conduct a case study on the Tokyo-Musen Taxi company in Tokyo city. Typically, a taxi driver has to comply with the service levels for both the passenger and the parcels.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Several attempts to develop such integrated models have been made. Li et al (2014) and Nguyen et al (2015) consider problems in which people and parcels are handled in an integrated way by the same taxi network. Ghilas et al (2013) study the possibility of transporting freight by public transport, which operates according to predetermined routes and schedules.…”

mentioning

confidence: 99%

Multi-hop driver-parcel matching problem with time windows

2017

View full text Add to dashboard Cite

Crowdsourced shipping can result in significant economic and social benefits. For a shipping company, it has a potential cost advantage and creates opportunities for faster deliveries. For the society, it can provide desirable results by reducing congestion and air pollution. Despite the great potential, crowdsourced shipping is not well studied. With the aim of using the spare capacities along the existing transportation flows of the crowd to deliver small-to-medium freight volumes, this paper defines the multi-driver multi-parcel matching problem and proposes a general ILP formulation, which incorporates drivers' maximum detour, capacity limits, and the option of transferring parcels between drivers. Due to the high computational complexity, we develop two heuristics to solve the problem. The numerical study shows that crowdsourced shipping can be an economic viable and sustainable option, depending on the spatial characteristics of the network and drivers' schedules. Furthermore, the added benefits increase with an increasing number of participating drivers and parcels.

show abstract

“…For example, Li et al [8] formulate a share-a-ride problem to optimize taxi routes and schedules to better match the supply of taxis and the demand from passengers and parcel deliveries. e model is evaluated in Tokyo city by Nguyen et al [9] and extended by Li et al [10] by integrating stochastic travel times and delivery locations. Masson et al [11] propose a public transit-based PPS system that firstly uses buses to deliver the packages from a consolidation/distribution center to a set of bus stops and then dispatches a fleet of freighters to deliver packages to customers.…”

Section: Introductionmentioning

confidence: 99%

A Multimodal Passenger-and-Package Sharing Network for Urban Logistics

Zheng

Zhao

et al. 2020

Journal of Advanced Transportation

View full text Add to dashboard Cite

This paper envisions a multimodal passenger-and-package sharing (PPS) network for urban logistics integrating metro, taxi, and truck. A hub-and-spoke structure is designed including hubs located at metro stations and service stores connected to the hubs. Packages are transported by metro on backbone links between the hubs and are carried by taxis or trucks between service stores and hubs, depending on the unit costs of these two modes and capacity constraint of the taxi. A mixed integer linear programming model for hub location problems—fusing the multiassignment p-hub median problem without capacity constraints and the capacitated multiassignment p-hub covering problem—is formulated to optimize the multimodal PPS network. The model is implemented based on the real-world data in Shanghai (China) under a series of scenarios to evaluate the network performance from two perspectives: the number of hubs and the proportion of taxi drivers who are willing to carry packages. The scenarios show that with increased number of hubs, the spatial distribution of hubs disperses from the city center to peripheral areas and more areas can be serviced by taxis. There is, however, a trade-off between the operation cost saved by taxis and the establishment cost of an extra hub. The analysis also presents that if the proportion of taxis willing to carry packages associates with the incentive payments to taxi drivers, an optimal value of incentives exists, by balancing the operation costs of taxis and trucks.

show abstract

People and parcels sharing a taxi for Tokyo city

Cited by 21 publications

References 16 publications

Collaborative urban transportation: Recent advances in theory and practice

Collaborative urban transportation: Recent advances in theory and practice

Multi-hop driver-parcel matching problem with time windows

A Multimodal Passenger-and-Package Sharing Network for Urban Logistics

Contact Info

Product

Resources

About