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 Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
TL;DR: In this paper, a tabu search algorithm for the vehicle routing problem with split deliveries is described, where a neighbor solution is obtained by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity.
Journal ArticleDOI
The vehicle routing problem with backhauls
TL;DR: An extensive computational analysis of several initial solution algorithms is presented, which identifies the tradeoffs between solution quality and computational requirements and concludes that the greedy procedure reduces the required number of trucks and increases the truck utilization.
Journal ArticleDOI
Vehicle routing with split deliveries
TL;DR: Computational results indicate that by using an appropriate combination of constraints, the gap between the lower and upper bounds at the root of the search tree can be reduced considerably.
Journal ArticleDOI
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
Sin C. Ho,Dag Haugland +1 more
TL;DR: This work proposes a solution method based on tabu search for solving the VRPTWSD without imposing any restrictions on the split delivery options and gives an analysis of experimental results on problems with 100 customers.
Journal ArticleDOI
The savings algorithm for the vehicle routing problem
TL;DR: Modifications of the savings method are presented which show less CPU time and reduced storage requirements, therefore, the Savings method can be implemented on microcomputers.