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
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
TL;DR: Building on a nontrivial network representation, two mixed‐integer programming formulations for the VRPTT are proposed and five different branch‐and‐cut algorithms are developed and implemented.
Journal ArticleDOI
Solving the vehicle routing problem with multi-compartment vehicles for city logistics
TL;DR: This work proposes an enhanced adaptive large neighborhood search algorithm for the investigated routing problem with multi-compartment vehicles which are to operate from a single depot to visit customers within the chosen time period by minimizing major operational costs.
Journal ArticleDOI
A new formulation of the electric vehicle routing problem with time windows considering concave nonlinear charging function
TL;DR: New technical formulations were presented for vehicle route selection and charging station visit, which reduces the formulation complexity without using duplicated dummy nodes or arcs, and a new linearization method was developed that employs a set of secant lines to surrogate the concave nonlinear charging function with linear constraints.
Journal ArticleDOI
A review of fleet planning problems in single and multimodal transportation systems
TL;DR: Evaluation of the previous fleet planning researches enabled us to identify gaps in the literature and comment on the directions for future works which can lead to develop expert systems/decision support systems in the context of Logistics 4.0 for the integrated fleet planning problems with sustainability objectives under uncertain environments.
Book ChapterDOI
A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints
TL;DR: A simulated annealing algorithm SA is presented that incorporates several local search techniques to deal with a variant of the vehicle routing problem VRP in which a time window is associated with each customer service and some services require simultaneous visits from different vehicles to be accomplished.
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.