Relevant bibliographies by topics / MINLP Optimization

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'MINLP Optimization'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'MINLP Optimization.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "MINLP Optimization"

1

Belotti, Pietro, Christian Kirches, Sven Leyffer, Jeff Linderoth, James Luedtke, and Ashutosh Mahajan. "Mixed-integer nonlinear optimization." Acta Numerica 22 (April 2, 2013): 1–131. http://dx.doi.org/10.1017/s0962492913000032.

Full text
Abstract:
Many optimal decision problems in scientific, engineering, and public sector applications involve both discrete decisions and nonlinear system dynamics that affect the quality of the final design or plan. These decision problems lead to mixed-integer nonlinear programming (MINLP) problems that combine the combinatorial difficulty of optimizing over discrete variable sets with the challenges of handling nonlinear functions. We review models and applications of MINLP, and survey the state of the art in methods for solving this challenging class of problems.Most solution methods for MINLP apply some form of tree search. We distinguish two broad classes of methods: single-tree and multitree methods. We discuss these two classes of methods first in the case where the underlying problem functions are convex. Classical single-tree methods include nonlinear branch-and-bound and branch-and-cut methods, while classical multitree methods include outer approximation and Benders decomposition. The most efficient class of methods for convex MINLP are hybrid methods that combine the strengths of both classes of classical techniques.Non-convex MINLPs pose additional challenges, because they contain non-convex functions in the objective function or the constraints; hence even when the integer variables are relaxed to be continuous, the feasible region is generally non-convex, resulting in many local minima. We discuss a range of approaches for tackling this challenging class of problems, including piecewise linear approximations, generic strategies for obtaining convex relaxations for non-convex functions, spatial branch-and-bound methods, and a small sample of techniques that exploit particular types of non-convex structures to obtain improved convex relaxations.We finish our survey with a brief discussion of three important aspects of MINLP. First, we review heuristic techniques that can obtain good feasible solution in situations where the search-tree has grown too large or we require real-time solutions. Second, we describe an emerging area of mixed-integer optimal control that adds systems of ordinary differential equations to MINLP. Third, we survey the state of the art in software for MINLP.
APA, Harvard, Vancouver, ISO, and other styles
2

Klanšek, Uroš. "A COMPARISON BETWEEN MILP AND MINLP APPROACHES TO OPTIMAL SOLUTION OF NONLINEAR DISCRETE TRANSPORTATION PROBLEM." TRANSPORT 30, no. 2 (2014): 135–44. http://dx.doi.org/10.3846/16484142.2014.933361.

Full text
Abstract:
Finding an exact optimal solution of the Nonlinear Discrete Transportation Problem (NDTP) represents a challenging task in transportation science. Development of an adequate model formulation and selection of an appropriate optimization method are thus significant for attaining valuable solution of the NDTP. When nonlinearities appear within the criterion of optimization, the NDTP can be formulated directly as a Mixed-Integer Nonlinear Programming (MINLP) task or it can be linearized and converted into a Mixed-Integer Linear Programming (MILP) problem. This paper presents a comparison between MILP and MINLP approaches to exact optimal solution of the NDTP. The comparison is based on obtained results of experiments executed on a set of reference test problems. The paper discusses advantages and limitations of both optimization approaches.
APA, Harvard, Vancouver, ISO, and other styles
3

Silih, S., T. Zula, Z. Kravanja, and S. Kravanja. "MINLP Optimization of Mechanical Structures." American Journal of Applied Sciences 5, no. 1 (2008): 48–54. http://dx.doi.org/10.3844/ajassp.2008.48.54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Goyal, Vishal, and Marianthi G. Ierapetritou. "Stochastic MINLP optimization using simplicial approximation." Computers & Chemical Engineering 31, no. 9 (2007): 1081–87. http://dx.doi.org/10.1016/j.compchemeng.2006.09.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gangadwala, Jignesh, and Achim Kienle. "MINLP optimization of butyl acetate synthesis." Chemical Engineering and Processing: Process Intensification 46, no. 2 (2007): 107–18. http://dx.doi.org/10.1016/j.cep.2006.04.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Klanšek, Uroš. "SOLVING THE NONLINEAR DISCRETE TRANSPORTATION PROBLEM BY MINLP OPTIMIZATION." TRANSPORT 29, no. 1 (2013): 1–11. http://dx.doi.org/10.3846/16484142.2013.815134.

Full text
Abstract:
The Nonlinear Discrete Transportation Problem (NDTP) belongs to the class of the optimization problems that are generally difficult to solve. The selection of a suitable optimization method by which a specific NDTP can be appropriately solved is frequently a critical issue in obtaining valuable results. The aim of this paper is to present the suitability of five different Mixed-Integer Nonlinear Programming (MINLP) methods, specifically for the exact optimum solution of the NDTP. The evaluated MINLP methods include the extended cutting plane method, the branch and reduce method, the augmented penalty/outer-approximation/equality-relaxation method, the branch and cut method, and the simple branch and bound method. The MINLP methods were tested on a set of NDTPs from the literature. The gained solutions were compared and a correlative evaluation of the considered MINLP methods is shown to demonstrate their suitability for solving the NDTPs.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Miao, Yihui Wang, Shuai Su, Tao Tang, and Bin Ning. "A Short Turning Strategy for Train Scheduling Optimization in an Urban Rail Transit Line: The Case of Beijing Subway Line 4." Journal of Advanced Transportation 2018 (August 2, 2018): 1–19. http://dx.doi.org/10.1155/2018/5367295.

Full text
Abstract:
In urban rail transit systems, train scheduling plays an important role in improving the transport capacity to alleviate the urban traffic pressure of huge passenger demand and reducing the operation costs for operators. This paper considers the train scheduling with short turning strategy for an urban rail transit line with multiple depots. In addition, the utilization of trains is also taken into consideration. First, we develop a mixed integer nonlinear programming (MINLP) model for the train scheduling, where short turning train services and full-length train services are optimized based on the predefined headway obtained by the passenger demand analysis. The MINLP model is then transformed into a mixed integer linear programming (MILP) model according to several transformation properties. The resulting MILP problem can be solved efficiently by existing solvers, e.g., CPLEX. Two case studies with different scales are constructed to assess the performance of train schedules with the short turning strategy based on the data of Beijing Subway line 4. The simulation results show that the reduction of the utilization of trains is about 20.69%.
APA, Harvard, Vancouver, ISO, and other styles
8

Noronha, Santosh, Günter Gruhn, and Zdravko Kravanja. "Handling implicit model formulations in MINLP optimization." Computers & Chemical Engineering 21 (May 1997): S499—S504. http://dx.doi.org/10.1016/s0098-1354(97)87551-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Noronha, S. "Handling Implicit Model Formulations in MINLP Optimization." Computers & Chemical Engineering 21, no. 1-2 (1997): S499—S504. http://dx.doi.org/10.1016/s0098-1354(97)00098-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Žula, Tomaž, and Stojan Kravanja. "Minlp optimization of a cantilever roof structure." International Journal of Computational Methods and Experimental Measurements 7, no. 3 (2019): 236–45. http://dx.doi.org/10.2495/cmem-v7-n3-236-245.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "MINLP Optimization"

1

Ausen, Håvard. "A Study in MINLP-class Optimization Problems for Simulated Petroleum Production." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for teknisk kybernetikk, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-18435.

Full text
Abstract:
To aid in faster and better decision making it is interesting to couple advanced simulators with optimization tools.Most simulators however does not offer gradients, therefore derivative-free methods must be used. In this thesis optimization of and oil and gas field with free routing is considered. By embedding the structural information in the optimization problem and approximating the simulators by polynomials a MINLP problem is formed which can be solved by gradient based solvers. This approach requires that the polynomial models are updated frequently to fit the simulators. Each update requires several simulations and creates a trade-off between robustness and computation time. Different updating strategies for the models are considered in this thesis. By solving a separate optimization problem to update the models the MINLP problem can be formulated as a convex problem which is solved in a branch and bound framework and with an interior-point. Two approaches to updating the models in respect to the branch and bound method are explored, and it is found to be more robust to update the models for each node of the branch and bound tree, ensuring a local fit before branching.
APA, Harvard, Vancouver, ISO, and other styles
2

Humpola, Jesco [Verfasser], Martin [Akademischer Betreuer] Grötschel, Thorsten [Akademischer Betreuer] Koch, and Andrea [Akademischer Betreuer] Lodi. "Gas network optimization by MINLP / Jesco Humpola. Gutachter: Martin Grötschel ; Thorsten Koch ; Andrea Lodi. Betreuer: Martin Grötschel." Berlin : Technische Universität Berlin, 2014. http://d-nb.info/1067387625/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Boix, Marianne. "Optimisation multicritère de réseaux d'eau." Thesis, Toulouse, INPT, 2011. http://www.theses.fr/2011INPT0078/document.

Full text
Abstract:
Cette étude concerne l’optimisation multiobjectif de réseaux d’eau industriels via des techniques de programmation mathématique. Dans ce travail, un large éventail de cas est traité afin de proposer des solutions aux problèmes de réseaux les plus variés. Ainsi, les réseaux d’eau monopolluants sont abordés grâce à une programmation mathématique linéaire (MILP). Cette méthode est ensuite utilisée dans le cadre d’une prise en compte simultanée des réseaux d’eau et de chaleur. Lorsque le réseau fait intervenir plusieurs polluants, le problème doit être programmé de façon non linéaire (MINLP). L’optimisation multicritère de chaque réseau est basée sur la stratégie epsilon-contrainte développée à partir d’une méthode lexicographique. L’optimisation multiobjectif suivie d’une réflexion d’aide à la décision a permis d’améliorer les résultats antérieurs proposés dans la littérature de 2 à 10% en termes de consommation de coût et de 7 à 15% en ce qui concerne la dépense énergétique. Cette méthodologie est étendue à l’optimisation de parcs éco-industriels et permet ainsi d’opter pour une solution écologique et économique parmi un ensemble de configurations proposées<br>This study presents a multiobjective optimization of industrial water networks through mathematical programming procedures. A large range of various examples are processed to propose several feasible solutions. An industrial network is composed of fixed numbers of process units and regenerations and contaminants. These units are characterized by a priori defined values: maximal inlet and outlet contaminant concentrations. The aim is both to determine which water flows circulate between units and to allocate them while several objectives are optimized. Fresh water flow-rate (F1), regenerated water flow-rate (F2),interconnexions number (F3), energy consumption (F4) and the number of heat exchangers (F5) are all minimized. This multiobjective optimization is based upon the epsilon-constraint strategy, which is developed from a lexicographic method that leads to Pareto fronts. Monocontaminant networks are addressed with a mixed linear mathematical programming (Mixed Integer Linear Programming, MILP) model, using an original formulation based on partial water flow-rates. The obtained results we obtained are in good agreement with the literature data and lead to the validation of the method. The set of potential network solutions is provided in the form of a Pareto front. An innovative strategy based on the GEC (global equivalent cost) leads to the choice of one network among these solutions and turns out to be more efficient for choosing a good network according to a practical point of view. If the industrial network deals with several contaminants, the formulation changes from MILP into MINLP (Mixed Integer Non Linear Programming). Thanks to the same strategy used for the monocontaminant problem, the networks obtained are topologically simpler than literature data and have the advantage of not involving very low flow-rates. A MILP model is performed in order to optimize heat and water networks. Among several examples, a real case of a paper mill plant is studied. This work leads to a significant improvement of previous solutions between 2 to 10% and 7 to 15% for cost and energy consumptions respectively. The methodology is then extended to the optimization of eco-industrial parks. Several configurations are studied regarding the place of regeneration units in the symbiosis. The best network is obtained when the regeneration is owned by each industry of the park and allows again of about 13% for each company. Finally, when heat is combined to water in the network of the ecopark, a gain of 11% is obtained compared to the case where the companies are considered individually
APA, Harvard, Vancouver, ISO, and other styles
4

Carrero-Parreño, Alba. "Modeling and optimization of shale gas water management systems." Doctoral thesis, Universidad de Alicante, 2018. http://hdl.handle.net/10045/102228.

Full text
Abstract:
Shale gas has emerged as a potential resource to transform the global energy market. Nevertheless, gas extraction from tight shale formations is only possible after horizontal drilling and hydraulic fracturing, which generally demand large amounts of water. Part of the ejected fracturing fluid returns to the surface as flowback water, containing a variety of pollutants. Thus, water reuse and water recycling technologies have received further interest for enhancing overall shale gas process efficiency and sustainability. Thereby, the objectives of this thesis are: - Develop mathematical models to treat flowback and produced water at various salinities and flow rates, decreasing the high environmental impact due to the freshwater withdrawal and wastewater generated during shale gas production at minimum cost. - Develop mathematical programming models for planning shale gas water management through the first stage of the well's life to promote the reuse of flowback water by optimizing simultaneously all operations belonging several wellpads. Within the first objective, we developed medium size generalized disjunctive-programming (GDP) models reformulated as mixed integer non-linear programming problems (MINLPs). First, we focused on flowback water pretreatment and later, in wastewater desalination treatment. Particularly, an emergent desalination technology, Membrane Distillation, has been studied. All mathematical models have been implemented using GAMS® software. First, we introduce a new optimization model for wastewater from shale gas production including a superstructure with several water pretreatment alternatives. The mathematical model is formulated via GDP to minimize the total annualized cost. Hence, the superstructure developed allows identifying the optimal pretreatment sequence with minimum cost, according to inlet water composition and wastewater desired destination (i.e., water reuse as fracking fluid or desalination in thermal or membrane techonologies). As each destination requires specific composition constraints, three case studies illustrate the applicability of the proposed approach. Additionally, four distinct flowback water compositions are evaluated for the different target conditions. The results highlight the ability of the developed model for the cost-effective water pretreatment system synthesis, by reaching the required water compositions for each specified destination. Regarding desalination technologies, a rigorous optimization model with energy recovery for the synthesis of multistage direct contact membrane distillation (DCMD) system has been developed. The mathematical model is focused on maximizing the total amount of water recovered. The outflow brine is fixed close to salt saturation conditions (300 g·kg-1) approaching zero liquid discharge (ZLD). A sensitivity analysis is performed to evaluate the system’s behavior under different uncertainty sources such as the heat source availability and inlet salinity conditions. The results emphasize the applicability of this promising technology, especially with low steam cost or waste heat, and reveal variable costs and system configurations depending on inlet conditions. Within the second objective, large-scale multi-period water management problems, and collaborative water management models have been studied. Thus, to address water planning decisions in shale gas operations, in a first stage a new non-convex MINLP optimization model is presented that explicitly takes into account the effect of high concentration of total dissolved solids (TDS) and its temporal variations in the impaired water. The model comprises different water management strategies: direct reuse, treatment or send to Class II disposal wells. The objective is to maximize the “sustainability profit” to find a compromise solution among the three pillars of sustainability: economic, environmental and social criteria. The solution determines freshwater consumption, flowback destination, the fracturing schedule, fracturing fluid composition and the number of tanks leased at each time period. Because of the rigorous determination of TDS in all water streams, the model is a nonconvex MINLP model that is tackled in two steps: first, an MILP model is solved on the basis of McCormick relaxations for the bilinear terms; next, the binary variables that determine the fracturing schedule are fixed, and a smaller MINLP is solved. Finally, several case studies based on Marcellus Shale Play are optimized to illustrate the effectiveness of the proposed formulation. Later, a simplified version of the shale gas water management model developed in the previous work has been used to study possible cooperative strategies among companies. This model allows increasing benefits and reduces costs and environmental impacts of water management in shale gas production. If different companies are working in the same shale zone and their shale pads are relatively close (under 50 km), they might adopt a cooperative strategy, which can offer economic and environmental advantages. The objective is to compute a distribution of whatever quantifiable unit among the stakeholders to achieve a stable agreement on cooperation among them. To allocate the cost, profit and/or environmental impact among stakeholders, the Core and Shapley value are applied. Finally, the impact of cooperation among companies is shown by two examples involving three and eight players, respectively. The results show that adopting cooperative strategies in shale water management, companies are allowed to improve their benefits and to enhance the sustainability of their operations. The results obtained in this thesis should help to make cost-effective and environmentally-friendly water management decisions in the eventual development of shale gas wells.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhao, Qiao. "Conception and optimization of supercritical CO2 Brayton cycles for coal-fired power plant application." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0080/document.

Full text
Abstract:
L'amélioration des systèmes énergétiques est considérée comme un levier technologique pour répondre aux défis liés à la croissance de la demande d’électricité et des émissions des gaz à effet de serre. Les futures centrales devraient présenter une intégration thermique plus flexible et des sources de chaleur mixtes possibles. Une des solutions fiables consiste à utiliser un cycle de Brayton au CO2 supercritique (CO2-SC), un tel cycle à haut rendement est théoriquement prometteur pour les applications nucléaires, fossiles et solaires thermiques. Un des principaux obstacles au déploiement du cycle de Brayton au CO2-SC est de justifier sa faisabilité, sa viabilité et son potentiel à l’échelle industrielle. Dans ce contexte deux axes de recherche ont été identifiées : • Une sélection rigoureuse de l’équation d’état qui permet de représenter les propriétés d’intérêt du CO2-SC. • Une nouvelle méthodologie pour l’optimisation des centrales électriques, permettant de sélectionner automatiquement le procédé optimal parmi une grande quantité de configurations possibles (dénomme superstructure). Les résultats de la première partie de cette thèse mettent en lumière que l’équation de SW est pertinente pour limiter l’impact de l’imprécision de l’équation d’état sur le dimensionnement du procédé. Dans cette thèse, un simulateur de procédé commercial, ProSimPlus a été combiné avec un solveur type évolutionnaire (MIDACO) afin d’effectuer des optimisations superstructure. Premièrement, le critère d’optimisation est de maximiser le rendement énergétique du procédé. Dans un deuxième temps, on cherche simultanément à minimiser les coûts du procédé. Pour ce faire, des fonctions de coût internes à EDF ont été utilisées afin de permettre l’estimation des coûts d'investissement (CAPEX), des dépenses opérationnelles (OPEX) et du coût actualisé de l'électricité (LCOE)<br>Efficiency enhancement in power plant can be seen as a key lever in front of increasing energy demand. Nowadays, both the attention and the emphasis are directed to reliable alternatives, i.e., enhancing the energy conversion systems. The supercritical CO2 (SC-CO2) Brayton cycle has recently emerged as a promising solution for high efficiency power production in nuclear, fossil-thermal and solar-thermal applications. Currently, studies on such a thermodynamic power cycle are directed towards the demonstration of its reliability and viability before the possible building of an industrial-scale unit. The objectives of this PhD can be divided in two main parts: • A rigorous selection procedure of an equation of state (EoS) for SC-CO2 which permits to assess influences of thermodynamic model on the performance and design of a SC-CO2 Brayton cycle. • A framework of optimization-based synthesis of energy systems which enables optimizing both system structure and the process parameters. The performed investigations demonstrate that the Span-Wagner EoS is recommended for evaluating the performances of a SC-CO2 Brayton cycle in order to avoid inaccurate predictions in terms of equipment sizing and optimization. By combining a commercial process simulator and an evolutionary algorithm (MIDACO), this dissertation has identified a global feasible optimum design –or at least competitive solutions– for a given process superstructure under different industrial constraints. The carried out optimization firstly base on cycle energy aspects, but the decision making for practical systems necessitates techno-economic optimizations. The establishment of associated techno-economic cost functions in the last part of this dissertation enables to assess the levelized cost of electricity (LCOE). The carried out multi-objective optimization reflects the trade-off between economic and energy criteria, but also reveal the potential of this technology in economic performance
APA, Harvard, Vancouver, ISO, and other styles
6

Wei, Jing. "Systematic Design of Bulk Recycling Systems under Uncertainty." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4978.

Full text
Abstract:
The fast growing waste stream of electronic and other complex consumer products is making the bulk recycling problem an important environmental protection issue. These products must be recycled because they contain hazardous materials such as lead and mercury. The focus of this thesis is the development of systematic methods for designing systems to recover mixed plastics from electronic products such as computers and televisions. Bulk recycling systems are similar to other chemical engineering process systems. Therefore they can be synthesized and designed using some existing techniques that have been applied to distillation and reaction systems. However, the existence of various uncertainties from different sources, such as the variation of component fractions and product prices, makes it crucial to design a flexible and sustainable system, and is also a major challenge in this research. Another challenge is that plastics can be separated by different mechanisms based on different properties, but separating a mix of plastics often requires using a combination of different methods because they can have overlapping differentiating properties. Therefore many decisions are to be made including which methods to choose and how to connect them. To address the problem systematically, the design under uncertainty problem was formulated as a stochastic Mixed Integer Nonlinear Program (sMINLP). A Sample Average Approximation (SAA) method wrapped on the Outer Approximation method has been developed in this thesis to solve such problems efficiently. Therefore, large design under uncertainty problems can be solved without intractable computational difficulty. To allow making choices from separation methods by different mechanisms, this research modeled various plastics separation methods taking account of the distribution of particle properties and unified them using a canonical partition curve representation. Finally, an overall design method was proposed in this work to incorporate the design of size reduction units into the separation system. This research is the first formal development of a systematic method in this area to account for uncertainties and interactions between process steps.
APA, Harvard, Vancouver, ISO, and other styles
7

Cafieri, Sonia. "From local to global and back : a closed walk in mathematical programming and its applications." Habilitation à diriger des recherches, Université Paul Sabatier - Toulouse III, 2012. http://tel.archives-ouvertes.fr/tel-00979273.

Full text
Abstract:
Ce document propose un parcours de mes travaux de recherche en optimisation, en passant par l'optimisation mixte en variables entières, l'optimisation non-linéaire continue locale et le clustering dans les réseaux (graphes). Le premier chapitre traite de la programmation non linéaire mixte en variables entières et de l'optimisation globale déterministe. Il présente des contributions relatives à des investigations théoriques ainsi que des applications à des problèmes concrets. Nous discutons principalement de relaxations convexes et de reformulations automatiques de problèmes de programmation mathématique, dans le but d'améliorer l'efficacité des algorithmes de Branch-and-Bound. Dans le cadre de la programmation polynomiale, nous avons étudié des relaxations convexes pour les monômes multilinéaires et la génération de relaxations compactes de problèmes polynomiaux basés sur une technique spécifique de reformulation-linéarisation (RLT). Parmi les applications, une attention particulière est portée à des problèmes qui se posent dans la gestion du trafic aérien. Nous avons proposé de nouveaux modèles mathématiques et des approches de résolution basées d'une part sur l'optimisation mixte en variables entières et d'autre part sur le contrôle optimal. Deux thèmes de l'optimisation continue non-linéaire sont décrits au deuxième chapitre. Des méthodes de point intérieur pour la programmation quadratique et leurs noyaux d'algèbre linéaire (systèmes KKT) sont d'abord discutées. L'accent est mis sur les méthodes itératives pour les systèmes KKT et sur des questions connexes, telles que les techniques de préconditionnement et les propriétés de convergence. L'autre sujet discuté concerne, encore une fois, des problèmes de trafic aérien. Il porte sur les approches déjà mentionnées de contrôle optimal qui conduisent à des problèmes non-linéaires. Le troisième chapitre présente mes principaux résultats dans le domaine du clustering dans les réseaux. Le problème de l'identification de clusters dans les réseaux peut être formulé en utilisant la programmation mathématique et conduit généralement à un problème d'optimisation combinatoire. Mes contributions concernent les critères de classification et les méthodes de clustering correspondantes. Une attention particulière est portée aux méthodes exactes utilisées pour résoudre l'ensemble du problème d'optimisation ou, localement, les sous-problèmes survenant dans des heuristiques hiérarchiques, ou enfin dans le raffinement des solutions obtenues précédemment par d'autres méthodes.
APA, Harvard, Vancouver, ISO, and other styles
8

Gugenheim, Dan. "Modélisation et optimisation d’un réseau de transport de gaz." Phd thesis, Toulouse, INPT, 2011. http://oatao.univ-toulouse.fr/11760/1/gugenheim.pdf.

Full text
Abstract:
Durant ces 40 dernières années, le gaz naturel a vu son utilisation augmenter jusqu’à constituer aujourd’hui la troisième ressource énergétique mondiale. Il est alors devenu nécessaire de l’acheminer sur des distances de plus en plus longues entre les lieux d’extraction et de consommation. Ce transport peut s’effectuer à l’état liquide par des méthaniers ou à l’état gazeux par le biais des réseaux de transport de gaz naturel composés de canalisations de grandes dimensions, tant en diamètre qu’en longueur. Cette thèse porte sur la modélisation et l’optimisation de la configuration des réseaux de transport de gaz naturel et sur l’application au cas du réseau principal de transport français qui présente plusieurs particularités. En effet, il s’agit d’un réseau de grandes dimensions, fortement maillé pour lequel plusieurs sources d’approvisionnement sont possibles pour desservir divers points de consommation. Il possède en outre, des stations d’interconnexion entre les canalisations. GRTgaz en est le gestionnaire. Ce travail concerne l’étude de la faisabilité de configurer le réseau de transport pour un scénario d’approvisionnement et de consommation. Le coeur de cette thèse porte sur le développement d’un modèle de réseau de transport de gaz et sur la détermination des flux et des configurations des stations d’interconnexion dans ce réseau à l’aide d’outils d’optimisation. L’une des innovations est la description et la modélisation des stations d’interconnexion, carrefours incontournables du réseau. Deux modèles sont ainsi proposés, faisant intervenir une formulation d’une part mixte non linéaire en nombres entiers et d’autre part, non linéaire continue. Leur efficacité en fonction de différents solveurs d’optimisation est ensuite discutée. Le choix de la meilleure formulation du problème de transport de gaz naturel a été étudié sur un ensemble de réseaux fictifs, mais représentatifs du réseau français. La meilleure stratégie, basée sur l’utilisation combinée d’une ormulation non linéaire continue, du choix de la pression comme variable et d’une initialisation par un sous-problème a ensuite été appliquée sur des instances de taille réelle. Les difficultés du passage à des instances réelles ont ensuite été résolues à l’aide de deux améliorations: d’une part, la mise à l’échelle des variables a permis de mieux conditionner le problème, puis d’autre part, une suite de relaxations a été employée afin de résoudre tous les cas réels. Les solutions sont finalement validées à l’aide de solutions métiers existantes.
APA, Harvard, Vancouver, ISO, and other styles
9

Lamsali, Hendrik. "Selection of return channels and recovery options for used products." Thesis, Loughborough University, 2013. https://dspace.lboro.ac.uk/2134/13528.

Full text
Abstract:
Due to legal, economic and socio-environmental factors, reverse logistics practices and extended producer responsibility have developed into a necessity in many countries. The end results and expectations may differ, but the motivation remains the same. Two significant components in a reverse logistics system -product recovery options and return channels - are the focus of this thesis. The two main issues examined are allocation of the returned products to recovery options, and selection of the collection methods for product returns. The initial segment of this thesis involves the formulation of a linear programming model to determine the optimal allocation of returned products differing in quality to specific recovery options. This model paves the way for a study on the effects of flexibility on product recovery allocation. A computational example utilising experimental data was presented to demonstrate the viability of the proposed model. The results revealed that in comparison to a fixed match between product qualities and recovery options, the product recovery operation appeared to be more profitable with a flexible allocation. The second segment of this thesis addresses the methods employed for the initial collection of returned products. A mixed integer nonlinear programming model was developed to facilitate the selection of optimal collection methods for these products. This integrated model takes three different initial collection methods into consideration. The model is used to solve an illustrative example optimally. However, as the complexity of the issue renders this process ineffective in the face of larger problems, the Lagrangian relaxation method was proposed to generate feasible solutions within reasonable computational times. This method was put to the test and the results were found to be encouraging.
APA, Harvard, Vancouver, ISO, and other styles
10

Hannisdal, Erik Lundegaard. "Optimal Voltage Control of the Southern Norwegian Power Grid : Mixed Integer Nonlinear Programming (MINLP) for Control and Optimization of the High Voltage Southern Norwegian Power Grid." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for teknisk kybernetikk, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-13180.

Full text
Abstract:
This thesis contains the synthesis, analysis and simulation results of an automatic optimal voltage controller for the Southern Norwegian power grid. Currently the high voltage power grid is controlled manually by operators switching control components. The optimal controller handles the voltage control of the system, as well as keeping the number of control actions to a minimum.The system model is derived from power system analysis. Due to a highy nonlinear system model and integer decission variables in on/off control components, the controller is based on mixed integer nonlinear programming (MINLP). The MINLP uses BONMIN as a solver, and is implemented with the AMPL programming language.It was found that a MINLP controller is good choice for voltage control in transmission systems. The controller handles voltage limits, as well as reducing the number of control actions.The thesis also contains comparison between different solution methods for applying the optimal voltage controller, as well as other approaches to the automatic voltage control problem.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "MINLP Optimization"

1

Serrano, Felipe. "Intersection Cuts for Factorable MINLP." In Integer Programming and Combinatorial Optimization. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-17953-3_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kraemer, Korbinian, and Wolfgang Marquardt. "Continuous Reformulation of MINLP Problems." In Recent Advances in Optimization and its Applications in Engineering. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12598-0_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mockus, Jonas, William Eddy, Audris Mockus, Linas Mockus, and Gintaras Reklaitis. "Application of BHA to Mixed Integer Nonlinear Programming (MINLP)." In Nonconvex Optimization and Its Applications. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4757-2627-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Geißler, Björn, Antonio Morsi, and Lars Schewe. "A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization." In Facets of Combinatorial Optimization. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38189-8_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Goyal, Vishal, and Marianthi G. Ierapetritou. "MINLP Optimization Using Simplicial Approximation Method for Classes of Non-Convex Problems." In Nonconvex Optimization and Its Applications. Springer US, 2004. http://dx.doi.org/10.1007/978-1-4613-0251-3_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nannicini, Giacomo, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, and Andreas Wächter. "A Probing Algorithm for MINLP with Failure Prediction by SVM." In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21311-3_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Patil, Bhagyesh V., and P. S. V. Nataraj. "The Bernstein Branch-and-Bound Unconstrained Global Optimization Algorithm for MINLP Problems." In Scientific Computing, Computer Arithmetic, and Validated Numerics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31769-4_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Grossmann, Ignacio E., and Juan P. Ruiz. "Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization." In Mixed Integer Nonlinear Programming. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1927-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kallrath, Josef. "Beyond LP and MILP Problems ⊖." In Business Optimization Using Mathematical Programming. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-73237-0_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Floudas, Christodoulos A., Pãnos M. Pardalos, Claire S. Adjiman, et al. "Mixed-Integer Nonlinear Programming Problems (MINLPs)." In Nonconvex Optimization and Its Applications. Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-3040-1_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "MINLP Optimization"

1

Kravanja, S., and U. Klanšek. "MINLP optimization of steel frames." In HIGH PERFORMANCE STRUCTURES AND MATERIALS 2006. WIT Press, 2006. http://dx.doi.org/10.2495/hpsm06059.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Purushothaman, A. "MINLP Based Power Optimization for Pipelined ADC." In 2016 IEEE Computer Society Annual Symposium on VLSI (ISVLSI). IEEE, 2016. http://dx.doi.org/10.1109/isvlsi.2016.64.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kravanja, S., and T. Žula. "MINLP cost optimization of industrial steel building." In OPTI 2007. WIT Press, 2007. http://dx.doi.org/10.2495/op070111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kravanja, Stojan, and Tomaž Žula. "MINLP optimization of the underground lined rock cavern." In 1st International Conference on Technologies & Business Models for Circular Economy. Univerzitetna založba Univerze v Mariboru / University of Maribor Press, 2018. http://dx.doi.org/10.18690/978-961-286-211-4.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jian, Xu, and Liu Zhao. "An Improved Particle Swarm Optimization Algorithm for MINLP Problems." In 2009 WRI Global Congress on Intelligent Systems. IEEE, 2009. http://dx.doi.org/10.1109/gcis.2009.115.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Žula, T., U. Klanšek, and S. Kravanja. "MINLP optimization of the single-storey industrial building steel structure." In HIGH PERFORMANCE STRUCTURES AND MATERIALS 2006. WIT Press, 2006. http://dx.doi.org/10.2495/hpsm06063.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Powell, David, and Joel Hollingsworth. "A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP." In the 9th annual conference. ACM Press, 2007. http://dx.doi.org/10.1145/1276958.1277372.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Žula, T., and S. Kravanja. "The two-phase MINLP optimization of a single-storey industrial steel building." In HPSM 2008. WIT Press, 2008. http://dx.doi.org/10.2495/hpsm080451.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tiew, B. J., M. Shuhaimi, and H. Haslenda. "CO2 emissions reduction targeting for existing plant through heat exchanger network retrofit and fuel switching with MINLP." In 2011 Fourth International Conference on Modeling, Simulation and Applied Optimization (ICMSAO). IEEE, 2011. http://dx.doi.org/10.1109/icmsao.2011.5775614.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pandey, Vijitashwa, and Zissimos P. Mourelatos. "A Distributed Pool Architecture for Highly Constrained Optimization Problems in Complex Systems Design." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48620.

Full text
Abstract:
The design of complex systems design is challenging because of the presence of numerous design variables and constraints. Dynamic changes in design requirements and lack of complete knowledge of subsystem requirements add to the complexity. A recently proposed pool architecture has been shown to aide distributed solving of optimization problems. The approach not only saves solution time but also has other benefits like resiliency against failures of some processors. We apply this approach in this paper, to highly constrained design problems, with dynamically changing constraints, where finding a feasible solution is challenging. This task is distributed between the processors in the methodology we propose. We demonstrate the efficacy of our method using an MINLP-class of mechanical design optimization problem. We demonstrate the computational savings and the resistance to partial failures in the processors. In addition, we show how the optimization approach can adapt to dynamic changes in design constraints.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography