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
2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics
TL;DR: In this article , the authors considered the 2-period balanced traveling salesman problem, where a salesman needs to visit a set of customers in two time periods, and the objective is to find tours for visiting the customers in the two periods with minimal total length.
Proceedings ArticleDOI
Mathematical Model for Traffic Optimization in Flexible Manufacturing Systems
TL;DR: A suggested complex of mathematical models for searching for the traffic structure in flexible manufacturing systems shows that the usage of the elaborated models allows increasing significantly the efficiency of the manufacturing systems.
Journal ArticleDOI
Balance of exploration and exploitation in artificial bee colony for multi products inventory routing problem
TL;DR: This paper proposed an enhanced ABC ( EABC ) algorithm for solving the multi products Inventory Routing Problem that improved the balance of the bee exploration and exploitation processes.
Journal ArticleDOI
Automated Delivery Robots: A Vehicle Routing Problem on last mile delivery cost per unit based on range and carrying capacity
TL;DR: In this paper , the authors developed a VRP to assess how the maximum driving range and the number of compartments of ADRs, impacts LMD costs per unit in urban areas, and found that fewer compartments or a lower range for the ADRs decrease LMD cost per unit.
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.