Journal ArticleDOI
Vehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows
TLDR
In this article, the authors formulated the vehicle routing problem of simultaneous deliveries and pickups with split loads and time windows (VRPSDPSLTW) as a mixed-integer programming problem and developed a hybrid heuristic algorithm to solve this problem.Abstract:
The vehicle routing problem with simultaneous deliveries and pickups (VRPSDP) has attracted much research interest because of the potential to provide cost savings to transportation and logistics operators. Several extensions of VRPSDP exist. Of these extensions, the simultaneous deliveries and pickups with split loads problem (SDPSLP) has been proposed to eliminate vehicle capacity constraints, as well as allow the deliveries or pickups for a customer to be split into multiple visits. Although delivery and pickup activities are often constrained by time windows, few studies have considered such constraints when SDPSLP has been addressed. To fill the gap, this paper formulates the vehicle routing problem of simultaneous deliveries and pickups with split loads and time windows (VRPSDPSLTW) as a mixed-integer programming problem. A hybrid heuristic algorithm was developed to solve this problem. Solomon data sets with minor modifications were applied to test the effectiveness of the solution algorithm. The r...read more
Citations
More filters
Journal ArticleDOI
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
TL;DR: This article takes a closer look at the concepts of 64 remarkable meta-heuristics, selected objectively for their outstanding performance on 15 classic MAVRP with different attributes, and leads to the identification of “winning strategies” in designing effective heuristics forMAVRP.
Journal ArticleDOI
Vehicle routing under time-dependent travel times
TL;DR: This work develops a set of vehicle routing problem instances on real road networks, and a speed model that reflects the key elements of peak hour traffic congestion, and shows that 99% of late arrivals at customers can be eliminated if traffic congestion is accounted for off-line.
Journal ArticleDOI
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
TL;DR: A discrete version of the bat algorithm to solve the well-known symmetric and asymmetric Traveling Salesman Problems and an improvement in the basic structure of the classic bat algorithm are proposed.
Journal ArticleDOI
Coordinated Logistics with a Truck and a Drone
John Gunnar Carlsson,Siyuan Song +1 more
TL;DR: It is demonstrated that the improvement in efficiency of a delivery system in which an unmanned aerial vehicle UAV provides service to customers while making return trips to a truck that is itself moving is proportional to the square root of the ratio of the speeds of the truck and the UAV.
Journal ArticleDOI
A parallel iterated tabu search heuristic for vehicle routing problems
TL;DR: This paper introduces a parallel iterated tabu search heuristic for solving four different routing problems: the classical vehicle routing problem (VRP), the periodicVRP, the multi-depot VRP, and the site-dependent VRP.
References
More filters
Journal ArticleDOI
A Lower Bound for the Split Delivery Vehicle Routing Problem
TL;DR: A feasible solution of the Split Delivery Vehicle Routing Problem (SDVRP) is defined, and it is shown that the convex hull of the associated incidence vectors is a polyhedron ( PSDVRP), whose dimension depends on whether a vehicle visiting a client must service, or not, at least one unit of the client demand.
Journal ArticleDOI
The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics
TL;DR: In this article, an algorithm that can tackle time dependent vehicle routing problems with hard or soft time windows without any alteration in its structure is presented, and experimental results indicate that average computational time increases proportionally to the number of customers squared.
Journal ArticleDOI
A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
Quan Lu,Maged Dessouky +1 more
TL;DR: A new insertion-based construction heuristic to solve the multi-vehicle pickup and delivery problem with time windows that does not only consider the classical incremental distance measure in the insertion evaluation criteria but also the cost of reducing the time window slack due to the insertion.
Journal ArticleDOI
Vehicle routing problem with simultaneous deliveries and pickups
TL;DR: An insertion-based procedure to generate good initial solutions and a heuristic based on the record-to-record travel, tabu lists, and route improvement procedures are proposed to resolve the vehicle routing problems with simultaneous deliveries and pickups.
Journal ArticleDOI
The split delivery vehicle scheduling problem with time windows and grid network distances
P. W. Frizzell,J. W. Giffin +1 more
TL;DR: A construction heuristic is developed which uses a look-ahead approach to solve the Split Delivery Vehicle Scheduling Problem with Time Windows, and two improvement heuristics are also described.