A concise guide to existing and emerging vehicle routing problem variants

Vidal, Thibaut; Laporte, Gilbert; Matl, Piotr

doi:10.1016/j.ejor.2019.10.010

Cited by 225 publications

(87 citation statements)

References 318 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thus, only the papers related to our study are reviewed instead of a detailed overview. Interested readers can please refer to [2] and [11] for a comprehensive knowledge on general VRPs.…”

Section: ⅱ Literature Reviewmentioning

confidence: 99%

A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods

Bin

Zhou

2020

IEEE Access

View full text Add to dashboard Cite

In delivering perishable goods, certain unexpected disruptive events may cause the initial routing scheme to be infeasible. A new routing scheme must be generated quickly to alleviate delivery disturbances. According to the idea of disruption management, a disruption recovery model with a distinctive type of split delivery is developed for inter-route recourse based on an initial time-dependent vehicle routing model with time windows, which synthesizes the perishable nature of delivered goods and dynamic travel route choice in urban road networks. Then, a tabu search algorithm is proposed to solve the initial routing problem and further extended to generate the disruption recovery plan. Three computational experiments on the instances adapted from Solomon's and Gehring and Homberger's benchmark problems are conducted to illustrate the effectiveness of the proposed model and algorithm. INDEX TERMS Vehicle routing, disruption management, time-dependent, time windows, split delivery.

show abstract

“…Thus, only the papers related to our study are reviewed instead of a detailed overview. Interested readers can please refer to [2] and [11] for a comprehensive knowledge on general VRPs.…”

Section: ⅱ Literature Reviewmentioning

confidence: 99%

A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods

Bin

Zhou

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Many exact and heuristic methods have been proposed in the literature for vehicle routing problems such as [9,10]. Three recent comprehensive reviews are provided for the VRP in [11][12][13]. A recent survey on PVRP is also presented by [14].…”

Section: Literature Reviewmentioning

confidence: 99%

Mathematical models for the periodic vehicle routing problem with time windows and time spread constraints

Öztop¹,

Kızılay²,

Çil³

2020

Int. J. Optim. Control, Theor. Appl. (IJOCTA)

View full text Add to dashboard Cite

The periodic vehicle routing problem (PVRP) is an extension of the well-known vehicle routing problem. In this paper, the PVRP with time windows and time spread constraints (PVRP-TWTS) is addressed, which arises in the high-value shipment transportation area. In the PVRP-TWTS, period-specific demands of the customers must be delivered by a fleet of heterogeneous capacitated vehicles over the several planning periods. Additionally, the arrival times to a customer should be irregular within its time window over the planning periods, and the waiting time is not allowed for the vehicles due to the security concerns. This study, proposes novel mixed-integer linear programming (MILP) and constraint programming (CP) models for the PVRP-TWTS. Furthermore, we develop several valid inequalities to strengthen the proposed MILP and CP models as well as a lower bound. Even though CP has successful applications for various optimization problems, it is still not as well-known as MILP in the operations research field. This study aims to utilize the effectiveness of CP in solving the PVRP-TWTS. This study presents a CP model for PVRP-TWTS for the first time in the literature to the best of our knowledge. Having a comparison of the CP and MILP models can help in providing a baseline for the problem. We evaluate the performance of the proposed MILP and CP models by modifying the well-known benchmark set from the literature. The extensive computational results show that the CP model performs much better than the MILP model in terms of the solution quality.

show abstract

“…Using efficient vehicle routes provides a direct competitive advantage to transportation companies, which usually operate with limited profitability margins. Moreover, the fact that these problems share a simple yet rich structure, generalizing the traveling salesman problem, has helped to elevate the VRP family into one of the main testbed for studies in optimization and heuristics [3,4]. Recently, integration of the traffic management systems (TMSs) with cloud computing paradigm has brought the extensibility and scalability for these systems [5].…”

Section: Introductionmentioning

confidence: 99%

An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems

et al. 2020

View full text Add to dashboard Cite

A novel parallelization method of genetic algorithm (GA) solution of the Traveling Salesman Problem (TSP) is presented. The proposed method can considerably accelerate the solution of the equivalent TSP of many complex vehicle routing problems (VRPs) in the cloud implementation of intelligent transportation systems. The solution provides routing information besides all the services required by the autonomous vehicles in vehicular clouds. GA is considered as an important class of evolutionary algorithms that can solve optimization problems in growing intelligent transport systems. But, to meet time criteria in time-constrained problems of intelligent transportation systems like routing and controlling the autonomous vehicles, a highly parallelizable GA is needed. The proposed method parallelizes the GA by designing three concurrent kernels, each of which running some dependent effective operators of GA. It can be straightforwardly adapted to run on many-core and multi-core processors. To best use the valuable resources of such processors in parallel execution of the GA, threads that run any of the triple kernels are synchronized by a low-cost switching mechanism. The proposed method was experimented for parallelizing a GA-based solution of TSP over multi-core and many-core systems. The results confirm the efficiency of the proposed method for parallelizing GAs on many-core as well as on multi-core systems.

show abstract

A concise guide to existing and emerging vehicle routing problem variants

Cited by 225 publications

References 318 publications

A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods

A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods

Mathematical models for the periodic vehicle routing problem with time windows and time spread constraints

An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems

Contact Info

Product

Resources

About