The underdetermined blind source separation problem is a common problem in our daily life, but it is difficult to solve because of its underdetermined. In the literature, sparse component analysis which exploits the s...
详细信息
ISBN:
(纸本)9789811023354;9789811023347
The underdetermined blind source separation problem is a common problem in our daily life, but it is difficult to solve because of its underdetermined. In the literature, sparse component analysis which exploits the sparsity of sources in a pre-defined sparse dictionary has been proposed to solve it. Usually, sparse component analysis uses a two-stage approach. The first stage is to estimate the mixing matrix and the second stage is to reconstruct sources. In fact, the second stage is a sparse optimization problem. In this paper, we model the problem of reconstructing sources as a bi-objective optimization problem. We take the error and sparsity as the two optimization objectives, and propose an iterative algorithm based on mixed integer programming to solve the bi-objective source reconstructing problem. Experimental results show the accuracy and effectiveness of our proposed algorithm.
BackgroundIn Brazil, institutional foodservices are required to meet the recommendations of the Workers? Food Program (WFP), a national public policy used to plan collective menus. The current study aimed to propose a...
详细信息
BackgroundIn Brazil, institutional foodservices are required to meet the recommendations of the Workers? Food Program (WFP), a national public policy used to plan collective menus. The current study aimed to propose a mathematical model to generate a one-month menu that meets the nutritional recommendations of the WFP, with low cost and good *** considered aspects related to the eating habits of the Brazilian population, spacing of repetitions between the dishes, texture combination, and monotonicity of colors of the dishes served. A mixed integer programming model was built to formulate daily menus for an institutional foodservice for one month. The menu consisted of a base dish, a base dish option, salads (2 options), a protein dish, a protein dish option, a side dish, and a *** model ensured compliance with the recommendations proposed by the WFP and the provision of healthy and nutritionally balanced meals. The menu generated met the recommendations of the WFP, with an average of 716.97 kcal/meal, including on average 58.28% carbohydrates, 17.89% proteins, and 24.88% total fats/*** model used can help in the menu elaboration dynamics of institutional foodservices, optimizing the work of the nutritionist in charge.
In this paper,a rescheduling problem involving annealing welding in a quartz glass factory is *** different mixed integer programming(MIP) formulations for the problem are presented first,and the NP-hardness of this r...
详细信息
ISBN:
(纸本)9781467397155
In this paper,a rescheduling problem involving annealing welding in a quartz glass factory is *** different mixed integer programming(MIP) formulations for the problem are presented first,and the NP-hardness of this rescheduling problem is *** the computational performance of two different MIP is ***,based on the comparison results,we discuss which MIP formulation might work better for the problem and propose the future work.
For the Department of Veterans Affairs (VA), traumatic brain injury (TBI) is a significant problem facing active duty military personnel, veterans, their families, and caregivers. The VA has designated TBI treatment a...
详细信息
In this paper, a rescheduling problem to insert new jobs into original schedule is studied. First, this rescheduling problem is reduced to the NP-hard problem. Then the rescheduling problem is formulated as two mixed ...
详细信息
ISBN:
(纸本)9781538635247
In this paper, a rescheduling problem to insert new jobs into original schedule is studied. First, this rescheduling problem is reduced to the NP-hard problem. Then the rescheduling problem is formulated as two mixed integer programming (MIP) formulations, and solved by using CPLEX. Further, the computational performance is showed and analysised for two proposed different MIP.
In this paper, an effective optimization method is proposed with the aim of minimizing the active part cost of wound core distribution transformers, taking into account constraints imposed both by international specif...
详细信息
In this paper, an effective optimization method is proposed with the aim of minimizing the active part cost of wound core distribution transformers, taking into account constraints imposed both by international specifications and customer needs. In order to achieve so, mixed integer programming in conjunction with the Branch and Bound technique are employed. The proposed methodology is compared with a heuristic optimization methodology of the transformer manufacturing industry and the results demonstrate the robustness and the superiority of this new approach.
Programmable Logic Controller (PLC) has been widely used in the industrial control. Inherently, the PLC-based system is a class of Hybrid Dynamical System (HDS) in which continuous state of the plant is controlled by ...
详细信息
Programmable Logic Controller (PLC) has been widely used in the industrial control. Inherently, the PLC-based system is a class of Hybrid Dynamical System (HDS) in which continuous state of the plant is controlled by the discrete logic-based controller. This paper firstly presents the formal algebraic model of the PLC-based control systems which enable the designer to formulate the various kinds of optimization problem. Secondly, the optimization problem of the 'sensor parameters,' such as the location of the limit switch in the material handling system, the threshold temperature of the thermostat in the temperature control system, is addressed. Finally, we formulate this problem as mixed Logical Dynamical Systems (MLDS) form which enables us to optimize the sensor parameters by applying the mixed integer programming.
Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taki...
详细信息
ISBN:
(纸本)9783319180083;9783319180076
Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel time. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. In order to solve the problems, we provide a pre-processing scheme as well as exact and approximate mixed integer programming (MIP) solutions. Our experimental results show the effectiveness of the MIP solutions and in particular point out that the approximate MIP approach often leads to near optimal results within far less computation time than the exact approach.
Sustainable manufacturing considers the economic, environmental and social dimensions as equally important. For any product, like the common bicycles, a holistic view on the different life cycle phases has to be taken...
详细信息
Sustainable manufacturing considers the economic, environmental and social dimensions as equally important. For any product, like the common bicycles, a holistic view on the different life cycle phases has to be taken in order to ensure that resources are utilised adequately. Preferences on the three dimensions might lead to different selections of materials, used equipment or required education for fulfilling the considered objectives. In a first approach, bicycle manufacturing alternatives are identified and modelled via bi-criteria mixed integer programming. The material usage is used to represent the economic dimension and the carbon dioxide equivalent is used to represent the environmental dimension. The computed supported efficient solutions provide reasonable trade-off solutions for the considered bicycle manufacturing problem. (C) 2015 The Authors. Published by Elsevier B.V.
This thesis presents a total of 3 groups of contributions related to multi-objective optimization. The first group includes the development of a new algorithm and an open-source user-friendly package for optimization ...
详细信息
This thesis presents a total of 3 groups of contributions related to multi-objective optimization. The first group includes the development of a new algorithm and an open-source user-friendly package for optimization over the efficient set for bi-objective mixedinteger linear programs. The second group includes an application of a special case of optimization over the efficient on conservation planning problems modeled with modern portfolio theory. Finally, the third group presents a machine learning framework to enhance criterion space search algorithms for multi-objective binary linear programming. In the first group of contributions, this thesis presents the first (criterion space search) algorithm for optimizing a linear function over the set of efficient solutions of bi-objective mixedinteger linear programs. The proposed algorithm is developed based on the triangle splitting method (Boland et al.), which can find a full representation of the nondominated frontier of any bi-objective mixedinteger linear program. The proposed algorithm is easy to understand and implement, and converges quickly to an optimal solution. An extensive computational study shows the efficacy of the algorithm. Is numerically shown in this thesis that the proposed algorithm can be used to quickly generate a provably high-quality approximate solution because it maintains a lower and an upper bound on the optimal value of the linear function at any point in time. Additionally, this thesis presents ***, a comprehensive julia package based on the proposed algorithm. The proposed package ex- tends the first implementation of the algorithm by adding two main features: (a) in addition to CPLEX, the package allows employing any single-objective solver supported by Math- ***, for example, GLPK, CPLEX, and SCIP; (b) the package supports execution on multiple processors and is compatible with the JuMP modeling language. An extensive computational study shows the efficacy of
暂无评论