文章基本信息

标题：Persistent Visitation with Fuel Constraints
本地全文：下载
作者：Jonathan Las Fargeas ; Jonathan Las Fargeas ; Baro Hyun 等
期刊名称：Procedia - Social and Behavioral Sciences
印刷版ISSN：1877-0428
出版年度：2012
卷号：54
页码：1037-1046
DOI：10.1016/j.sbspro.2012.09.819
语种：English
出版社：Elsevier
摘要：AbstractThis work is motivated by the periodic vehicle routing problem (PVRP) where a vehicle is to perpetually visit customers within a given area. In this work there is no sense of horizon or days as in classic PVRP. Instead, it is assumed that each customer has a rate at which it must be visited for the vehicle to satisfy its mission. The vehicle's fuel limitations are taken into account and fuel depots with a fixed fuel price are included. The problem of finding paths that satisfy the locations’ revisit rates and minimize the total cost of fuel is treated. An algorithm that provides solutions to this problem under given constraints is presented.
关键词：Persistent visitation;Fuel constraints;Periodic vehicle routing problem