文章基本信息

标题：A Procedure for an Integrated Network and Vehicle Routing Optimisation Problem
本地全文：下载
作者：Antonio Polimeni ; Antonio Polimeni ; Antonino Vitetta 等
期刊名称：Procedia - Social and Behavioral Sciences
印刷版ISSN：1877-0428
出版年度：2012
卷号：54
页码：65-74
DOI：10.1016/j.sbspro.2012.09.726
语种：English
出版社：Elsevier
摘要：AbstractIn this paper, an integrated Network and Vehicle Routing Optimisation Problem (NVROP) for freight vehicles is proposed. The variables involved in the problem are discrete (link topology, routes for freight vehicles) and continuous (link capacity in term of signal settings). The discrete variables are related to the link direction, lane numbers, lane use and sequence of retailers reached by the vehicles. The continuous variables, assuming that the link capacity is a function of the characteristics of the final node in the link, are related to the regulations at the intersection. The NVROP is, hence, formulated as a mixed (discrete/continuous) problem in a congested network. A heuristic procedure is used both to find the best network configuration and the best vehicle route.
关键词：Network optimisation problem;vehicle routing problem;discrete/continuous variables;genetic algorithm