Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints

Baldacci, Roberto; Mingozzi, Aristide; Roberti, Roberto

doi:10.1016/j.ejor.2011.07.037

Cited by 384 publications

(163 citation statements)

References 21 publications

Supporting

Mentioning

148

Contrasting

Unclassified

Order By: Relevance

“…Baldacci et al [15] reviewed recent research into the exact algorithms for the VRP with capacity and time window constraints [15]. Nagy and Salhi [16] proposed an improved heuristic algorithm to solve the pick-up and delivery VRP with multiple depots [16].…”

Section: Literature Reviewmentioning

confidence: 99%

Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

Zhang

Shi

Chen

et al. 2017

Journal of Advanced Transportation

View full text Add to dashboard Cite

The application of automated vehicles in logistics can efficiently reduce the cost of logistics and reduce the potential risks in the last mile. Considering the path restriction in the initial stage of the application of automated vehicles in logistics, the conventional model for a vehicle routing problem (VRP) is modified. Thus, the automated vehicle routing problem with time windows (AVRPTW) model considering path interruption is established. Additionally, an improved particle swarm optimisation (PSO) algorithm is designed to solve this problem. Finally, a case study is undertaken to test the validity of the model and the algorithm. Four automated vehicles are designated to execute all delivery tasks required by 25 stores. Capacities of all of the automated vehicles are almost fully utilised. It is of considerable significance for the promotion of automated vehicles in last-mile situations to develop such research into real problems arising in the initial period.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

Zhang

Shi

Chen

et al. 2017

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…Constraint (5) states the capacity of each vehicle should not exceed the total customers' demand. Equations (6) and (7) determine the driving time that has passed, where for vehicle h travelling from customer i to j on t day, the driving time passed is equal to the driving time passed by plus time driving from i to j ( Expressions (9) and (10) ensure that the driving time of each driver can not exceed the upper limit of each driver's working time per day. Constraint (11) ensure that the driver works no more than the maximum duration of work.…”

Section: The Open Vehicle Routing Problem With Windos Timementioning

confidence: 99%

“…( [5]) provide an overview and advanced heuristic analysis to solve large-scale VRPTW. A survey of algorithms was given by [6]. The best metaheuristics for solving current VRPTW are the picking algorithms ( [8], [9]) , large neighborhood search ( [10]- [12]), and local search iteration ( [13]).…”

Section: Related Workmentioning

confidence: 99%

The Open Vehicle Routing Problem With Time Windows Considering Driver’s Working Hour

Amir¹

2018

IJRASET

View full text Add to dashboard Cite

This paper presents an optimization model for a logistic management called open vehicle routing problem with time windows with driver's working time (OVRPTWWDWT). This is an extension of the classical OVRPTW which considers driver's working time to model the scheduling of the available drivers with respect of the driving time to satisfy customers' demand. The objective is to schedule the delivery according to the driver's working time and to determine the fleet scheduling and the driver's policy in serving the customer, such that to minimize the amount of cost over all the routes within the planning horizon. We propose a tabu search heuristic algorithms approach to solve the problem.

show abstract

“…The authors also survey metaheuristics for the VRPTW (see Bräysy and Gendreau [5]). Baldacci et al [3] provide a recent review of mathematical formulations, relaxations and exact methods for the VRPTW.…”

Section: Literature Reviewmentioning

confidence: 99%

A Vehicle Routing Problem with Flexible Time Windows

Taş

Jabali

Woensel

2014

Computers & Operations Research

View full text Add to dashboard Cite

Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints

Cited by 384 publications

References 21 publications

Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

The Open Vehicle Routing Problem With Time Windows Considering Driver’s Working Hour

A Vehicle Routing Problem with Flexible Time Windows

Contact Info

Product

Resources

About