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
Stochastic Vehicle Routing Problem: A Literature Survey
TL;DR: This paper is the first of its kind in the field of SVRP that develop a classification scheme for articles published since 1993 to enhances the development of this newly emerging discipline.
Journal ArticleDOI
A bi-objective vehicle routing problem with time windows: A real case in Tenerife
TL;DR: The solution provided by the method proposed in this paper improves the solution implemented by the company, and is motivated by a real problem posed to the authors by a company in Tenerife, Spain.
Journal ArticleDOI
The split delivery vehicle routing problem with three-dimensional loading constraints
Andreas Bortfeldt,Junmin Yi +1 more
TL;DR: The results prove that splitting deliveries can be beneficial not only in the one-dimensional case but also when goods are modeled as three-dimensional items.
Journal ArticleDOI
The multi-depot split-delivery vehicle routing problem: Model and solution algorithm
TL;DR: A centralized model and a heuristic algorithm for solving the multi-depot logistics delivery problem including depot selection and shared commodity delivery, namely: Multi-Depot Split-Delivery Vehicle Routing Problem (MDSDVRP) which allows establishing depot locations and routes for serving customer demands within the same objective function.
Journal ArticleDOI
Inventory Control in Divergent Supply Chains with Time-Based Dispatching and Shipment Consolidation
TL;DR: This article analyses a divergent supply chain consisting of a central warehouse and N nonidentical retailers and derivation of an exact recursive procedure for determining the expected inventory holding and backorder costs for the system, under the assumption of Poisson demand.
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.