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
Efficient target visiting path planning for multiple vehicles with bounded curvature
TL;DR: This paper presents a heuristic that solves the k-Dubins Traveling Salesman Problem with Neighborhoods in two steps, based on classical techniques found in the literature, and employs a Memetic Algorithm to solve both combinatorial and continuous phases of the problem in a combined manner.
Journal ArticleDOI
Ant Colony Optimization for Capacitated Vehicle Routing Problem
TL;DR: ACO with swap and 3-opt heuristic has the capability to tackle the Capacitated Vehicle Routing Problem with satisfactory solution quality and run time and is a viable alternative for solving the CVRP.
Dissertation
Early Childhood Educators' Perceptions of the use of documentation in emergent programs: issues, benefits, barriers and questions
TL;DR: The DRAM memory controller was simulated with different scheduling mechanisms in order to better understand the memory system bottlenecks and to investigate which scheduler provides the best compromise between characteristics, such as bandwidth, thread-fairness and energy consumption.
Journal ArticleDOI
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
Nicola Bianchessi,Stefan Irnich +1 more
TL;DR: A new and tailored branch-and-cut algorithm based on a new relaxed compact model, in which some integer solutions are infeasible to the SDVRPTW, able to prove optimality for several previously unsolved instances from the literature.
Journal ArticleDOI
A Methodology to Exploit Profit Allocation in Logistics Joint Distribution Network Optimization
TL;DR: An improved particle swarm optimization (PSO) algorithm is presented to tackle the model formulation by assigning distribution centers to distribution units, and a Shapley value model based on cooperative game theory is proposed to obtain the optimal profit allocation strategy among distribution centers from nonempty coalitions.
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.