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
Generalized orienteering problem with resource dependent rewards
Jesse Pietz,Johannes O. Royset +1 more
TL;DR: The smuggler search problem (SSP) is presented as an important real‐world application of the generalized OP and the algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances.
Journal ArticleDOI
Delivering meals for multiple suppliers: Exclusive or sharing logistics service
TL;DR: Managerial analysis shows that two sharing services generally yield much less total costs than the exclusive service, and develops two mainstream heuristics, iterated local search and adaptive large neighborhood search.
Journal ArticleDOI
Models for Minimizing Backhaul Costs Through Freight Collaboration
TL;DR: In this article, two optimization models were developed to route the carrier of interest's backhaul routes and select collaborative shipments to fulfill; one is formulated as an integer program, and the other was formulated as a mixed integer program.
Journal ArticleDOI
Branch-and-price and constraint programming for solving a real-life technician dispatching problem
TL;DR: A branch-and-price algorithm was developed, using a constraint branching strategy proposed by Ryan and Foster along with constraint programming in the column generation phase, to solve a real problem faced by a large company providing repair services of office machines in Santiago, Chile.
Journal ArticleDOI
Local search heuristics for the probabilistic dial-a-ride problem
Sin C. Ho,Dag Haugland +1 more
TL;DR: In this paper, the authors introduce the probabilistic dial-a-ride problem and describe an efficient request-relocation neighborhood evaluation procedure for the problem, which runs in time O(n^5 ) compared to O(mathcal{O}(n)) for a straightforward approach.
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.