Ridesharing: The state-of-the-art and future directions

Furuhata, Masabumi; Dessouky, Maged; Ordóñez, Fernando; Brunet, Marc-Etienne; Wang, Xiaoqing; Koenig, Sven

doi:10.1016/j.trb.2013.08.012

Cited by 772 publications

(449 citation statements)

References 39 publications

Supporting

Mentioning

435

Contrasting

Unclassified

Order By: Relevance

“…The problem arises naturally from a broad spectrum of real-world applications, including courier routing [9,15], service scheduling [3,4], Dial-a-Ride systems [2,8,26,27], etc. Depending on which element or elements of the problem become dynamic, numerous variations of the DVRP exist.…”

Section: Literature Reviewmentioning

confidence: 99%

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

Zou

Dessouky

2018

J Veh Routing Algorithms

View full text Add to dashboard Cite

In this paper, we study the vehicle routing problem with dynamic customers, where a portion of the customer requests are known in advance and the rest arrive in real time. We propose an optimization-based look-ahead dynamic routing framework that involves request forecasting, partial planning, and dynamic real-time routing of the fleet. This framework has the capabilities for adjustments in response to routing environments with different levels of uncertainties. Through extensive numeral simulations, we exam its performance in routing environments with various levels of uncertainties. We demonstrate the efficiency and robustness of the proposed solution by benchmarking against two other routing strategies. This paper fills the gap in the literature on studying the relationship between the level of route planning in the solution approach and the quality of the solution under various system conditions.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

Zou

Dessouky

2018

J Veh Routing Algorithms

View full text Add to dashboard Cite

show abstract

“…Despite the obvious potential economic gains offered by this solution, and the adoption of many policies and incentives in the past to foster its use, very few systems have been put into practice; such systems are still far from reaching the modal share sought. This issue is reviewed in detail in recent works such as Agatz et al (2012) and Furuhata et al (2013).…”

Section: Dynamic Assignment For Collaborative Modesmentioning

confidence: 99%

“…For instance Furuhata et al (2013) review the matching problem for ridesharing, i.e., matching between a driver and a passenger. Cross-dock operations (Van Belle et al 2012) are also often modelled as a synchronization or matching problem.…”

Section: Problem Statementmentioning

confidence: 99%

Equilibrium models in multimodal container transport systems

2015

View full text Add to dashboard Cite

Optimizing the performance of multimodal freight transport networks involves adequately balancing the interplay between costs, volumes, times of departure and arrival, and times of travel. In order to study this interplay, we propose an assignment model that is able to efficiently determine flows and costs in a multimodal network. The model is based on a so-called user equilibrium principle, which is at the basis of Dynamic Traffic Assignment problems. This principle takes into account transport demands to be shipped using vehicles that transport single freight units (such as trucks) or multiple freight units (such as trains and barges, where demand should be bundled to reach efficient operations). Given a particular demand, the proposed model provides an assignment of the demand over the available modes of transport. The outcome of the model, i.e., the equilibrium point, minimizes users' generalized costs, expressed as a function of mode, travel time and related congestion, and waiting time for bundling sufficient demand in order to fill a vehicle. The model deals with these issues across a doubly-dynamic time scale and in an integrated manner. One dynamic involves a learning dynamic converging towards an equilibrium (day-to-day) situation, reflecting the reaction of the players towards the action of the others. Another dynamic considers the possible departure time that results in minimum expected costs, also due to the fact that players mutually influence each other on the choice of departure times, due to congestion effects and costs for early/late arrival of freight units. This is a choice within a given time horizon such as a day or a week. We present a study on the influence and sensitivity of different model parameters, in order to analyse the implications on strategic decisions, fostering a target modal share for freight transportation. We also study under which conditions the different modes can be substitutes for each other.

show abstract

“…An extensive overview of its challenges and future potentials is provided by Furuhata et al (2013), who list design, arrangement and trust issues as major obstacles for agencies utilising trip sharing. In contrast, car sharing refers in this work to settings where two or more travellers share one vehicle at various times of the day, however, not simultaneously.…”

Section: Introductionmentioning

confidence: 99%

Evaluation of trip and car sharing concepts for home health care services

Fikar

Hirsch

2016

Flex Serv Manuf J

View full text Add to dashboard Cite

Routing and scheduling of home health care services usually focuses on the case where each nurse operates a separate vehicle. With increasing urbanisation, limited availability of parking spaces and stricter environmental regulations, service providers are starting to investigate car and trip sharing concepts as potential alternatives. This paper numerically investigates a car sharing concept as well as operating a transport system, which delivers and picks up nurses to and from clients combined with the additional option of walking. Different geographic distributions are investigated to identify beneficial settings for successful implementation considering various objectives of decision makers. The evaluation shows that trip sharing performs best if long service durations exist, long delays for parking occur and in areas where clients are both geographically distributed randomly and in clusters. Additionally, facilitating walking as well as trip or car sharing reduces the number of required vehicles substantially. Nevertheless, for walking and trip sharing, travel durations are prone to increase compared to classical planning approaches.

show abstract

Ridesharing: The state-of-the-art and future directions

Cited by 772 publications

References 39 publications

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem

Equilibrium models in multimodal container transport systems

Evaluation of trip and car sharing concepts for home health care services

Contact Info

Product

Resources

About