Suscripción a Biblioteca: Guest
Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones
Journal of Automation and Information Sciences
SJR: 0.275 SNIP: 0.59 CiteScore™: 0.8

ISSN Imprimir: 1064-2315
ISSN En Línea: 2163-9337

Volumes:
Volumen 52, 2020 Volumen 51, 2019 Volumen 50, 2018 Volumen 49, 2017 Volumen 48, 2016 Volumen 47, 2015 Volumen 46, 2014 Volumen 45, 2013 Volumen 44, 2012 Volumen 43, 2011 Volumen 42, 2010 Volumen 41, 2009 Volumen 40, 2008 Volumen 39, 2007 Volumen 38, 2006 Volumen 37, 2005 Volumen 36, 2004 Volumen 35, 2003 Volumen 34, 2002 Volumen 33, 2001 Volumen 32, 2000 Volumen 31, 1999 Volumen 30, 1998 Volumen 29, 1997 Volumen 28, 1996

Journal of Automation and Information Sciences

DOI: 10.1615/JAutomatInfScien.v48.i2.30
pages 11-27

On the Question of Finding the Value of Routing Problem with Constraints

Alexander G. Chentsov
N.N. Krasovsky Institute of Mathematics and Mechanics Ural Branch of Russian Academy of Sciences Ural Federal University Ekaterinburg, Russia
Alexey A. Chentsov
N.N. Krasovsky Institute of Mathematics and Mechanics of Ural Branch of Russian Academy of Sciences, Ekaterinburg

SINOPSIS

The problem of sequential going around megapolises with the constraints of different types is considered. It is supposed that cost functions and "current" constraints can depend on the tasks list (the dependence on the list of fulfilled and vice versa yet nonfulfilled tasks is possible). An approach to determination of a global extremum (a problem value) on the basis of the widely interpreted dynamic programming is proposed. Owing to this approach, the storage-efficiency of computer is reached; this permits one to determine the extremum in the problem of the larger dimension and use it for heuristic algorithms testing. To construct the layers of the Bellman function, the shortened procedure, which enables one to decrease the computing complexity, is used (under the previous conditions, the construction of all the array of the Bellman function values is not expected).


Articles with similar content:

The Model of Nonlinear Filtration Optimal Control for the Problem of Areas Underflooding
Journal of Automation and Information Sciences, Vol.42, 2010, issue 8
Sergey A. Mitrokhin, Vitally V. Akimenko
ROBUST DFT-BASED SIGNAL PROCESSING FOR VEGETATION CLUTTER SUPPRESSION IN GROUND SURVEILLANCE DOPPLER RADARS
Telecommunications and Radio Engineering, Vol.70, 2011, issue 18
V. V. Lukin, A. V. Totsky, A. A. Roenko, J. T. Astola, I. Djurovic
An Approach Game Problem under the Failure of Controlling Devices
Journal of Automation and Information Sciences, Vol.32, 2000, issue 5
L. V. Baranovskaya, Alexey A. Chikriy, Arkadiy A. Chikriy
METHOD FOR BUILDING OF LOGICAL DATA TRANSFORM IN THE PROBLEM OF ESTABLISHING LINKS BETWEEN THE OBJECTS IN INTELLECTUAL TELECOMMUNICATION SYSTEMS
Telecommunications and Radio Engineering, Vol.75, 2016, issue 18
V. A. Gorokhovatskiy, G. G. Chetverikov, I. D. Vechirska
An Approach to Forming Optimal Design Structures on the Basis of the Ranking Method of Solving Nonlinear Boolean Equations
Journal of Automation and Information Sciences, Vol.43, 2011, issue 10
Sergey V. Minukhin, Sergey V. Listrovoy