检索结果-内蒙古大学图书馆

7th World Congress on Intelligent Control and Automation

作者： Zhou, Xiaohui Chen, Chun Xue, Anke Tian, Minliang Zhejiang Univ Comp Sch Hangzhou 310012 Zhejiang Peoples R China HangZhou Dianzi Univ Inst Informat & Control Hangzhou 310018 Peoples R China

ISBN: (纸本)9781424421138

According to multiproduct/multipurpose batch and continuous processes scheduling, an overview of developments in the chemical processes scheduling is presented. Two scheduling methodologies based on time representation are introduced: one is discrete-time approaches the other is various continuous-time approaches, and the strengths and limitations of these approaches are examined. Also, important characteristics of chemical processes challenging to the scheduling problem are discussed, further research area and possible directions in the production scheduling problem are pointed out.

关键词： Process scheduling Discrete-time model Continuous-time model mixed-integer linear programming mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Co-evolutionary hybrid differential evolution for mixed-integer optimization problems

引用

ENGINEERING OPTIMIZATION 2001年第6期33卷 663-682页

作者： Lin, YC Hwang, KS Wang, FS Natl Chung Cheng Univ Dept Chem Engn Chiayi 621 Taiwan Natl Chung Cheng Univ Dept Elect Engn Chiayi 621 Taiwan

Evolutionary algorithms are promising candidates for obtaining the global optimum. Hybrid differential evolution is one of the evolutionary algorithms, which has been successfully applied to many real-world nonlinear programming problems. This paper proposes a co-evolutionary hybrid differential evolution to solve mixed-integer nonlinear programming (MIN-LP) problems. The key ingredients of the algorithm consist of an integer-valued variable evolution and a real-valued variable co-evolution, so that the algorithm can be used to solve MINLP problems or pure integer programming problems. Furthermore, the algorithm combines a local search heuristic (called acceleration) and a widespread search heuristic (called migration) to promote the search for a global optimum. Some numerical examples are tested to illustrate the performance of the proposed algorithm. Numerical examples show that the proposed algorithm converges to better solutions than the conventional MINLP optimization methods.

关键词： global optimization evolutionary algorithm mixed-integer nonlinear programming hybrid method

来源：评论

学校读者我要写书评

暂无评论

A nonlinear model for a capacitated random transportation network

引用

JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING 2015年第8期32卷 500-515页

作者： Shiripour, Saber Mahdavi-Amiri, Nezam Mahdavi, Iraj Mazandaran Univ Sci & Technol Dept Ind Engn Babol Sar Iran Sharif Univ Technol Fac Math Sci Tehran Iran

In this study, we consider a capacitated location-multi-allocation-routing problem with population-dependent random travel times. The objective is to find appropriate locations as server locations among the candidate locations, allocate the existing population in each demand node to server locations, and determine the movement path of each member to reach its corresponding server with respect to the simultaneous change of the random travel times so that the expected total transportation time is minimized. In our study, the concept of population-dependent random travel times incurs two issues: (1) consideration of some random factors in computing the travel times and (2) impact of the traveling population (presence of people or vehicles) on these random factors simultaneously. Here, three random factors of the time spent in traffic, the number of accidents, and the number of road failures are considered. Also, the capacities of server nodes for servicing the people or vehicles and the capacities of arcs to pass the people or vehicles are assumed to be limited. Defining a linear function for population-dependent random travel time, we formulate the problem as a mixed-integer nonlinear programming model. Also, to investigate the validation and behavior of the proposed random model, several network examples are provided and computational results are analyzed.

关键词： population-dependent random travel times multi-allocation Poisson distribution function mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Improving Mathematical Optimization Techniques with the Aid of Exergy-Based Variables

引用

INTERNATIONAL JOURNAL OF THERMODYNAMICS 2009年第2期12卷 75-82页

作者： Juedes, Marc Tsatsaronis, George Tech Univ Berlin Inst Energy Engn Marchstr 18 D-10587 Berlin Germany

The design optimization of energy conversion plants requires sophisticated optimization techniques. The usefulness of mathematical programming approaches has been discussed in several papers. Usually, the quality of the computed solutions, concerning global optimality and the convergence speed, is not discussed in these papers and even the existence of local optimal solutions is not mentioned. Indeed, the optimization of nonconvex mixed integer non-linear problems (MINLP), such as the structural and design optimization of power plants, is a very difficult problem. However, knowledge of the real optimization potential can assist the design engineer in better understanding the optimization procedure. This article deals with the use of exergetic variables for improving the quality of results obtained from mathematical optimization techniques and their convergence speed. LaGO, the solver used to compute the discussed results, can evaluate the obtained solution of the discussed minimization problems by calculating lower bounds of the original problem based on a relaxed convex objective function. Here, the use of exergetic variables can help to increase the lower bounds significantly and thus, to improve the evaluation of the computed solutions and the convergence speed. The method is applied to different optimization tasks.

关键词： Cost minimization design optimization cogeneration plant mixed-integer nonlinear programming exergy convergence speed

来源：评论

学校读者我要写书评

暂无评论

Synthesis of isothermal fluid-fluid two-phase CSTR networks

引用

COMPUTERS & CHEMICAL ENGINEERING 1998年第SUPPL.1期22卷 S671-S674页

作者： Esparta, ARJ Obertopp, T Gilles, ED Univ Stuttgart Inst Syst Dynam & Regelungstech D-70550 Stuttgart Germany

A systematic procedure is presented to synthesize isothermal two-phase continuous stirred tank reactor networks. The interaction of reaction and transport phenomena is modelled using the two-film theory and the optimal reactor network is selected from a superstructure by means of a MINLP solver. The proposed synthesis is applied to a pseudo-first order reaction and to the nitration of an aromatic compound. (C) 1998 Elsevier Science Ltd. All rights reserved.

关键词： design/synthesis of processes reactor network two-phase system film theory superstructure mixed-integer nonlinear programming aromatic nitration

来源：评论

学校读者我要写书评

暂无评论

Relaxation approaches for nonlinear sparse optimization problems

引用

OPTIMIZATION 2024年第10期73卷 3237-3258页

作者： Steffensen, Sonja Rhein Westfal TH Aachen Inst Geometrie & Prakt Math Aachen Germany

In many recent applications, sparse solutions of the optimization problems are favoured over non-sparse solutions with comparable objective values. A standard method to induce the sparsity of the solution is based on the use of the l(0) norm in the objective. However, if the underlying optimization problem is nonlinear, the solution of the nonlinear (sparse) l(0)optimization problem is difficult. Therefore, it is often approximated using the convex l(1)-norm although this can lead to suboptimal solutions for the sparsity of the solution. In this paper, we follow another direction. We present exact reformulations (with respect to the l(0) norm) and their relaxations leading to standard nonlinear but nonconvex programmes. Wediscuss and relate the relations between the different reformulations with repect to the original problem. We accompany our theoretical results by some numerical tests using randomly generated datasets.

关键词： Sparse optimization nonlinear programming complementarity constraints mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Cyclic Cleaning Scheduling of Industrial Boiler Based on Steepest Descent Approximate Linear programming

引用

IFAC Proceedings Volumes 2013年第13期46卷 478-483页

作者： Yan Zhaoyang Ma Xin Gao Dong Liu Pingping Zhang Beike College of Information Science and Technology Beijing University of Chemical Technology Beijing China

In this paper, the planning for the multi-period cleaning of an industrial boiler is formulated as a mixed-integer nonlinear program (MINLP). The objective function accounted for both the cost of fuel consumption and boiler cleaning & maintenance costs. And a subsection method was proposed for solving the MINLP problem using the steepest descent approximate linear programming (SDALP), which exhibits the advantages of the approximate linear programming (ALP) algorithm, such as easy implementation and convenient solution, and then introduces the principle of purposeful search and rapid convergence via the steepest descent method. This new method can eliminate the negative effect of the subjective step restriction and reduction coefficient, improve the convergence speed, and enhance the solution accuracy. The computation time for the method was proportional to the number of periods, and global solution of the MINLP was guaranteed. At last, the effectiveness of the proposed method was illustrated with an example.

关键词： cyclic cleaning of industrial boiler scheduling algorithm steepest descent approximate linear programming mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Using projected cutting planes in the extended cutting plane method

引用

OPTIMIZATION 2022年第14期71卷 4147-4176页

作者： Westerlund, Tapio Eronen, Ville-Pekka Makela, Marko M. Turku Univ Dept Math & Stat Turku Finland Abo Akad Univ Fac Sci & Engn Turku Finland

In this paper we show that simple projections can improve the algorithmic performance of cutting plane-based optimization methods. Projected cutting planes can, for example, be used as alternatives to standard cutting planes or supporting hyperplanes in the extended cutting plane (ECP) method. In the paper we analyse the properties of such an algorithm and prove that it will converge to a global optimum for smooth and nonsmooth convex mixed integer nonlinear programming problems. Additionally, we show that we are able to solve two old but very difficult facility layout problems (FLP), with previously unknown optimal solutions, to verified global optimum by using projected cutting planes in the algorithm. These solution results are also given in the paper.

关键词： Nonsmooth optimization mixed-integer nonlinear programming convex nonsmooth functions projected cutting planes

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Synthesis Of Heat Exchanger Network With Stream Split Based On Quantum-behaved Particle Swarm Optimization Algorithm 33

Simultaneous Synthesis Of Heat Exchanger Network With Stream...

引用

33rd Chinese Control Conference (CCC)

作者： Ye Zhen Cheng Qian Zhi Yuan Luo Na Zhao Liang E China Univ Sci & Technol Key Lab Adv Control & Optimizat Chem Proc Minist Educ Shanghai 200237 Peoples R China

ISBN: (纸本)9781479947249

Simultaneous synthesis problem of heat exchanger network is formulated as a mixed-integer nonlinear programming model. Limited by the Characteristic of the nonlinearity, the convexity and the discontinuity of the model, the classical optimization algorithms which is used to solving the model are easy to fall into local minima. Based on the superstructure model with non-isothermal mixing of split stream, a two-level approach combined with quantum-behaved particle swarm optimization (QPSO) algorithm is proposed to find the optimum structure with a minimum annual cost. In the upper level, QPSO is utilized to generate the structure of the network, while in the lower level, split-stream fractions and heat load of exchangers are optimized by QPSO. Benchmark problems are solved and results show that the two level quantum particle swarm algorithm effectively avoids falling into local minima and it is feasible and effective for heat exchanger network problems.

关键词： Heat Exchanger Network Synthesis Quantum-behaved Particle Swarm Optimization Algorithm mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Implementation of price-based demand response programs through a load pattern clustering process

Implementation of price-based demand response programs throu...

引用

MedPower 2014

作者： I.P. Panapakidis S.I. Frantza G.K. Papagiannis Aristotle University of Thessaloniki Thessaloniki GR

ISBN: (纸本)9781510814097

This study addresses the problem of the optimal design of price-based Demand Response (DR) programs such as Real-Time Pricing (RTP) utilizing the load profiling tool. The proposed model corresponds to a profit maximization problem of a retailer that serves a group of residential consumers. Through a clustering process the consumers are grouped together in several clusters. For each cluster a dynamic tariff is offered that is specially design to fit to the typical load pattern of the cluster. The sensitivity of the demand over the offered selling price is modeled through a price responsive demand function. Apart from implementing different demand functions, the flexibility of the proposed model offers a selection of different clustering algorithms and different retailer pricing policy.

关键词： Demand Response Load Profiling mixed-integer nonlinear programming Retailer Profit Maximization Demand-Responsive load pattern clustering process Clustering algorithms mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：