79730

Автор(ы): 

Автор(ов): 

4

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

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

Тезисы доклада

Название: 

The Multi-Stage Stochastic Orienteering Problem: heuristics

ISBN/ISSN: 

978-5-907366-77-0

Наименование конференции: 

  • 14th International Conference "Intelligent Data Processing" (Moscow, 2022)

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

  • Book of abstract of the 14th International Conference "Intelligent Data Processing" (Moscow, 2022)

Город: 

  • Moscow

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

  • Russian Academy of Sciences

Год издания: 

2022

Страницы: 

445-446
Аннотация
The time-window orientation problem under consideration belongs to the class of routing and scheduling problems arising from physical allocation. It considers a set of nodes (clients), each with associated profit and processing time (time window), and a set of edges, each characterized by a particular time. The goal of the problem is to construct an acyclic path starting at a given origin and ending at a given destination that maximizes total profit while meeting the time window constraints on all nodes and not exceeding a given time limit. The problem is classified as NP-hard, so an exact algorithm that executes in a reasonable time is unlikely to exist.

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

Барашов Е.Б., Лемтюжникова Д.В., Баттайя О.н., Садыков Р.Р. The Multi-Stage Stochastic Orienteering Problem: heuristics / Book of abstract of the 14th International Conference "Intelligent Data Processing" (Moscow, 2022). Moscow: Russian Academy of Sciences, 2022. С. 445-446.

Публикация имеет версию на другом языке или вышла в другом издании, например, в электронной (или онлайн) версии журнала: 

Да

Связь с публикацией: