??? ??????????? ?????? ????? ?????? ????????? ?? ???????????
Електронний архів Житомирського державного технологічного університету
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
??? ??????????? ?????? ????? ?????? ????????? ?? ???????????
About the mathematical models of class problems of postman and salesman |
|
| Creator |
???????, ?.?.
Morozov, A.V. |
|
| Subject |
??????????? ??????
?????? ??????????? ???????????? ?????? ??????????? ???????? ?????? ??????????? ?????? ??? ??????????? ????????? ?????? ??? ?????????? ????????? ???????????? ?? ???????? ?????? ??? ?????????? ????????? transportation network the Traveling Salesman Problem the Hamiltonian Traveling Salesman Problem the Vehicle Routing Problem the Chinese Postman Problem the Rural Postman Problem the Hamiltonian and Cyclic Rural Postman Problem |
|
| Description |
????????????? ???????????? ????? ????????????? ?????? ????????? ?? ???????????. ???????????? ??????????? ?? ????? ??????? ?????? ???????????? ??????, ? ???? ?????????? ????? ?????????? ???????? ?????????? ??????? ???????? ?????????, ?? ????????????? ??????? ?????????? ? ? ???????????? ? ????????? ???????? ????????. ????? ? ????????, ?? ??????? ????????? ????????? ??? ?????, ? ?????? ??????????? ?????????, ??? ??????????? ? ??? ????????, ???? ???????????? ????? ??????? ? ???????? ??? ? ?????? ?????? (????). ???? ????????? ??????? ? ????, ?? ????????? ??????? ????????????? ?????? ??????? ??????? ????????? ?????? ?? ??????? ???????????? ??????. ?, ??????, ????????, ??? ????????? ??????? ???????? ????? ??????? ??????? ? ?????? ???????? ????? ???? ???? ???. ? ?????? ?????????? ???? ??????, ?? ?????? ????????????? ??????????, ???????? ?????? ???????????, ???????????? ?????? ???????????, ?????? ??? ??????????? ?????????, ?????? ??? ?????????? ?????????, ???????? ?????? ???????????, ???????????? ?? ???????? ?????? ??? ?????????? ?????????. ? ?????? ?????? ? ??????????? ????? ????????????? ????????? ???? ?????? ???????????, ??? ???????? ??????? ???????? ?????? ?????????? ?????? ??? ????????? ??????? ??'?????. ???? ??? ?????? ?????? ????? ? ??????? ?????????? ? ???????? ???? H = (V, U) ? ???????? ?????? V ? ???????? ????? U. We propose a classification of problems of the Postman and Traveling Salesman. The classification is based on the description of the basic model of the transport network, which implies different productions of important practical problems of building routes that satisfy the given constraints and are optimal in the sense of the selected criteria. One of the limitations, substantially complicates the solution of these problems is the requirement of the closed route, which extends in the cases, when the vehicle starts and stops the movement of one point (the base). Another limitation is that the closed route of the vehicle must include certain items and portions of the transport network. And finally, you need to close the route passes through each designated portion, and each specified vertex exactly once. The article describes problems such as the Vehicle Routing Problem, classic Traveling Salesman Problem, the Hamiltonian Traveling Salesman Problem, the Chinese Postman Problem, the Rural Postman Problem, General Traveling Salesman Problem, Hamiltonian and Cyclic Rural Postman Problem. In the context of each of the considered problems of routing describes the communications network, which defines a number of possible ways of following one or more moving objects. Therefore, for each problem one of the inputs is a weighted graph with vertex set V and edge set U. |
|
| Date |
2016-03-18T09:18:21Z
2016-03-18T09:18:21Z 2015 |
|
| Type |
Article
|
|
| Identifier |
http://eztuir.ztu.edu.ua/123456789/2086
|
|
| Language |
uk
|
|
| Relation |
?????? ????. ?????: ???????? ?????;2(73)
|
|
| Publisher |
????
|
|