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
Journal ArticleDOI
Multi-objective vehicle routing with automated negotiation
TL;DR: In this article , the authors investigated the scenario that multiple competing logistics companies aim to cooperate by delivering truck loads for one another, in order to improve efficiency and reduce the distance they drive, and presented a new heuristic algorithm that, given one set of orders for each company, tries to find the set of all truck load exchanges that are Pareto-optimal and individually rational.
Journal ArticleDOI
Application and evaluation of a cost apportionment approach for integrating tour planning aspects into applied location planning
TL;DR: In this paper, aspects of tour planning are included approximately into location planning for a distribution network, using a cost apportionment approach that can be used with little effort to solve problems involving up to 4,000 customers in acceptable computation time.
Sistem Routing Proses Delivery Menggunakan Simulated Annealing (Studi Kasus: PT. X)
TL;DR: This study discusses the creation of routing system and proposed business processes for the delivery company by applying the Asymmetric Capacitated Vehicle Routing Problem (ACVRP) using Simulated Annealing metaheuristic algorithm with a trade-off between the total distance and the maximum distance of one route.
Journal ArticleDOI
Individually Optimized Commercial Road Transport: A Decision Support System for Customizable Routing Problems
TL;DR: This work presents a customizable VRP for optimized road transportation embedded into a Decision Support System (DSS), which integrates various model attributes and handles a multitude of real-world routing problems and contributes to an enhanced economic and environmental sustainability in urban logistic applications.
Dissertation
Vehicle routing problems with resources synchronization
TL;DR: In this paper, the authors propose a method for the resolution of problemes de transport which integrent des contraintes temporelles considerant les fenetres de temps, the synchronisation des visites and l’equilibrage des services.
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.