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 multi-vehicle covering tour problem with speed optimization
TL;DR: This work develops an exact solution approach using a branch‐and‐price framework with a label‐correcting algorithm and a set of innovative dominance rules to solve the resulting pricing problem in the multi‐vehicle covering tour problem with speed optimization.
Journal ArticleDOI
DIMPL: a distributed in-memory drone flight path builder system
TL;DR: An automated flight plan builder DIMPL is presented that pre-builds flight plans for drones tasked with surveying a large area to take photographs of electric poles to identify ones with hazardous vegetation overgrowth and employs a distributed in-memory paradigm to process subregions in parallel and build flight paths in a highly efficient manner.
Proceedings ArticleDOI
An Adaptive Ant Colony optimization in Knowledge Graphs
Wei Li,Le Xia,Ying Huang +2 more
TL;DR: Experimental results show that this proposed AACO algorithm can accelerate the convergence speed and obtain better accuracy, and a global optimal solution can be achieved, which is suitable for solving combinatorial optimization problems.
Posted Content
An Evaluation of the Cross Entropy Method to Solve Vehicle Routing Problems
TL;DR: In this article, a cross entropy method (CEM) is applied to the vehicle routing problem (VRP) based on the statistical method of importance sampling for rare event simulation.
Proceedings ArticleDOI
An Experimental Study of Large-scale Capacitated Vehicle Routing Problems
TL;DR: It is discovered that SAHiD does not work as well as expected on large-scale CVRP, and two directions for improving SA HiD onLarge-scaleCVRP are pointed out.
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.