A branch-and-cut algorithm for a realistic dial-a-ride problem

Li, Mengyang; Luo, Zhixing; Lim, Andrew

doi:10.1016/j.trb.2015.05.009

Cited by 85 publications

(41 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to their brute-force nature, using enumeration algorithms for such real-time systems may require an additional preprocessing effort in order to fit the short computation times needed. Some preprocessing techniques can tighten travelers' time windows, eliminating unnecessary variables and constraints and identifying inequalities for narrowing the solution space (Liu et al (2014)). For example, Agatz et al (2011) introduced an efficient rolling horizon approach that can provide high-quality solutions for dynamic ridesharing systems where drivers and riders continuously enter and leave the system.…”

Section: Real-time Ridesharingmentioning

confidence: 99%

“…Huang et al 2013proposed a branch-and-bound algorithm and an integer programming algorithm for solving the problem of large-scale real-time ridesharing, and introduced a kinetic tree algorithm capable of better scheduling dynamic requests and adjusting routes on-the-fly. Liu et al (2014) proposed a branchand-cut algorithm to solve a realistic DARP with multiple trips and request types and a heterogeneous fleet of vehicles with configurable capacity and manpower planning. To solve the dynamic ridesharing problem over a full-day time horizon, Santos and Xavier (2015) suggested dividing the day into time periods, after which a deterministic instance of the problem can be generated and solved by a greedy randomized adaptive search procedure (GRASP).…”

Section: Real-time Ridesharingmentioning

confidence: 99%

See 1 more Smart Citation

A survey of models and algorithms for optimizing shared mobility

Mourad

Puchinger

Chu

2019

Transportation Research Part B: Methodological

238

View full text Add to dashboard Cite

The rise of research into shared mobility systems reflects emerging challenges, such as rising traffic congestion, rising oil prices and rising environmental concern. The operations research community has turned towards more sharable and sustainable systems of transportation. Shared mobility systems can be collapsed into two main streams: those where people share rides and those where parcel transportation and people transportation are combined. This survey sets out to review recent research in this area, including different optimization approaches, and to provide guidelines and promising directions for future research. It makes a distinction between prearranged and real-time problem settings and their methods of solution, and also gives an overview of real-case applications relevant to the research area.

show abstract

Section: Real-time Ridesharingmentioning

confidence: 99%

Section: Real-time Ridesharingmentioning

confidence: 99%

A survey of models and algorithms for optimizing shared mobility

Mourad

Puchinger

Chu

2019

Transportation Research Part B: Methodological

238

View full text Add to dashboard Cite

show abstract

“…Most studies of this type focus on uni-modal vehicle dispatching and routing policy design on road networks (Furuhata et al, 2013;Sayarshad and Chow, 2015). Different exact and approximation methods have been proposed for solving static and dynamic dial-a-ride problems (DARP) (Braekers et al, 2014;Jaw et al, 1986;Parragh et al, 2008;Kirchler and Wolfler Calvo, 2013;Liu et al, 2014). Among dynamic routing and dispatch, some studies have considered non-myopic or anticipative strategies (e.g.…”

Section: Literature Reviewmentioning

confidence: 99%

A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers

Rasulkhani

Chow

et al. 2019

Transportation Research Part E: Logistics and Transportation Re

125

View full text Add to dashboard Cite

We propose a ridesharing strategy with integrated transit in which a private on-demand mobility service operator may drop off a passenger directly door-to-door, commit to dropping them at a transit station or picking up from a transit station, or to both pickup and drop off at two different stations with different vehicles. We study the effectiveness of online solution algorithms for this proposed strategy. Queueingtheoretic vehicle dispatch and idle vehicle relocation algorithms are customized for the problem. Several experiments are conducted first with a synthetic instance to design and test the effectiveness of this integrated solution method, the influence of different model parameters, and measure the benefit of such cooperation. Results suggest that rideshare vehicle travel time can drop by 40-60% consistently while passenger journey times can be reduced by 50-60% when demand is high. A case study of Long Island commuters to New York City (NYC) suggests having the proposed operating strategy can substantially cut user journey times and operating costs by up to 54% and 60% each for a range of 10-30 taxis initiated per zone. This result shows that there are settings where such service is highly warranted.

show abstract

“…Table 3 shows the results of its uniform cost model. There have been a considerable amount of studies on exact solution methodologies for many variations of the traveling salesman problem (TSP) [6,24,27]. We have tested the algorithms on the four types of graphs: stars, diamonds, grids, and hypercubes.…”

Section: Computational Experimentsmentioning

confidence: 99%

The electric vehicle touring problem

Liao

Shen

2016

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

The increasing concern over global warming has led to the rapid development of the electric vehicle industry. Electric vehicles (EVs) have the potential to reduce the greenhouse effect and facilitate more efficient use of energy resources. In this paper, we study several EV route planning problems that take into consideration possible battery charging or swapping operations. Given a road network, the objective is to determine the shortest (travel time) route that a vehicle with a given battery capacity can take to travel between a pair of vertices or to visit a set of vertices with several stops, if necessary, at battery switch stations. We present polynomial time algorithms for the EV shortest travel time path problem and the fixed tour EV touring problem, where the fixed tour problem requires visiting a set of vertices in a given order. Based on the result, we also propose constant factor approximation algorithms for the EV touring problem, which is a generalization of the traveling salesman problem. origin in a given order. This result extends the previous studies of the fixed path gas station problem reported in [18,22,23] by using graph-theoretic techniques.3. We propose two approximation algorithms within a 9 4 -factor and a 9 2 -factor, respectively, for the uniform and non-uniform cost on-site station EV touring problem. Moreover, if the battery capacity is sufficiently large, the approximation ratio is the same as that of the well-known Christofides algorithm for the TSP, i.e., 3 2 . 4. We also study the off-site station EV touring problem and propose a 3 2 ( 3+2α 1−2α )-approximation algorithm to solve the problem, where α is a given acceptable distance between a city and its nearest battery switch station. PreliminariesA great deal of research has been devoted to the shortest route planning problem; and many variations and extensions of the problem have been proposed. One related problem is the well-known capacitated vehicle routing problem, which involves finding a set of routes that begin at a depot, visit multiple customers and deliver goods, and return to the depot such that the number of vehicles, each of which has a limited carrying capacity, is minimized or the total distance is minimized. Readers may refer to Laporte's survey [20] and Pillac et al.'s review [25] for further details on the constraints and conditions. Another related work is the orienteering problem where the objective is to find a path of a fixed length from a single source that visits as many locations as possible [4,5,7]. The EV touring problem can be regarded as an extension of this problem because the goal is to visit as many cities as possible under a fixed (i.e., full) battery capacity.Compared with the widely studied routing problems, there is a dearth of research on the optimal refueling problem [18,22,23,30,31], where the objective is to minimize the total cost of the fuel used. Lin et al. [22,23] investigated the shortest path problem with optimal refueling policies. They proposed a linear time algorithm for the fix...

show abstract

A branch-and-cut algorithm for a realistic dial-a-ride problem

Cited by 85 publications

References 53 publications

A survey of models and algorithms for optimizing shared mobility

A survey of models and algorithms for optimizing shared mobility

A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers

The electric vehicle touring problem

Contact Info

Product

Resources

About