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 ChapterDOI
Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution Networks
TL;DR: In this article, the authors proposed a mathematical programming model to solve the problem of sustainable distribution in a smart city context, which takes into account traveling components, loading and other operative aspects, and environmental issues.
Journal Article
Stochastic Approach to Vehicle Routing Problem: Development and Theories
TL;DR: In this paper, a stochastic vehicle routing problem within the frame-wok of chance constrained programming where one or more parameters are assumed to be random variables with known distribution function is proposed.
Proceedings ArticleDOI
A decentralized heuristic for multi-depot split-delivery vehicle routing problem
TL;DR: A heuristic-based mechanism to solve multi-depot, multi-vehicle per depot routing problems in split-delivery setting and is suitable for decentralized implementation as long as the operating nodes cooperate on solving a common problem instance.
Proceedings Article
Parameterized Algorithms for MILPs with Small Treedepth
TL;DR: This paper shows an algorithm solving MILP in time, by carefully analyzing the inverses of invertible submatrices of the constraint matrix, and tracing the limiting boundary of the approach shows that naturally related classes of linear programs have vertices of unbounded fractionality.
Journal ArticleDOI
Efficient Insertion Heuristics for Multitrip Vehicle Routing Problem with Time Windows and Shift Time Limits
TL;DR: In this article, a modified efficient insertion heuristic that allows multiple trips per vehicle (MEIH-MT) and one that allows a single trip per vehicle with a postprocessing greedy heuristic to construct a multitrip solution are proposed to solve the multi-trip vehicle routing problem with time windows and shift time limits.
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.