Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks

Chen, Bi Yu; Lam, William H. K.; Li, Qingquan

doi:10.1002/atr.1408

Cited by 24 publications

(13 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed NTP-A* algorithm can also be extended to construct reliable Space-time prisms [17] in road networks with travel time uncertainties. In this stochastic case, both the A* and branch-and-bound techniques are effective, but reliable shortest path algorithms [38,40,41] should be employed for the two shortest path searches. However, the NTP construction problem becomes challenging when both dynamic and stochastic characteristics of travel times are considered.…”

Section: Discussionmentioning

confidence: 99%

Efficient Geo-Computational Algorithms for Constructing Space-Time Prisms in Road Networks

Chen

Wang

et al. 2016

IJGI

Self Cite

View full text Add to dashboard Cite

The Space-time prism (STP) is a key concept in time geography for analyzing human activity-travel behavior under various Space-time constraints. Most existing time-geographic studies use a straightforward algorithm to construct STPs in road networks by using two one-to-all shortest path searches. However, this straightforward algorithm can introduce considerable computational overhead, given the fact that accessible links in a STP are generally a small portion of the whole network. To address this issue, an efficient geo-computational algorithm, called NTP-A*, is proposed. The proposed NTP-A* algorithm employs the A* and branch-and-bound techniques to discard inaccessible links during two shortest path searches, and thereby improves the STP construction performance. Comprehensive computational experiments are carried out to demonstrate the computational advantage of the proposed algorithm. Several implementation techniques, including the label-correcting technique and the hybrid link-node labeling technique, are discussed and analyzed. Experimental results show that the proposed NTP-A* algorithm can significantly improve STP construction performance in large-scale road networks by a factor of 100, compared with existing algorithms.

show abstract

Section: Discussionmentioning

confidence: 99%

Efficient Geo-Computational Algorithms for Constructing Space-Time Prisms in Road Networks

Chen

Wang

et al. 2016

IJGI

Self Cite

View full text Add to dashboard Cite

show abstract

“…Otherwise, we have to use certain algorithms to construct a feasible solution based on the current relaxed solution. It is also a typical method adopted in many studies, such as Li and Ouyang [29], Marín [30], An et al [31], Fu and Diabat [32], and Chen et al [33].…”

Section: Hybrid Methods Based On Greedy Algorithm and Dynamicmentioning

confidence: 99%

Ridesharing Problem with Flexible Pickup and Delivery Locations for App-Based Transportation Service: Mathematical Modeling and Decomposition Methods

Zhao

Yin

et al. 2018

Journal of Advanced Transportation

View full text Add to dashboard Cite

App-based transportation service system, such as Uber and Didi, has brought a new transportation mode to users, who are able to make reservations using mobile apps conveniently. However, one of the fundamental challenges in app-based transportation system is the inefficiency and unreliability of the vehicle routing plans caused by complex topology of urban road network and unpredictable traffic conditions. A common way to tackle this problem is repositioning pickup or delivery locations via the coordination between drivers and passengers. This paper studies an on-demand ridesharing problem that determines the optimal ride-share matching strategy and vehicle routing plan with respect to flexible pickup and delivery locations. By introducing the concept of space-time windows, the problem is formulated as the pickup and delivery problem with space-time windows (PDPSW) in space-time network. To solve the model efficiently and accurately, we particularly develop a customized solution approach based on Lagrangian relaxation. Numerical examples are conducted to demonstrate the performance of the proposed framework and draw some managerial insights into the optimal system operation. The results indicate that adopting the serving strategy of flexible pickup and delivery locations will evidently reduce the system cost and improve the service quality in app-based transportation service systems.

show abstract

“…For example, Crainic and Rousseau [3] propose a generic model for freight transportation service network design with frequency. Chen et al [4] formulated the spatially dependent reliable shortest path problem (SD-RSPP) as a multicriteria shortest pathfinding problem in road networks with correlated link travel times. Kim and Barnhart [5] based on the characteristics of flight network develop a charter airline service network design model as mixed-integer programming.…”

Section: Literature Reviewmentioning

confidence: 99%

Highway Passenger Transport Based Express Parcel Service Network Design: Model and Algorithm

Jiang

Sun

et al. 2017

Journal of Advanced Transportation

View full text Add to dashboard Cite

Highway passenger transport based express parcel service (HPTB-EPS) is an emerging business that uses unutilised room of coach trunk to ship parcels between major cities. While it is reaping more and more express market, the managers are facing difficult decisions to design the service network. This paper investigates the HPTB-EPS network design problem and analyses the time-space characteristics of such network. A mixed-integer programming model is formulated integrating the service decision, frequency, and network flow distribution. To solve the model, a decomposition-based heuristic algorithm is designed by decomposing the problem as three steps: construction of service network, service path selection, and distribution of network flow. Numerical experiment using real data from our partner company demonstrates the effectiveness of our model and algorithm. We found that our solution could reduce the total cost by up to 16.3% compared to the carrier's solution. The sensitivity analysis demonstrates the robustness and flexibility of the solutions of the model.

show abstract

Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks

Cited by 24 publications

References 46 publications

Efficient Geo-Computational Algorithms for Constructing Space-Time Prisms in Road Networks

Efficient Geo-Computational Algorithms for Constructing Space-Time Prisms in Road Networks

Ridesharing Problem with Flexible Pickup and Delivery Locations for App-Based Transportation Service: Mathematical Modeling and Decomposition Methods

Highway Passenger Transport Based Express Parcel Service Network Design: Model and Algorithm

Contact Info

Product

Resources

About