Vehicle routing problem with time windows considering overtime and outsourcing vehicles

Authors:
Ilkyeong Moon;Jeong-Hun Lee;June Seong
Affiliations:
Department of Industrial Engineering, Pusan National University, Busan 609-735, South Korea;Postal & Logistics Technology Research Department, Electronics and Telecommunications Research Institute, Daejeon 305-700, South Korea;Overseas Business Planning Team, Sejong Industrial Co., Ltd., Ulsan 683-360, South Korea
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 15
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Towards a model and algorithm management system for vehicle routing and scheduling problems

Decision Support Systems
An overview of a heuristic for vehicle routing problem with time windows

Computers and Industrial Engineering
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

Computers and Operations Research
Vehicle routing problem with elementary shortest path based column generation

Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

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
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

Operations Research
Improving real-parameter genetic algorithm with simulated annealing for engineering problems

Advances in Engineering Software
Lagrangian duality applied to the vehicle routing problem with time windows

Computers and Operations Research
A self-adaptive local search algorithm for the classical vehicle routing problem

Expert Systems with Applications: An International Journal
Vehicle capacity planning system: a case study on vehicle routing problem with time windows

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	12.05

Visualization

Abstract

The vehicle routing problem with time windows (VRPTW) is an important problem in third-party logistics and supply chain management. We extend the VRPTW to the VRPTW with overtime and outsourcing vehicles (VRPTWOV), which allows overtime for drivers and the possibility of using outsourced vehicles. This problem can be applied to third-party logistics companies for managing central distributor-local distributors, local distributor-retailers (or customers), and manufacturers. We developed a mixed integer programming model, a genetic algorithm (GA), and a hybrid algorithm based on simulated annealing. The computational results demonstrate the efficiency of the developed algorithms. We also develop a decision support system for the VRPTWOV that is equipped with a vehicle route rescheduling function for realistic situations based on the GA.