期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2014
卷号：3
期号：8
页码：2741-2744
出版社：Shri Pannalal Research Institute of Technolgy
摘要：The vehicle routing problem (VRP) is acombinatorial optimization problem to specify a homogeneousset of vehicles and routes, in which each vehicle starts from adepot and traverses along a route in order to serve a set ofcustomers with known geographical locations, and then finishits tour at the same depot. The objective is to find the minimumtotal travel cost (related to the travel times or distances) andoperational cost (related to the number of vehicles used). Inthis paper we present a variant of the VRP with time windowsgiven a set of avoiding paths and to find the minimum totaltravel cost. We use integer programming model to describe theproblem. A feasible neighbourhood approach is proposed tosolve the model.
关键词：Vehicle routing problem with time windows;avoiding path; integer programming; feasible neighbourhood;search
