[1] Hernan Abeledo, Michael Bussieck, Leon Lasdon, Alex Meeraus, and Hua Ni. Global optimization and the gams branch-and cut facility. CORS/INFORMS Joint International Workshop, Ban, May 2004. [2] Accenture. Accenture technology vision 2014 report. online http://www.accenture.com/ microsites/it-technology-trends-2014/Pages/tech-vision-report.aspx, 2014. [3] Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca G. Gianoli, and Brunilde Sanso. Energy management through optimized routing and device powering for greener communication networks. IEEE/ACM Transactions on Networking, 22(1):313325, Feb. 2014. [4] Charu C. Aggarwal, editor. Data Streams - Models and Algorithms, volume 31 of Advances in Database Systems. Springer, 2007. [5] Charu C Aggarwal and Philip S Yu. Online generation of association rules. In Proceedings of 14th International Conference on Data Engineering, pages 402411. IEEE, 1998. [6] Rakesh Agrawal, Tomasz Imieli«ski, and Arun Swami. Mining association rules between sets of items in large databases. SIGMOD Rec., 22(2):207216, Jun. 1993. [7] Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, VLDB '94, pages 487499, San Francisco, CA, USA, 1994. Morgan Kaufmann Pub lishers Inc. [8] R. Ahuja, J. Orlin, S. Pallottino, and M. Scutella. Dynamic shortest paths minimizing travel times and costs. In Networks, pages 197205, 2003. [9] Ehab S. Al-shaer. Programmable agents for active distributed monitoring.10th In IFIP/ IEEE International Workshop on Distributed Systems: Operations and Management (DSOM'99), 1999. [10] Mohamed Ziad Albari. A taxonomy of runtime software monitoring systems. http://www.informatik.uni-kiel.de/~wg/Lehre/Seminar-SS05/Mohamed_Ziad_ Albari/vortrag.pdf, 2005. Last accessed on November 1, 2016. [11] James P. Allen, Kevin P. Barry, John M. Mccormick, and Ross A. Paul. Plan execution monitoring with distributed intelligent agents for battle command. In Proceedings of SPIE, page 5441, 2004. [12] Alan Holliday Anthony Wren. Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly (1970-1977), 23(3):333344, 1972. [13] John K. Antonio, Garng M. Huang, and Wei K. Tsai. A fast distributed shortest path algorithm for a class of hierarchically clustered data networks. IEEE Transactions on Computers, 41(6):710724, Jun. 1992. [14] P. Anussornnitisarn, S. Nof, and O. Etzion. Decentralized control of cooperative and autonomous agents for solving the distributed resource allocation problem. International Jour nal of Production Economics, pages 114128, 2005. [15] Fujiang Ao, Jing Du, Yuejin Yan, Baohong Liu, and Kedi Huang. An ecient algorithm for IEEE 8th International Conference on mining closed frequent itemsets in data streams. In Computer and Information Technology (CIT) Workshops, pages 3742. IEEE, 2008. [16] C. Archetti and M. G. Speranza. Vehicle routing problems with split deliveries. International Transactions in Operational Research, 19(1-2):322, 2012. [17] Claudia Archetti and Maria Grazia Speranza. An overview on the split delivery vehicle routing problem. Operations Research Proceedings, pages 123127. Springer Berlin Heidelberg, 2007. [18] Claudia Archetti and MariaGrazia Speranza. The split delivery vehicle routing problem: A survey. In Bruce Golden, S. Raghavan, and Edward Wasil, editors, The Vehicle Routing Problem: Latest Advances and New Challenges, volume 43 of Operations Research/Computer Science Interfaces, pages 103122. Springer US, 2008. [19] A. Arsie and E. Frazzoli. Ecient routing of multiple vehicles with no explicit communications. International Journal of Robust and Nonlinear Control, 18(2):154164, Jan. 2007. [20] S. Arunapuram, K. Mathur, and D. Solow. Vehicle routing and scheduling with full truckloads. In Transportation Science, pages 170182, 2003. [21] P. Augerat, J.M. Belenguer, E. Benavent, A. Corberan, D. Naddef, and G. Rinaldi. Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical report, Universite Joseph Fourier, Grenoble, France, 1995. [22] Chen Avin and Carlos Brito. Ecient and robust query processing in dynamic environments using random walk techniques. In Proceedings of the 3rd international symposium on Infor mation processing in sensor networks, IPSN '04, pages 277286, New York, NY, USA, 2004. ACM. [23] A. Awasthi, S. Chauhan, Y. Lechevallier, M. Parent, and M. Proth. A data mining approach for adaptive path planning on large road networks. Foundations of Computational Intelligence: Data mining, Special Issue, Springer Publications, pages 297320, 2009. [24] B. Babcock and C. Olston. Distributed top-k monitoring. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 2839, 2003. [25] Dionysios