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
Electric Vehicle Traveling Salesman Problem with Drone
Te Zhu,Stephen D. Boyles +1 more
TL;DR: In this article , an arc-based mixed-integer programming model defined in a multigraph is presented for the problem and an iterative heuristic algorithm with different search strategies is also developed to solve instances with up to 25 customers.
Journal ArticleDOI
Hava kargo taşimaciliğinda uygulanan strateji̇leri̇n i̇ncelenmesi̇
TL;DR: Hava Kargo Tasimaciligi son 20 yilda yolcu tasimaciliigi ile birlikte buyuk gelisim gostermistir as mentioned in this paper.
Posted Content
On Tractability of Ulams Metric in Highier Dimensions and Dually Related Hierarchies of Problems.
Sebastian Bala,Andrzej Kozik +1 more
TL;DR: This paper defines and studies Ulam's metric in highier dimensions and defines two dually related hierarchies over encodings by k-tuples of permutations, and results concern hardness, approximability, and parametrized complexity inside the hierarchies.
Journal ArticleDOI
Discrete Salp Swarm Algorithm for Euclidean Travelling Salesman Problem
Karuna Panwar,Kusum Deep +1 more
Journal ArticleDOI
An Optimization of COVID-19 Vaccine Distribution in Canada Based on the VRP Model
TL;DR: In this paper , the optimization of the contributing factors, involving data analysis and applied mathematical models, focusing on a case study of the Ontario, Canada area, was explored, and the simulated results provided a general concept and indication for the administrators and regulators to design and achieve a suitable and fair distribution of vaccines.
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.