作者: Dražen Popović , Milorad Vidović , Gordana Radivojević
DOI: 10.1016/J.ESWA.2012.05.064
关键词:
摘要: In this paper we observe the extension of vehicle routing problem (VRP) in fuel delivery that includes petrol stations inventory management and which can be classified as Inventory Routing Problem (IRP) delivery. The objective IRP is to minimize total cost management. We developed a Variable Neighborhood Search (VNS) heuristic for solving multi-product multi-period with multi-compartment homogeneous vehicles, deterministic consumption varies each station type. stochastic VNS compared Mixed Integer Linear Programming (MILP) model ''compartment transfer'' (CT) heuristic. For three different scale problems, types, outperforms CT Also, smallest instances, was capable obtaining near optimal solutions (the MILP able solve only instances).