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

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

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 mult...

Full description

Bibliographic Details
Main Authors: Meilinda Fitriani Nur Maghfiroh, Anak Agung Ngurah Perwira Redi
Format: Article
Language:Indonesian
Published: Universitas Serang Raya 2022-11-01
Series:Jurnal Sistem dan Manajemen Industri
Subjects:
inventory routing problem
stochastic demand
time windows
tabu search
variable neighborhood descent
Online Access:https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/4813

Internet

https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/4813

Similar Items