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
Book
Evolutionary optimization algorithms : biologically-Inspired and population-based approaches to computer intelligence
TL;DR: This paper presents a meta-anatomy of evolutionary algorithms and some examples of successful and unsuccessful attempts at optimization in the context of discrete-time programming.
Journal ArticleDOI
A Server-Assigned Spatial Crowdsourcing Framework
TL;DR: This article formally defines the maximum task assignment (MTA) problem in spatial crowdsourcing, and proposes alternative solutions to address these challenges by exploiting the spatial properties of the problem space, including the spatial distribution and the travel cost of the workers.
Journal ArticleDOI
Restricted dynamic programming
TL;DR: A new construction framework for solving VRPs that can handle a wide range of different types of VRPs, and competes with state of the art local search methods when more realistic constraints are considered than in classical VRPs.
Journal ArticleDOI
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
TL;DR: In this paper a tabu search algorithm is proposed and tested on several benchmark problems and it is shown that the proposed algorithm produces high quality solutions within an acceptable computation time.
Journal ArticleDOI
A Vehicle Routing Problem with Flexible Time Windows
TL;DR: This paper develops a solution procedure, in which feasible vehicle routes are constructed via a tabu search algorithm, and proposes a linear programming model to handle the detailed scheduling of customer visits for given routes.
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.