Large-Scale and Big Data Optimization

大规模、大数据优化

• 批准号: RGPIN-2017-06715
• 负责人: Jaumard, Brigitte
• 金额: $ 2.99万
• 依托单位: Concordia University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2022
• 资助国家: 加拿大
• 起止时间: 2022-01-01 至 2023-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=750111
• 关键词: Large; Scale; Big; Data; Optimization

In today's digital world, with ever increasing amounts of data comes the need to solve optimization problems of unprecedented sizes. Machine learning, communication and social networks, logistics systems are some of the many prominent application domains where optimization problems arise with tens of thousands or millions of variables. Many optimization models and algorithms, while exhibiting great efficiency in modest dimensions, have great difficulties to scale for instances of this size and do not offer satisfactory solution. The primary and long-term objective of my research is to contribute to the design of novel optimization algorithms capable of working in very large-scale setting. I plan to investigate both exact and heuristic methods, and validate the findings on some particular applications in communication, logistics and social networks.For exact methods, the objective is to integrate knowledge based on both theoretical and empirical evidence from several disciplines, and explore the "what, why, how, and do" paradigm with an emphasis on (i) modelling aspects, (ii) combination of mathematical models, and (iii) parallelization techniques in order to take advantage of the heterogeneous environments combining multi-core processors, multi-threaded programming and GPU accelerators for very large scale optimization. While those environment were only available on mainframe computers, they are now available to computers that are easily accessible to the industry. For heuristic methods, focus will be on meta-heuristics, a wide class of solution methods that have been successfully applied to many optimization problems. However, they seem to have reached their limits to solve very large combinatorial problems such as those arising in cross-docking or network optimization. This is because meta-heuristics explore the solution space with ad-hoc methods, whose efficiency and computing time highly depend on the topology of the local optima which, except for some very particular problems, are very difficult to foresee. We plan to replace the ad-hoc exploration of the solution space with an informed exploration guided by machine learning. Comparison will be made with direct machine learning algorithms on practical problems arising in: (i) supply chain management and in particular with cross-docking, and (ii) network optimization and (iii) mechanism design in social networks. Data required by machine learning algorithms will be provided by ClearD and Ciena for the first two applications, and an organization/industrial partner needs to be identified for the third one.The results of my research will provide the industry (like ClearD and Ciena) information technology management tools for efficient and automated cross-docking/network management, not only to improve competitiveness but also to reduce energy consumption and therefore carbon footprint.

在当今的数字世界中，随着数据量的不断增加，需要解决前所未有的优化问题。机器学习、通信和社交网络、物流系统是许多突出的应用领域中的一些，在这些应用领域中，出现了数万或数百万个变量的优化问题。许多优化模型和算法，虽然表现出很大的效率，在适度的维度，有很大的困难，以规模为这种规模的实例，并没有提供令人满意的解决方案。我的研究的主要和长期目标是有助于设计能够在非常大规模的设置工作的新的优化算法。我计划研究精确和启发式方法，并在通信，物流和社交网络中的一些特定应用中验证研究结果。对于精确方法，目标是整合基于多个学科的理论和经验证据的知识，并探索“什么，为什么，如何和做”的范式，重点是（i）建模方面，（ii）数学模型的组合，以及（iii）并行化技术，以便利用结合多核处理器、多线程编程和GPU加速器的异构环境来进行非常大规模的优化。虽然这些环境仅在大型计算机上可用，但它们现在可用于业界易于访问的计算机。对于启发式方法，重点将放在元算法，已成功应用于许多优化问题的解决方法的广泛类别。然而，它们在解决非常大的组合问题（例如交叉对接或网络优化中出现的问题）方面似乎已经达到了极限。这是因为元算法是用自组织方法来探索解空间的，其效率和计算时间高度依赖于局部最优解的拓扑结构，而局部最优解除了一些非常特殊的问题外，是很难预测的。我们计划用机器学习指导下的知情探索来取代对解决方案空间的临时探索。将与直接机器学习算法进行比较，以解决以下实际问题：（i）供应链管理，特别是交叉对接，（ii）网络优化和（iii）社交网络中的机制设计。 机器学习算法所需的数据将由ClearD和Ciena为前两个应用程序提供，第三个应用程序需要确定一个组织/工业合作伙伴。我的研究结果将为行业提供（如ClearD和Ciena）信息技术管理工具，用于高效和自动化的交叉对接/网络管理，不仅要提高竞争力，还要减少能源消耗，从而减少碳足迹。