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
An Adaptive Hybrid Quantum Algorithm for the Metric Traveling Salesman Problem
Fei Li,Arul Rhik Mazumder +1 more
TL;DR: In this paper , a hybrid quantum algorithm for the metric traveling salesman problem (TSP) is proposed, which combines the classic computers' power (large memory) and the quantum computers' parallelism (quantum parallelism) to fasten the hybrid algorithm's overall running time.
Posted Content
Approximation Algorithms for a Balanced Capacity and Distance Constrained Vehicle Routing Problem
TL;DR: An approximation algorithm is designed for the capacitated distance constraint vehicle routing problem for the standard approximation algorithm in the case that the tours are balanced.
Proceedings ArticleDOI
Simulated Annealing-based Energy Efficient Route Planning for Urban Service Robots
TL;DR: In this paper , a cost function considering energy consumption is optimized in order to improve the robot's global route planning, and the simulation results show an average overall reduction of 11 % energy consumption as compared to results from a nearest neighbour heuristic.
Journal ArticleDOI
A solution for the management of the passengers’ shuttle buses of the port Tanger MED Passagers
TL;DR: In this paper , a solution for managing the fleet of vehicles destined to servicing the passengers of the harbor station of the port Tanger MED Passagers is discussed. But this solution can be divided on two components: first, a linear program describing the current situation at the station using a variant of the vehicle routing problem with divisible pickups and deliveries, and then we have un package of web and mobile applications destined to improve the communication and data transfer between all users of the system, that is, the driver of the shuttle bus, the field operator and the operator of the control room.
Dissertation
Applications of Biased Randomization and Simheuristic Algorithms to Arc Routing and Facility Location Problems
TL;DR: The main goals of this thesis are to develop new algorithms based on the MIRHA framework for solving some combinatorial optimization problems that can be of interest in the telecommunication industry.
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.