Stochastic Decentralized Routing of Unsplittable Vehicle Flows Using Constraint Optimization
- 1.7k Downloads
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.
KeywordsChild Node Transport Network Constraint Optimization Local Cost Change Point Analysis
Unable to display preview. Download preview PDF.
- 3.Andronov, A., Fiosins, M.: Applications of resampling approach to statistical problems of logical systems. Acta et Comm. Univ. Tartuensis de Mathematica 8, 63–72 (2004)Google Scholar
- 4.Atlas, J., Decker, K.: Task scheduling using constraint optimization with uncertainty. In: Proc. of CAPS 2007, pp. 25–27 (2007)Google Scholar
- 7.Fiosins, M., Fiosina, J., Müller, J.P., Görmer, J.: Reconciling strategic and tactical decision making in agent-oriented simulation of vehicles in urban traffic. In: Proc. of the 4th Int. ICST Conf. Simulation Tools and Techniques, pp. 144–151. ACM Digital Library (2011)Google Scholar
- 8.Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press (1962)Google Scholar
- 11.Karakostas, G.: Faster approximation schemes for fractional multicommodity flow problems. ACM Trans. Algorithms 4(1), 13:1–13:17 (2008)Google Scholar
- 12.Léauté, T., Faltings, B.: E[DPOP]: Distributed Constraint Optimization under Stochastic Uncertainty using Collaborative Sampling. In: Proc. of the IJCAI 2009, pp. 87–101 (2009)Google Scholar
- 14.Ottens, B., Faltings, B.: Coordinating agent plans through distributed constraint optimization. In: Proc. of MASPLAN 2008 (2008)Google Scholar
- 15.Petcu, A., Faltings, B.: Dpop: A scalable method for multiagent constraint optimization. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence, pp. 266–271 (2005)Google Scholar