Open AccessBELLMAN – FORD METHOD FOR SOLVING THE OPTIMAL ROUTE PROBLEM / OPTIMALAUS MARŠRUTO NUSTATYMAS TAIKANT BELMANO IR FORDO METODĄ
Author(s) -
Laima Greičiūnė
Publication year - 2014
Publication title -
mokslas - lietuvos ateitis
Language(s) - English
Resource type - Journals
eISSN - 2029-2341
pISSN - 2029-2252
DOI - 10.3846/mla.2014.698
Subject(s) - visual basic for applications , computer science , dynamic programming , code (set theory) , mathematical optimization , programming language , algorithm , operations research , mathematics , set (abstract data type)
The article aims to adapt the dynamic programming method for optimal route determination using real-time data on ITS equipment. For this purpose, VBA code has been applied for solving the Bellman - Ford method for an optimal route considering optimality criteria for time, distance and the amount of emissions
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom