期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 39, 期 18, 页码 13390-13398出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2012.05.064
关键词
Variable Neighborhood Search (VNS); Inventory Routing Problem (IRP); Fuel delivery; Heuristics; Multi-compartment vehicles
类别
资金
- Ministry of Science and Technological Development of the Republic of Serbia [TR 36005, TR 36006]
In this paper we observe the extension of the vehicle routing problem (VRP) in fuel delivery that includes petrol stations inventory management and which can be classified as the Inventory Routing Problem (IRP) in fuel delivery. The objective of the IRP is to minimize the total cost of vehicle routing and inventory management. We developed a Variable Neighborhood Search (VNS) heuristic for solving a multi-product multi-period IRP in fuel delivery with multi-compartment homogeneous vehicles, and deterministic consumption that varies with each petrol station and each fuel type. The stochastic VNS heuristic is compared to a Mixed Integer Linear Programming (MILP) model and the deterministic compartment transfer (CT) heuristic. For three different scale problems, with different vehicle types, the developed VNS heuristic out-performs the deterministic CT heuristic. Also, for the smallest scale problem instances, the developed VNS was capable of obtaining the near optimal and optimal solutions (the MILP model was able to solve only the smallest scale problem instances). (C) 2012 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据