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
A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
TL;DR: A two-stage heuristic method integrating the initial heuristic algorithm and hybrid heuristic algorithms to study the VRPSPDP problem is proposed and it is indicated that the proposed algorithm is superior to these three algorithms for VRPS PDP in terms of total travel cost and average loading rate.
Journal ArticleDOI
Solving elementary shortest-path problems as mixed-integer programs
Michael Drexl,Stefan Irnich +1 more
TL;DR: This paper assesses the quality of the lower bounds provided by an integer relaxation of the multi-commodity flow formulation of the ESPP and shows that a formulation based on multi- commodity flows possesses a significantly stronger LP relaxation than a formulations based on arc flow variables.
Journal ArticleDOI
A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective
TL;DR: A form of discrete split deliveries was designed in which the customer demand can be split only by backpack and the corresponding adaptive tabu search algorithm was constructed, embedding the adaptive penalty mechanism and adopting the random neighborhood selection strategy and reinitialization principle.
Posted Content
A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem
TL;DR: In this paper, a multi-period inspector scheduling problem (MPISP) is introduced, where each inspector is scheduled to perform a route in a given multi-month planning horizon.
Proceedings ArticleDOI
Sociotechnical simulation and evolutionary algorithm optimization for routing siren vehicles in a water distribution contamination event
TL;DR: Development of crisis management routing strategies, which are a set of routes to best warn and protect consumers from exposure, is enabled through a new simulation-optimization framework and is demonstrated for an illustrative case study, a mid-sized virtual city, to identify efficient routes for protecting public health.
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.