78893

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

Connected and Autonomous Vehicle Scheduling Problems: Some Models and Algorithms

Электронная публикация: 

Да

ISBN/ISSN: 

1999-4893

DOI: 

10.3390/a17090421

Наименование источника: 

  • Algorithms

Обозначение и номер тома: 

Vol. 17, Is. 9

Город: 

  • Basel, Switzerland

Издательство: 

  • MDPI

Год издания: 

2024

Страницы: 

421; https://www.mdpi.com/1999-4893/17/9/421
Аннотация
In this paper, we consider some problems that arise in connected and autonomous vehicle (CAV) systems. Their simplified variants can be formulated as scheduling problems. Therefore, scheduling solution algorithms can be used as a part of solution algorithms for real-world problems. For four variants of such problems, mathematical models and solution algorithms are presented. In particular, three polynomial algorithms and a branch and bound algorithm are developed. These CAV scheduling problems are considered in the literature for the first time. More complicated NP-hard scheduling problems related to CAVs can be considered in the future.

Библиографическая ссылка: 

Гафаров Е.Р., Вернер Ф.. Connected and Autonomous Vehicle Scheduling Problems: Some Models and Algorithms // Algorithms. 2024. Vol. 17, Is. 9. С. 421; https://www.mdpi.com/1999-4893/17/9/421.