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
Proceedings ArticleDOI
Multi-robot persistent surveillance planning as a Vehicle Routing Problem
Ethan Stump,Nathan Michael +1 more
TL;DR: This work considers a persistent surveillance problem as one of finding sequences of visits to discrete sites in a periodic fashion, cast it as a Vehicle Routing Problem with Time Windows, and solves it using exact methods developed in the operations research community.
Journal ArticleDOI
Challenges in Managing Empty Container Movements at Multiple Planning Levels
TL;DR: In this article, the authors focus on the empty container management problem at a regional level and describe the decisions to be taken at each planning level (strategic, tactical and operational) and a detailed overview of planning models proposed in the literature is presented.
Journal ArticleDOI
Disruption management of the vehicle routing problem with vehicle breakdown
TL;DR: A new class of problem, the disrupted vehicle routing problem (VRP), which deals with the disruptions that occur at the execution stage of a VRP plan, and two Tabu Search algorithms are developed to solve the problem.
Journal ArticleDOI
Routing Optimization Under Uncertainty
TL;DR: A new decision criterion is proposed, called the Requirements Violation Index, which quantifies the risk associated with the violation of requirements taking into account both the frequency of violations and their magnitudes whenever they occur, and develops practically efficient algorithms to find the exact optimal routing solution in which the RV Index criterion is minimized.
Posted Content
Energy Efficient Ant Colony Algorithms for Data Aggregation in Wireless Sensor Networks
TL;DR: In this article, a family of ant colony algorithms called DAACA for data aggregation has been presented which contains three phases: the initialization, packet transmission and operations on pheromones.
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.