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
Mean Payoff Optimization for Systems of Periodic Service and Maintenance
TL;DR: In this article , the authors consider the problem of finding a suitable schedule for the agent to maximize its long-run average payoff per time unit, and show that the problem is PSPACE-hard.
Proceedings ArticleDOI
An Overview of the Cash Transportation Problem
TL;DR: This paper is the first overview of the cash transportation problem addressed in the literature, and classifies these problems into two categories, mono-objective and multi-objectives problems.
Journal ArticleDOI
Achieving robustness in the capacitated vehicle routing problem with stochastic demands
TL;DR: In this article , a Mean-Variance (MV) model was proposed to solve the CVRPSD problem with stochastic demands and a hybrid sampling-based solution approach was developed.
Journal ArticleDOI
A Decision Model For Tackling Logistic Optimization Problem in Online Business Environment
TL;DR: This work studies the Pickup and Delivery Problem with Time Windows, where goods must be transported from one location to another, with taking into account certain time limits and vehicle capacity, and aims to minimize the number of vehicles used, as well as operational costs for all routes.
Journal ArticleDOI
Distributed Online Rollout for Multivehicle Routing in Unmapped Environments
TL;DR: In this paper , a distributed, online, and scalable reinforcement learning algorithm is proposed to solve the multivehicle routing problem, where agents self-organize into local clusters and independently apply a multiagent rollout scheme locally to each cluster.
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.