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
Posted Content
On the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking
TL;DR: This work is focused on the application of the recently proposed Multifactorial Cellular Genetic Algorithm (MFCGA) to the well-known Capacitated Vehicle Routing Problem (CVRP) family of problems.
Proceedings ArticleDOI
Solve Capacitated Vehicle Routing Problem Using Hybrid Chaotic Particle Swarm Optimization
Qi Shan,Jianchen Wang +1 more
TL;DR: A Hybrid Chaotic Particle Swarm Optimization (HCPSO) is proposed to solve Capacitated Vehicle Routing Problem (CVRP), where vehicles have capacity constraints and the algorithm is efficient and effective and the results are better than those of some recent papers.
Journal ArticleDOI
Mileage bands in freight transportation
TL;DR: A model of this problem is developed and then an algorithm for solving it that assists the shipper in constructing the lowest cost route, finding that most of these routes can be constructed to equal any mileage required to receive the lower rate.
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
TL;DR: Computer results indicate that the proposed genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows gives good results with a total tardiness equal to zero with a tolerable cost.
Journal ArticleDOI
Implementation of the Model Capacited Vehicle Routing Problem with Time Windows with a Goal Programming Approach in Determining the Best Route for Goods Distribution
TL;DR: This research discusses determination of the best route for the goods distribution from one depot to customers in various locations using the Capacitated Vehicle Routing Problem with Time of Windows (CVRPTW) model with a goal programming approach.
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.