نتایج جستجو برای: minlp approach
تعداد نتایج: 1290414 فیلتر نتایج به سال:
This contribution presents a numerical evaluation of the impact of parallelization on the performance of an evolutionary algorithm for mixed-integer nonlinear programming (MINLP). On a set of 200 MINLP benchmarks the performance of the MIDACO solver is assessed with gradually increasing parallelization factor from one to three hundred. The results demonstrate that the efficiency of the algorith...
The Perspective Relaxation (PR) is a general approach for constructing tight approximations to Mixed-Integer NonLinear Problems with semicontinuous variables. The PR of a MINLP can be formulated either as a Mixed-Integer Second-Order Cone Program, provided that the original objective function is SOCP-representable, or as a Semi-Infinite MINLP. We show that under some further assumptions—rather ...
This study develops a mixed integer nonlinear programming (MINLP) model to design supply chains. In view of the limitations of many available strategic supply chain design models, this model involves three major supply chain stages, including procurement, production, and distribution, and their interactions; it takes into account bill of materials constraints for modeling complex supply chain i...
The Perspective Relaxation (PR) is a general approach for constructing tight approximations to MixedInteger NonLinear Problems with semicontinuous variables. The PR of a MINLP can be formulated either as a Mixed-Integer Second-Order Cone Program (provided that the original objective function is SOCPrepresentable), or as a Semi-Infinite MINLP. In this paper, we show that under some further assum...
We propose a method for solving mixed-integer nonlinear programs (MINLPs) to global optimality by discretization of occuring nonlinearities. The main idea is based on using piecewise linear functions to construct mixed-integer linear program (MIP) relaxations of the underlying MINLP. In order to find a global optimum of the given MINLP we develope an iterative algorithm which solves MIP relaxat...
Mixed Integer Nonlinear Programming (MINLP) problems present two main challenges: the integrality of a subset of variables and nonconvex (nonlinear) objective function and constraints. Many exact solvers for MINLP are branch-and-bound algorithms that compute a lower bound on the optimal solution using a linear programming relaxation of the original problem. In order to solve these problems to o...
This paper presents the mixed-integer nonlinear programming (MINLP) optimization model for the nonlinear discrete time–cost trade-off problem (NDTCTP). The nonlinear total project cost objective function of the proposed MINLP optimization model is subjected to a rigorous system of generalized precedence relationship constraints between project activities, project duration constraints, logical c...
We present a specialized branch-and-bound (b&b) algorithm for the Euclidean Steiner tree problem (ESTP) in R and apply it to a convex mixed-integer nonlinear programming (MINLP) formulation of the problem, presented by Fampa and Maculan. The algorithm contains procedures to avoid difficulties observed when applying a b&b algorithm for general MINLP problems to solve the ESTP. Our main emphasis ...
The global optimization of mixed integer non-linear programming (MINLP) problems is an active research area in many engineering fields. In this work, Differential Evolution (DE), a hybrid Evolutionary Computation method, is used for the optimization of nonconvex MINLP problems and a comparison is made among the algorithms based on hybrid of Simplex & Simulated Annealing (MSIMPSA), Genetic Algor...
This paper describes an analytic approach that can be used to evaluate and propose rehabilitation schedules based on economic, performance, and environmental considerations for various types of pavements managed by the Illinois State Tollway Authority. A mixed-integer nonlinear program (MINLP) is formulated to model the agency’s life-cycle cost and environmental impacts where the decision set c...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید