A Procedure for an Integrated Network and Vehicle Routing Optimisation Problem | Zendy

Antonio Polimeni | Zendy; Antonino Vitetta | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Procedure for an Integrated Network and Vehicle Routing Optimisation Problem

Author(s) -

Antonio Polimeni,

Antonino Vitetta

Publication year - 2012

Publication title -

procedia - social and behavioral sciences

Language(s) - English

Resource type - Journals

ISSN - 1877-0428

DOI - 10.1016/j.sbspro.2012.09.726

Subject(s) - intersection (aeronautics) , heuristic , node (physics) , link (geometry) , routing (electronic design automation) , vehicle routing problem , computer science , mathematical optimization , function (biology) , variable (mathematics) , topology (electrical circuits) , network planning and design , computer network , engineering , mathematics , transport engineering , mathematical analysis , electrical engineering , structural engineering , evolutionary biology , biology

In 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research