Discrete optimization

About: Discrete optimization is a research topic. Over the lifetime, 4598 publications have been published within this topic receiving 158297 citations. The topic is also known as: discrete optimisation.

Discrete Time Formulation for the Integration of Scheduling and Dynamic Optimization

Abstract: We propose a model-based optimization approach for the integration of production scheduling and dynamic process operation for general continuous/batch processes. The method introduces a discrete time formulation for simultaneous optimization of scheduling and operating decisions. The process is described by the resource task network (RTN) representation coupled with detailed first-principles process dynamic models. General complications in scheduling and control can be fully represented in this modeling framework, such as customer orders, transfer policies, and requirements on product quality and process safety. The scheduling and operation layers are linked with the task history state variables in the state space RTN model. A tailored generalized Benders decomposition (GBD) algorithm is applied to efficiently solve the resulting large nonconvex mixed-integer nonlinear program by exploring the particular model structure. We apply the integrated optimization approach to a polymerization process with two pa...

Community detection from biological and social networks

Abstract: Display Omitted We propose six metaheuristic optimization algorithms to solve the community detection (CD) problem.The proposed algorithms have been modified in order to use for solving modularity optimization problem which is a discrete optimization problem.The four algorithms (HDSA, BADE, SSGA and BB-BC) have been supported by new techniques or hybrid methods in addition to their original versions.Comparative analyses of the proposed algorithms are performed on the four biological and five social networks.According to acquired experimental results, it has been observed that HDSA is more efficient and competitive than the other algorithms. In order to analyze complex networks to find significant communities, several methods have been proposed in the literature. Modularity optimization is an interesting and valuable approach for detection of network communities in complex networks. Due to characteristics of the problem dealt with in this study, the exact solution methods consume much more time. Therefore, we propose six metaheuristic optimization algorithms, which each contain a modularity optimization approach. These algorithms are the original Bat Algorithm (BA), Gravitational Search Algorithm (GSA), modified Big Bang-Big Crunch algorithm (BB-BC), improved Bat Algorithm based on the Differential Evolutionary algorithm (BADE), effective Hyperheuristic Differential Search Algorithm (HDSA) and Scatter Search algorithm based on the Genetic Algorithm (SSGA). Four of these algorithms (HDSA, BADE, SSGA, BB-BC) contain new methods, whereas the remaining two algorithms (BA and GSA) use original methods. To clearly demonstrate the performance of the proposed algorithms when solving the problems, experimental studies were conducted using nine real-world complex networks - five of which are social networks and the rest of which are biological networks. The algorithms were compared in terms of statistical significance. According to the obtained test results, the HDSA proposed in this study is more efficient and competitive than the other algorithms that were tested.