Hybrid Heuristics for the Vehicle Routing Problem with Time Windows

Abstract

This paper addresses the development of effective heuristics for solving the vehicle routing and scheduling problem with time window constraints. Both tour construction and local search tour improvement heuristics are developed. A major premise of the paper is that embedding global tour improvement procedures within the tour construction process can lead to improved solutions. Computational results are reported on test problems from the literature as well as real world applications. The hybrid construction/improvement heuristic is more effective in reducing vehicle fleet size requirements than previously reported heuristics.

Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths

“…Popular route improvement methods include arc exchange and node exchange. The K-Opt arc exchange method proposed by [17] is one of the most commonly-used exchange method, which is based by [18][19][20][21][22].…”

The Case Study of Implementing the Delivery Optimization System at a Fast-Moving Consumer Goods Distributer

“…The default solver generates an initial solution by using Solomon's construction algorithm I1 [3,19]. Since each day can have different spatial and temporal characteristics, it can be reasonable to use a different parameter m which emphasises those characteristics.…”

Artificial Societies and Social Simulation Using Ant Colony, Particle Swarm Optimization and Cultural Algorithms

“…We associate a cost c ij and a time t ij with each arc (I,j)  A of the routing network. (Russell, 1995), we assume that all routes start just-in-time w k = 0, that is, we adjust the depot departure time of each vehicle t k = max(0, a i -t 0i ), i  N.…”