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
Proceedings ArticleDOI
Multi vehicle routing with nonholonomic constraints and dense dynamic obstacles
TL;DR: This paper provides an application-independent formulation of MVRP-DDO, as well as a concrete instantiation in a surface mining application, and proposes a multi-abstraction search approach to compute an executable plan for the drilling operations of several machines in a very constrained environment.
Journal ArticleDOI
Vehicle routing for a mid-day meal delivery distribution system.
TL;DR: This paper considers the distribution system of a school feeding program (mid-day meals), wherein a set of delivery vehicles transfer cooked food from a kitchen facility to various schools within a specified delivery deadline, and provides a formulation for the VRPCDD and suggests solution methods.
Heuristics for the Two-Echelon Vehicle Routing Problem: A Multi-Start Approach
TL;DR: In this paper, a family of Multi-Start heuristics based on separating the depot-to-satellite transfer and the satellite-tocustomer delivery by iteratively solving the two resulting routing subproblems, while adjusting the satellite workloads that link them, is proposed.
Proceedings ArticleDOI
Strategic dynamic vehicle routing with spatio-temporal dependent demands
TL;DR: An equilibrium in the limiting case where vehicles travel arbitrarily slower than the agent (heavy load) is characterized, and it is shown that such an equilibrium consists of a routing policy based on performing successive TSP tours through outstanding demands and a unique power-law spatial density centered at the depot location.
References
More filters
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
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.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
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.
Journal ArticleDOI
The vehicle routing problem: An overview of exact and approximate algorithms
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.
Journal ArticleDOI
Savings by Split Delivery Routing
Moshe Dror,Pierre Trudeau +1 more
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.
Journal ArticleDOI
Solving the pickup and delivery problem with time windows using reactive tabu search
William P Nanry,J. Wesley Barnes +1 more
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.