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
Drone Routing Optimizer for Aerial Inspections of Energy and Railway Infrastructures
TL;DR: In this article , the authors proposed a method to find efficient system of systems configurations regarding drone range requirements and base locations to operate from for monitoring and inspection of extensive longitudinal infrastructures such as power lines, pipelines and railway tracks including overhead lines.
Journal ArticleDOI
Real-time passenger bus routing problems with preferences and tradeoffs
Model and solution approach for multi-period and multi-depot vehicle routing problem with flexibility in specifying the last depot of each route
Alireza Eydi,H Abdorahimi +1 more
TL;DR: A new linear integer programming for multi-depot vehicle routing problem with multiple consecutive periods is formulated such that there is no obligation for vehicle to return to the fist depot and the first and the last depot for each route, in each period are specified based on the customers of other periods.
Journal ArticleDOI
İç loji̇sti̇k si̇stemi̇nde malzeme tedari̇ği̇ i̇çi̇n geli̇şti̇ri̇lmi̇ş matemati̇ksel modelleme yaklaşimi: bi̇r uygulama
TL;DR: In this paper, the authors discuss the problem of malzeme tedarigi problem and propose a plan to solve it using gelistirilmistir, a formulation based on a model of a gelistira.
Proceedings ArticleDOI
CPSO-THCS: An Optimization Algorithm for Emergency Supply Delivery Routing Problem
TL;DR: A customized particle swarm optimization with a two-hierarchy construction strategy (CPSO-THCS) is proposed for simplifying the process of the construction of feasible solutions during the optimization of the emergency supply delivery service in a real-world situation.
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.