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
A Unified Framework for Solving Multiagent Task Assignment Problems
TL;DR: This approach introduces several methods for problem decomposition and recomposition without significantly compromising solution quality, and shows methods to reduce the search space by several orders of magnitude allowing for improved search efficiency.
Journal ArticleDOI
Optimal Routing of Unmanned Aerial Vehicle for Joint Goods Delivery and in-Situ Sensing
TL;DR: In this paper , a new application of an unmanned aerial vehicle (UAV) to joint goods delivery and in-situ sensing, and a new algorithm that jointly optimizes the route and sensing task selection to minimize the UAV's energy consumption, maximize its sensing reward, and ensure timely goods delivery is proposed.
Journal ArticleDOI
A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation
TL;DR: In this paper , a mixed-integer linear programming (MILP) model and two heuristics are proposed to solve the bin packing problem with conflicts and item fragmentation.
Book ChapterDOI
Local Branching Relaxation Heuristics for Integer Linear Programs
TL;DR: In this paper , the authors focus on designing effective and efficient heuristics in LNS for integer linear programs (ILP) since a wide range of COPs can be represented as ILPs.
Journal ArticleDOI
Increasing User Trust in Optimisation through Feedback and Interaction
TL;DR: It is found that showing intermediate solutions can lead to over-trust while interactive exploration leads to more accurately calibrated trust, which is important in the case of optimisation.
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.