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
Capacitated Vehicle Routing in Graphic Metrics
Tobias Mömke,Hang Zhou +1 more
TL;DR: In this paper , the capacitated vehicle routing problem in graphic metrics (graphic CVRP) was studied and a new lower bound on the cost of an optimal solution was proposed.
Proceedings ArticleDOI
Efficient Task Allocation in Smart Warehouses with Multi-Delivery Stations and Heterogeneous Robots
TL;DR: This work presents a space decomposition-driven heuristic based on Voronoi Tessellation concepts to efficiently allocate tasks to robots in an environment with several constraints, and showed that the solution reduced route costs and time to fulfill orders up to 45% and 24%, respectively, compared to the state-of-the-art algorithm.
Journal ArticleDOI
Stochastic Multi-Objective Vehicle Routing Model in Green Environment With Customer Satisfaction
TL;DR: In this article , a hybrid search algorithm was proposed to solve the stochastic multi-objective vehicle routing problem in a green environment, where three objectives simultaneously were considered: economic, environmental, and social aspects.
Journal ArticleDOI
The Effect of Limited Resources in the Dynamic Vehicle Routing Problem with Mixed Backhauls
Georgios Ninikas,Ioannis Minis +1 more
TL;DR: Examination of the performance of the various objectives is impacted by different re-optimization frequencies and policies in this practically relevant environment of dynamic demand served by a limited fleet indicates that accounting for vehicle productivity within a typical periodic re- optimization solution framework may result to higher customer service under a range of operational settings, in comparison to conventional objectives.
Journal ArticleDOI
Hierarchical Planning for Heterogeneous Multi-Robot Routing Problems via Learned Subteam Performance
Jacopo Banfi,Andrew Messing,Christopher M. Kroninger,Ethan Stump,Seth Hutchinson,Nicholas Roy +5 more
TL;DR: A hierarchical planner is able to compute optimal or near-optimal solutions approximately 16 times faster than an optimal baseline that computes plans for all the possible allocations in advance to obtain precise routing times and a GNN-based estimator can provide an excellent trade-off between solution quality and computation time compared to other baseline (non-learned) estimators.
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.