A simulation framework for real-time management and control of inventory routing decisions
Proceedings of the 38th conference on Winter simulation
A Decomposition Approach for the Inventory-Routing Problem
Transportation Science
Incentive Schemes for Attended Home Delivery Services
Transportation Science
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
Expert Systems with Applications: An International Journal
Vehicle Scheduling and Routing with Drivers' Working Hours
Transportation Science
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
The multi-shift vehicle routing problem with overtime
Computers and Operations Research
Computers and Operations Research
A column generation heuristic for the general vehicle routing problem
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Randomized Local Search for Real-Life Inventory Routing
Transportation Science
The biobjective inventory routing problem: problem solution and decision support
INOC'11 Proceedings of the 5th international conference on Network optimization
An insertion heuristic manpower scheduling for in-flight catering service application
ICCL'12 Proceedings of the Third international conference on Computational Logistics
Optimizing local pickup and delivery with uncertain loads
Proceedings of the Winter Simulation Conference
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules
Transportation Science
| Hi-index | 0.00 |
Insertion heuristics have proven to be popular methods for solving a variety of vehicle routing and scheduling problems. In this paper, we focus on the impact of incorporating complicating constraints on the efficiency of insertion heuristics. The basic insertion heuristic for the standard vehicle routing problem has a time complexity ofO( n 3 ). However, straightforward implementations of handling complicating constraints lead to an undesirable time complexity ofO( n 4 ). We demonstrate that with careful implementation it is possible, in most cases, to maintain theO( n 3 ) complexity or, in a few cases, increase the time complexity toO( n 3logn). The complicating constraints we consider in this paper are time windows, shift time limits, variable delivery quantities, fixed and variable delivery times, and multiple routes per vehicle. Little attention has been given to some of these complexities (with time windows being the notable exception), which are common in practice and have a significant impact on the feasibility of a schedule as well as the efficiency of insertion heuristics.