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
AT-MFCGA: An Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking
TL;DR: A novel adaptive metaheuristic algorithm for dealing with Evolutionary Multitasking environments coined as Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm (AT-MFCGA), which relies on cellular automata to implement mechanisms for exchanging knowledge among the optimization problems under consideration.
Proceedings ArticleDOI
A honey bees mating optimization algorithm for the open vehicle routing problem
TL;DR: The proposed algorithm for the solution of the Open Vehicle Routing Problem, the Honey Bees Mating Optimization (HBMOOVRP), combines a Honey bees Matingoptimization algorithm and the Expanding Neighborhood Search (ENS) algorithm.
Journal ArticleDOI
Integrating forecasting in metaheuristic methods to solve dynamic routing problems: Evidence from the logistic processes of tuna vessels
TL;DR: The approach of this paper harnesses a simple prediction method to prove that integrating forecasting within a metaheuristic evolutionary-based method, such as genetic algorithms, can yield better results in a dynamic scenario than their simple non-predictive version.
Proceedings ArticleDOI
Iterative algorithm for lane reservation problem on transportation network
TL;DR: An integer linear program model is formulated for the considered problem and an optimal algorithm based on the cut-and-solve method is proposed that is much faster than a MIP solver of commercial software CPLEX 12.1 to find optimal solutions on average computing time.
A Methodology to Anticipate the Activity Level of Collaborative Networks: The Case of Urban Consolidation Centers
TL;DR: In this article, the authors present a methodology relative to the assessment of a particular measure in city logistics: Urban Consolidation Centers (UCCs), which they identify that this kind of collaborative network is, often, poorly evaluated and thus operates in a way that is neither sustainable nor efficient.
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.