ライブラリ登録: Guest
Journal of Automation and Information Sciences

年間 12 号発行

ISSN 印刷: 1064-2315

ISSN オンライン: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

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

巻 48, 発行 2, 2016, pp. 11-27
DOI: 10.1615/JAutomatInfScien.v48.i2.30
Get accessGet access

要約

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).

によって引用された
  1. Chentsov Alexander G., Chentsov Pavel A., Petunin Alexander A., Sesekin Alexander N., Model of megalopolises in the tool path optimisation for CNC plate cutting machines, International Journal of Production Research, 56, 14, 2018. Crossref

Begell Digital Portal Begellデジタルライブラリー 電子書籍 ジャーナル 参考文献と会報 リサーチ集 価格及び購読のポリシー Begell House 連絡先 Language English 中文 Русский Português German French Spain