Tabu Search Algorithm for Vehicle Routing Problem with Time Windows

Ochelska-Mierzejewska, Joanna

doi:10.1007/978-3-030-34706-2_7

Cited by 3 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tabu search has been proven to be able to solve variants of vehicle routing problems, including inventory routing problems, with robust results [22], [33], [34]. Furthermore, the algorithm is also able to solve a stochastic problem [35], and additional time windows constraint [36], [37]. Hybridization of metaheuristics algorithm is not new, including using VND as part of Tabu Search for routing problems [38].…”

Section: Methodsmentioning

confidence: 99%

Tabu search heuristic for inventory routing problem with stochastic demand and time windows

Maghfiroh¹,

Redi²

2022

j. sist. manaj. ind.

View full text Add to dashboard Cite

This study proposes the hybridization of tabu search (TS) and variable neighbourhood descent (VND) for solving the Inventory Routing Problems with Stochastic Demand and Time Windows (IRPSDTW). Vendor Managed Inventory (VMI) is among the most used approaches for managing supply chains comprising multiple stakeholders, and implementing VMI require addressing the Inventory Routing Problem (IRP). Considering practical constraints related to demand uncertainty and time constraint, the proposed model combines multi-item replenishment schedules with unknown demand to arrange delivery paths, where the actual demand amount is only known upon arrival at a customer location with a time limit. The proposed method starts from the initial solution that considers the time windows and uses the TS method to solve the problem. As an extension, the VND is conducted to jump the solution from its local optimal. The results show that the proposed method can solve the IRPSDTW, especially for uniformly distributed customer locations.

show abstract