scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Vehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows

01 Jan 2013-Transportation Research Record (Transportation Research Board of the National Academies)-Vol. 2378, Iss: 2378, pp 120-128
TL;DR: 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...
Citations
More filters
Journal ArticleDOI
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.

415 citations


Cites background from "Vehicle Routing Problem: Simultaneo..."

  • ...It was only several years later, following the publication of the article by Christofides (1976), that the current name of the problem became widespread....

    [...]

Journal ArticleDOI
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.

326 citations


Cites background from "Vehicle Routing Problem: Simultaneo..."

  • ...Although there is a vast literature on the VRP with time-independent travel times (for an extensive overview, see Toth and Vigo (2002)), the literature on the TDVRP is scarce....

    [...]

  • ...Toth and Vigo [5]), the literature on the TDVRP is rather scarce....

    [...]

Journal ArticleDOI
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.

267 citations


Cites background from "Vehicle Routing Problem: Simultaneo..."

  • ...It is noteworthy that the most used and well-known routing problems are the Traveling Salesman Problem (TSP) ([Lawler et al.(1985)Lawler, Lenstra, Kan & Shmoys]), and the Vehicle Routing Problem (VRP) ([Christofides(1976)]), which are the focus of a ar X iv :1 60 4....

    [...]

Journal ArticleDOI
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.
Abstract: We determine the 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. In other words, a UAV picks up a package from the truck which continues on its route, and after delivering the package, the UAV returns to the truck to pick up the next package. Although the hardware for such systems already exists, the extent to which such an approach can actually provide a significantly improved quality of service is not yet understood. By combining a theoretical analysis in the Euclidean plane with real-time numerical simulations on a road network, we demonstrate that the improvement in efficiency is proportional to the square root of the ratio of the speeds of the truck and the UAV. The online supplement is available at https://doi.org/10.1287/mnsc.2017.2824 . This paper was accepted by Vishal Gaur, operations management.

236 citations


Cites background from "Vehicle Routing Problem: Simultaneo..."

  • ...Our problem can essentially be thought of as an intermodal instance of the Vehicle Routing Problem (VRP) [20, 41]....

    [...]

  • ...Because we seek to optimally coordinate two classes of vehicles that have diametrically opposing strengths and weaknesses, our problem is particularly related to instances of VRP in which vehicle heterogeneity plays an important role, such as [21]....

    [...]

Journal ArticleDOI
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.

215 citations

References
More filters
Journal ArticleDOI
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Abstract: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints. Given the intrinsic difficulty of this problem class, approximation methods seem to offer the most promise for practical size problems. After describing a variety of heuristics, we conduct an extensive computational study of their performance. The problem set includes routing and scheduling environments that differ in terms of the type of data used to generate the problems, the percentage of customers with time windows, their tightness and positioning, and the scheduling horizon. We found that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.

3,211 citations


"Vehicle Routing Problem: Simultaneo..." refers methods in this paper

  • ...Solomon’s test data are used for comparison of the algorithm with other solution algorithms (4)....

    [...]

  • ...The Solomon data sets (4) are widely used as a benchmark to compare a number of VRPs and their extensions (16, 23)....

    [...]

Journal ArticleDOI
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Abstract: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer. The first produces guaranteed optimal solution for problems involving no more than 13 cities; the time required (IBM 7094 II) varies from 60 milliseconds for a 9-city problem to 1.75 seconds for a 13-city problem. The second algorithm produces precisely characterized, locally optimal solutions for large problems (up to 145 cities) in an extremely short time and is based on a general heuristic approach believed to be of general applicability to various optimization problems. The average time required to obtain a locally optimal solution is under 30n3 microseconds where n is the number of cities involved. Repeated runs on a problem from random initial tours result in a high probability of finding the optimal solution among the locally optimal solutions obtained. For large problems where many locally optimal solutions have to be obtained in order to be reasonably assured of having the optimal solution, an efficient reduction scheme is incorporated in the program to reduce the total computation time by a substantial amount.

1,946 citations

Journal ArticleDOI
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.

1,737 citations


"Vehicle Routing Problem: Simultaneo..." refers background in this paper

  • ...It is well-known that the VRP is an NP-hard problem, and many studies have been conducted to tackle VRP in an efficient fashion (1, 5, 6)....

    [...]

Journal ArticleDOI
TL;DR: This paper examines a relaxed version of the generic vehicle routing problem, in which a delivery to a demand point can be split between any number of vehicles, and demonstrates the potential for cost savings through split deliveries.
Abstract: This paper examines a relaxed version of the generic vehicle routing problem. In this version, a delivery to a demand point can be split between any number of vehicles. In spite of this relaxation the problem remains computationally hard. The main contribution of this paper is in demonstrating the potential for cost savings through split deliveries. The solution scheme allowing for split deliveries is compared with a solution in which no split deliveries are allowed on a large set of 540 problems. Significant cost savings are realized both in terms of the total distance and the number of vehicles required. The vehicle routes constructed by our procedure, tend to cover cohesive geographical zones and retain some properties of optimal solutions.

402 citations


"Vehicle Routing Problem: Simultaneo..." refers background in this paper

  • ...For example, Dror and Trudeau (7) and Dror et al. (8) removed the second and third conditions in VRP and allowed each customer’s demand to be split and delivered by several vehicles....

    [...]

  • ...For example, Dror and Trudeau (7) and Dror et al....

    [...]

  • ...Dror, M., G. Laporte, and P. Trudeau....

    [...]

  • ...Dror, M., and P. Trudeau....

    [...]

Journal ArticleDOI
TL;DR: In this article, a reactive tabu search approach is proposed to solve the pickup and delivery problem with time windows using three distinct move neighborhoods that capitalize on the dominance of the precedence and coupling constraints.
Abstract: The pickup and delivery problem with time windows requires that a group of vehicles satisfy a collection of customer requests. Each customer request requires the use of a single vehicle both to load a specified amount of goods at one location and to deliver them to another location. All requests must be performed without violating either the vehicle capacity or the customer time window stipulated at each location. In this paper, we present a reactive tabu search approach to solve the pickup and delivery problem with time windows using three distinct move neighborhoods that capitalize on the dominance of the precedence and coupling constraints. A hierarchical search methodology is used to dynamically alternate between neighborhoods in order to negotiate different regions of the solution space and adjust search trajectories. In order to validate our technique's effectiveness, we have constructed a new set of benchmark problems for the pickup and delivery problem with time windows based on Solomon's benchmark vehicle routing problem with time windows data sets. Computational results substantiate the solution quality and efficiency of our reactive tabu search approach.

361 citations