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
A branch-and-price approach for the parallel drone scheduling vehicle routing problem
TL;DR: A heuristic version of the BAP algorithm significantly outperforms the arc-based formulation both in terms of solution quality and runtime for larger problems and a detailed study is performed to show the benefits of optimizing UAV speeds in reducing delivery makespan when UAV endurance is estimated using this power consumption model.
Journal ArticleDOI
Vehicle routing with cumulative objectives: A state of the art and analysis
TL;DR: In this paper , the authors present and discuss all related problem variants with regard to the different problem features proposed over time and provide an analysis of related algorithms concerning solution algorithms and used benchmark instances.
Journal ArticleDOI
Vehicle routing and the value of postponement
Gu Pang,Luc Muyldermans +1 more
TL;DR: This work compares the results by a CVRP local search procedure with those obtained from an analytical, Continuous Approximation model and finds that the differences grow larger when the CVRPs’ bin packing characteristics become more intricate.
Journal Article
Vehicle Routing Problem: Meta-heuristic Approaches
TL;DR: The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques.
A Learning Automata Based Algorithm For Solving Capacitated Vehicle Routing Problem
TL;DR: This paper presents an approximate algorithm based on distributed learning automata for solving capacitated vehicle routing problem and the results of comparison have shown the efficiency of the proposed algorithm.
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.