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
Book ChapterDOI
Spatial and objective decompositions for very large SCAPs
TL;DR: It is shown how to scale the SCAP algorithm proposed in [1] to a geographical area with up to 1,000 storage locations (over a million decision variables) and that spatial and objective decompositions are instrumental in solving SCAP problems at the state scale.
Dissertation
Optimisation for Large-scale Maintenance, Scheduling and Vehicle Routing Problems
TL;DR: In this article, the authors investigated models and algorithms to solve large scale Geographically Distributed asset Maintenance Problems (GDMP) and proposed a hyperheuristic method embedded with customised low-level heuristics.
Journal ArticleDOI
Efficiency Improvement for Multi Depot Vehicle Routing: A Case Study in Cash Distribution
TL;DR: The result shows that 11 vehicle can be reduced resulting in cost reduction in a total amount of US$195,097 annually.
Journal ArticleDOI
Scheduling combat logistics force replenishments at sea for the US Navy
TL;DR: The Replenishment at Sea Planner (RASP) as discussed by the authors uses integer linear optimization (ILO) and a purpose-built heuristic to solve the RASP problem.
Journal ArticleDOI
Path -constrained data gathering scheme for wireless sensor networks with mobile elements
TL;DR: This paper investigates the problem of designing the mobile element tour to visit subset of the nodes, termed as caching points, where the length of the mobileelement tour is bounded by pre-determined length, and presents heuristic-based solution.
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.