2013 | OriginalPaper | Buchkapitel
Stochastic Decentralized Routing of Unsplittable Vehicle Flows Using Constraint Optimization
verfasst von : Maksims Fiosins
Erschienen in: Distributed Computing and Artificial Intelligence
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by (Link öffnet in neuem Fenster)
A decentralized solution to the unsplittable flow problem (UFP) in a transport network is considered, where each flow uses only one route from source to sink and the flows cannot be separated into parts in intermediate nodes. The flow costs in each edge depend on the combination of the assigned flows as well as on external random variables. The distributions of the random variables are unknown, only samples are available. In order to use the information available in the samples more effectively, several resamples are constructed from the original samples. The nodes agree on the resamples in a decentralized way using a cooperative resampling scheme. A decentralized asynchronous solution algorithm for the flow routing problem in these conditions is proposed, which is based on the ADOPT algorithm for asynchronous distributed constraint optimization (DCOP). An example illustrating the proposed approach is presented.