Large-Scale Combinatorial and Network Optimization

点击翻译按钮获取中文摘要

This research program is dedicated to the development of novel methods for solving large-scale combinatorial optimization problems, in particular those formulated in terms of networks. Such problems give rise to models that are difficult to solve, even using state-of-the-art optimization tools. Hence, we will develop specialized methods based on the latest advances in operations research. This research program aims to pursue and intensify the continued efforts of the applicant in developing methods for solving large-scale, difficult, combinatorial optimization problems. The long-term vision is driven by the objective of bridging the gaps between theory, methodology and algorithm implementation, thus leading to successful transfer and use of the proposed methods in real applications. In particular, the long-term goals of this research program are: 1) increase our capacity to solve large-scale combinatorial optimization problems; 2) expand the applicability of large-scale combinatorial optimization methods; 3) develop a unifying generic methodology to integrate supply optimization and demand analysis; 4) exploit knowledge to solve real applications. Our research on combinatorial optimization is driven by real applications, mostly in the area of logistics and transportation. These include applications of network design and facility location models in freight distribution and safety/security in transportation, as well as applications of staff scheduling in retail services, all of prime importance for the Canadian economy. Our ultimate goal is to provide practical solutions to end-users of these applications by developing advanced models and methods.