Route planning with turn restrictions: A computational experiment

Vanhove, Stéphanie; Fack, Veerle

doi:10.1016/j.orl.2012.06.001

Cited by 12 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the case of turn restrictions, for example, joining turn-feasible shortest paths may still lead to forbidden turns at their junctions. Solution approaches for such problem variants rely on graph transformations (Clossey et al 2001, Vanhove andFack 2012) or exploit a mode selection subproblem to optimize the arrival direction at each service location during route evaluations (Vidal 2017). Exact algorithms may require dedicated pricing and cut separation procedures to consider costs based on consecutive edge pairs (Martinelli and Contardo 2015).…”

Section: Specificities Of the Transportation Networkmentioning

confidence: 99%

A concise guide to existing and emerging vehicle routing problem variants

Vidal

Laporte

Matl

2020

European Journal of Operational Research

227

View full text Add to dashboard Cite

Section: Specificities Of the Transportation Networkmentioning

confidence: 99%

A concise guide to existing and emerging vehicle routing problem variants

Vidal

Laporte

Matl

2020

European Journal of Operational Research

227

View full text Add to dashboard Cite

“…In the past, the time spent by trucks on traveling through a certain road segment or the length of the road is assigned as the weight value; however, this old model is not always effective in actual situations [18]. The turn of the road has become an important attribute in the transportation network when performing route planning or selection for the scheme of the oversized cargo transportation.…”

Section: Dual Graphmentioning

confidence: 99%

Optimized Route Selection Method based on the Turns of Road Intersections: A Case Study on Oversized Cargo Transportation

Meng¹,

Hu²,

Huang³

et al. 2015

IJGI

View full text Add to dashboard Cite

For oversized cargo transportation, traditional transportation schemes only consider road length, road width, the transportation cost as weight values in analysis and calculation of route selection. However, for oversized trucks, turning direction at road intersections is also a factor worth considering. By introducing the classical algorithm of Dijkstra into the model of road network, this research considers the size of turning angle at intersections as the weight value of the edge in the auxiliary network based on the weight values of road corners, upon which the shortest path analysis is performed. Then, an optimal path with minimum time cost was eventually obtained. The proposed algorithm was analyzed and compared with the traditional shortest path algorithm and it reported that our method could reduce the time for oversized trucks to pass through intersections. In addition, the proposed algorithm could be adapted to the complex and diverse road networks and provide a reliable scheme for route selection of oversized trucks.

show abstract

“…Since 1999, several papers [1,5,11,12,17,21] have been published that focus on routing problems with turn penalties. In these papers, well-known routing problems are generalized to take turn penalties into account.…”

Section: Introductionmentioning

confidence: 99%

A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties

Cerrone

Dussault

Wang

et al. 2019

European Journal of Operational Research

View full text Add to dashboard Cite

In this paper, we consider the Directed Rural Postman Problem with Turn Penalties (DRPP-TP). A solution is a tour that traverses all required arcs of the graph. The total cost of the tour is the sum of the lengths of the traversed arcs plus the penalties associated with the turns. One solution approach involves transforming the arc routing problem into an equivalent node routing problem. An alternative direct approach (without graph transformation) that involves two stages has been proposed in the literature. In the first part of this paper, we investigate the applicability of the direct approach. We identify several characteristics of the input instance that make this approach effective and present several limitations of this approach. In the second part of this paper, we describe an integer linear program that is combined with a local search algorithm. This combination produces high-quality solutions to the DRPP-TP in a reasonable amount of computing time.

show abstract

Route planning with turn restrictions: A computational experiment

Cited by 12 publications

References 13 publications

A concise guide to existing and emerging vehicle routing problem variants

A concise guide to existing and emerging vehicle routing problem variants

Optimized Route Selection Method based on the Turns of Road Intersections: A Case Study on Oversized Cargo Transportation

A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties

Contact Info

Product

Resources

About