作者:
Xu, XianWang, YafengLuo, YaozhiZhejiang Univ
Dept Civil Engn A-725 Anzhong Bldg866 Yuhangtang Rd Hangzhou 310058 Zhejiang Peoples R China Zhejiang Univ
Dept Civil Engn A-818 Anzhong Bldg866 Yuhangtang Rd Hangzhou 310058 Zhejiang Peoples R China Zhejiang Univ
Dept Civil Engn A-821 Anzhong Bldg866 Yuhangtang Rd Hangzhou 310058 Zhejiang Peoples R China
An optimization approach based on force density method and mixed integer nonlinear programming is proposed for optimization of tensegrity structures on member connectivities and nodal positions. The member connectivit...
详细信息
An optimization approach based on force density method and mixed integer nonlinear programming is proposed for optimization of tensegrity structures on member connectivities and nodal positions. The member connectivities, nodal coordinates and force densities are simultaneously used as design variables and the number of nodes is the only necessary parameter needed to be given in advance, The proposed approach possesses a general-purpose formulation which can be degenerated into both conversional form-finding formulation and previous member connectivities-finding formulation. Various properties such as the number of cables, nodal coordinates and evenness of member internal forces can be controlled and optimized by introducing appropriate constraints and objective functions. Numerical examples are carried out to verify the proposed approach and illustrate that not only classical tensegrity systems but also novel tensegrity systems can be obtained by the proposed approach.
A new hybrid algorithm is being introduced for solving mixed integer nonlinear programming (MINLP) problems which arise from study of many real-life engineering problems such as the minimum cost development of oil fie...
详细信息
A new hybrid algorithm is being introduced for solving mixed integer nonlinear programming (MINLP) problems which arise from study of many real-life engineering problems such as the minimum cost development of oil fields and the optimization of a multiproduct batch plant. This new algorithm employs both the Genetic Algorithm and a modified grid search method interfacing in such a way that the resulting hybrid algorithm is capable of solving many MINLP problems efficiently and accurately. Testings indicate that this algorithm is efficient and robust even for some ill-conditioned problems with nonconvex constraints.
We present two new algorithms for convex mixed integer nonlinear programming (MINLP), both based on the well known Extended Cutting Plane (ECP) algorithm proposed by Weterlund and Petersson. Our first algorithm, Refin...
详细信息
We present two new algorithms for convex mixed integer nonlinear programming (MINLP), both based on the well known Extended Cutting Plane (ECP) algorithm proposed by Weterlund and Petersson. Our first algorithm, Refined Extended Cutting Plane (RECP), incorporates additional cuts to the MILP relaxation of the original problem, obtained by solving linear relaxations of NLP problems considered in the Outer Approximation algorithm. Our second algorithm, Linear programming based Branch-and-Bound (LP-BB), applies the strategy of generating cuts that is used in RECP, to the linear approximation scheme used by the LP/NLP based Branch-and-Bound algorithm. Our computational results show that RECP and LP-BB are highly competitive with the most popular MINLP algorithms from the literature, while keeping the nice and desirable characteristic of ECP, of being a first-order method.
We analyze a network design problem for a closed-loop supply chain that integrates the collection of the used products with the distribution of the new products. We present a mixedintegernonlinear facility location-...
详细信息
We analyze a network design problem for a closed-loop supply chain that integrates the collection of the used products with the distribution of the new products. We present a mixedintegernonlinear facility location-inventory-pricing model to decide on the optimal locations of the facilities, inventory amounts, prices for new products and incentive values for the collection of right amount of used products in order to maximize the total supply chain profit. We develop heuristics for the solution of this model and analyze the effectiveness of these heuristics and the effects of the parameters on this system through numerical experiments. (C) 2015 Elsevier Ltd. All rights reserved.
A local trajectory-based method for solving mixed integer nonlinear programming problems is proposed. The method is based on the trajectory-based method for continuous optimization problems. The method has three phase...
详细信息
A local trajectory-based method for solving mixed integer nonlinear programming problems is proposed. The method is based on the trajectory-based method for continuous optimization problems. The method has three phases, each of which performs continuous minimizations via the solution of systems of differential equations. A number of novel contributions, such as an adaptive step size strategy for numerical integration and a strategy for updating the penalty parameter, are introduced. We have shown that the optimal value obtained by the proposed method is at least as good as the minimizer predicted by a recent definition of a mixedinteger local minimizer. Computational results are presented, showing the effectiveness of the method.
In this paper, we present a new hybrid algorithm for convex mixed integer nonlinear programming (MINLP). The proposed hybrid algorithm is an improved version of the classical nonlinear branch-and-bound (BB) procedure,...
详细信息
In this paper, we present a new hybrid algorithm for convex mixed integer nonlinear programming (MINLP). The proposed hybrid algorithm is an improved version of the classical nonlinear branch-and-bound (BB) procedure, where the enhancements are obtained with the application of the outer approximation algorithm on some nodes of the enumeration tree. The two methods are combined in such a way that each one collaborates to the convergence of the other. Computational experiments with benchmark instances of the MINLP problem show the good performance of the proposed algorithm, which is compared to the outer approximation algorithm, the nonlinear BB algorithm and the hybrid algorithm implemented in the solver Bonmin.
In this paper, a nonlinear model to maximize biomass production with specific nutritional quality is proposed. The model decides about kind of grasses and legumes to cultivate, quantities of each grasses and legumes c...
详细信息
In this paper, a nonlinear model to maximize biomass production with specific nutritional quality is proposed. The model decides about kind of grasses and legumes to cultivate, quantities of each grasses and legumes chosen, the use of resources, and the proper time of harvest at which the biomass with specific nutritional quality is maximized. Model works with sufficient information about biomass yield, nutrient content, water requirements and fertilizer requirements of several crops, and it can explore all possible harvest times and choose the right time in which biomass production is maximized with desired nutritional quality. Furthermore, the solution gives to the producers additional information on weekly irrigation plan and weekly fertilizers plan for m(2) of cultivated grass. The model was tested on six scenarios using GAMS and obtained solutions are the global solution in each scenario.
Optimal exact designs are problematic to find and study because there is no unified theory for determining them and studying their properties. Each has its own challenges and when a method exists to confirm the design...
详细信息
Optimal exact designs are problematic to find and study because there is no unified theory for determining them and studying their properties. Each has its own challenges and when a method exists to confirm the design optimality, it is invariably applicable to the particular problem only. We propose a systematic approach to construct optimal exact designs by incorporating the Cholesky decomposition of the Fisher Information Matrix in a mixed integer nonlinear programming formulation. As examples, we apply the methodology to find D- and A-optimal exact designs for linear and nonlinear models using global or local optimizers. Our examples include design problems with constraints on the locations or the number of replicates at the optimal design points.
In this paper,the problem of aircraft conflict avoidance is studied arising in Air Traffic Management *** initial configuration of all aircraft including position,velocities,heading angles,altitude and flight trajecto...
详细信息
In this paper,the problem of aircraft conflict avoidance is studied arising in Air Traffic Management *** initial configuration of all aircraft including position,velocities,heading angles,altitude and flight trajectories are known,and they are assumed to fly within a shared three-dimensional *** aim of the problem is to find an optimal conflict avoidance strategy for the aircraft so that various conflicts situations can be avoided.A conflict occurs when the relative distance between any pairs of aircraft is less than the minimal safe separation during their *** order to ensure the safety of aircraft flight,a mixed integer nonlinear programming model(MINLP) for solving the three-dimensional conflict avoidance problem involving multiple aircrafts is proposed in this paper,where the aircraft are allowed to change simultaneously heading angle and velocity to achieve the *** illustration verifies the effectiveness of the *** optimal solution of the problem can be obtained easily in a small computational time by using a standard global optimization solver to solve the proposed MINLP model.
The manufacturing of different types of cylindrical parts requires loading of parts into baskets for heat treatment operation. This loading process is complex and involves issues relating to geometry, and heterogeneit...
详细信息
ISBN:
(纸本)9781479964109
The manufacturing of different types of cylindrical parts requires loading of parts into baskets for heat treatment operation. This loading process is complex and involves issues relating to geometry, and heterogeneity in the parts and in their processing requirements. The parts loaded for heat treatment often do not utilize the available capacity adequately because layer-loading is accomplished by operator ingenuity. Productivity in heat treatment operation can be increased by improving utilization, which is determined by the loading process. This paper describes the development mathematical model using mixedintegernonlinear formulation for loading of cylindrical parts into baskets. The mathematical modeling considers the exact location of parts to be loaded on the layers with the primary objective of minimizing unutilized volume of the baskets.
暂无评论