文章基本信息

标题：Large-Scale Mixed Integer Programming model for Open Periodic Vehicle Routing Problem with Hard Time Windows
本地全文：下载
作者：Rustam Sinaga ; Herman Mawengkang
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2017
卷号：6
期号：10
页码：20313
DOI：10.15680/IJIRSET.2017.0610065
出版社：S&S Publications
摘要：Vehicle routing problem (VRP) model is a very useful tool in managing efficiently the distribution ofcommercial products. As the objective of the model is to find the best route and schedule of a fleet of vehicles such thatto satisfy customers demand. This paper considers a variant of VRP which is called open periodic vehicle routingproblem (OVPRP), in which the vehicles used are not required to come back to the distribution centre after deliveringperiodically customers demand. Due to the number of customers is large it is then necessary to impose a restricted timewindows for the vehicles whenever on duty to serve. The problem which is modelled as a mixed integer program issolved using a combined of heuristic and exact method.
关键词：Vehicle routing problem; Hard time windows; Modelling; Combined method.