Teses / dissertações sobre o tema "Multistage optimization"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 37 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Multistage optimization".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.
Rosmarin, Jonathan. "An evolutionary approach to multistage portfolio optimization". Thesis, Imperial College London, 2007. http://hdl.handle.net/10044/1/7280.
Texto completo da fonteDunatunga, Manimelwadu Samson. "Optimization of multistage systems with nondifferentiable objective functions". Diss., The University of Arizona, 1990. http://hdl.handle.net/10150/185050.
Texto completo da fonteCuadrado, Guevara Marlyn Dayana. "Multistage scenario trees generation for renewable energy systems optimization". Doctoral thesis, Universitat Politècnica de Catalunya, 2020. http://hdl.handle.net/10803/670251.
Texto completo da fontea presencia de energías renovables en la optimización de sistemas energéticos hagenerado un alto nivel de incertidumbre en los datos, lo que ha llevado a la necesidad de aplicar técnicas de optimización estocástica para modelar problemas con estas características. El método empleado en esta tesis es programación estocástica multietapa (MSP, por sus siglas en inglés). La idea central de MSP es representar la incertidumbre (que en este caso es modelada mediante un proceso estocástico), mediante un árbol de escenarios. En esta tesis, desarrollamos una metodología que parte de una data histórica, la cual está disponible; generamos un conjunto de escenarios por cada variable aleatoria del modelo MSP; definimos escenarios individuales, que luego serán usados para construir el proceso estocástico inicial (como un fan o un árbol de escenario inicial); y, por último, construimos el árbol de escenario final, el cual es la aproximación del proceso estocástico. La metodología propuesta consta de dos fases. En la primera fase, desarrollamos un procedimiento similar a Muñoz et al. (2013), con la diferencia de que para las predicciones del próximo día para cada variable aleatoria del modelo MSP usamos modelos VAR. En la segunda fase construimos árboles de escenarios mediante el "Forward Tree Construction Algorithm (FTCA)", desarrollado por Heitsch and Römisch (2009a); y una versión adaptada del "Dynamic Tree Generation with a Flexible Bushiness Algorithm (DTGFBA)", desarrolado por Pflug and Pichler (2014, 2015). Esta metodología fue usada para generar árboles de escenarios para dos modelos MSP. El primer modelo fue el "Multistage Stochastic Wind Battery Virtual Power Plant model (modelo MSWBVPP)", y el segundo modelo es el "Multistage Stochastic Optimal Operation of Distribution Networks model (MSOODN model)". Para el modelo MSWBVPP desarrollamos extensivos experimentos computacionales y generamos árboles de escenarios a partir de datos realesde precios MIBEL y generación eólica de una granja eólica llamada Espina, ubicada en España. Para el modelo MSOODN obtuvimos árboles de escenarios basados en datos reales de carga, provistos por FEEC-UNICAMP y de generación fotovoltaica de una red de distribución localizada en Brasil. Los resultados muestran que la metodología de generación de árboles de escenarios propuesta en esta tesis, permite obtener árboles de escenarios adecuados para cada modelo MSP. Adicionalmente, obtuvimos resultados para los modelos MSP usando como datos de entrada los árboles de escenarios. En el caso del modelo MSWBVPP, resolvimos tres casos de estudio correspondiente a tres hipótesis basadas en la participación de una VPP en los mercados de energía. En el caso del modelo MSOODN, dos casos de prueba fueron resueltos, mostrando que la EDN satisface los límites impuestos para cada caso de prueba, y además, que el caso con BESS da mejores resultados cuando se toma en cuenta el valor la incertidumbre en el modelo. Finalmente, el modelo MSWBVPP fue usado para estudiar el desempeño relativo de los árboles de escenarios FTCA y DTGFBA, específicamente, analizando el valor de la solución estocástica para los 366 problemas de oferta óptima. Para tal fin, una variación del clásico VSS (denominado "Forecasted Value of the Stochastic Solution", FVSS) fue definido y usado junto al clásico VSS.
Kuhn, Daniel. "Generalized bounds for convex multistage stochastic programs /". Berlin [u.a.] : Springer, 2005. http://www.loc.gov/catdir/enhancements/fy0818/2004109705-d.html.
Texto completo da fonteKuznia, Ludwig Charlemagne. "Extensions of Multistage Stochastic Optimization with Applications in Energy and Healthcare". Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4114.
Texto completo da fonteGolari, Mehdi. "Multistage Stochastic Programming and Its Applications in Energy Systems Modeling and Optimization". Diss., The University of Arizona, 2015. http://hdl.handle.net/10150/556438.
Texto completo da fonteChagas, Guido Marcelo Borma. "Long-term asset allocation based on stochastic multistage multi-objective portfolio optimization". reponame:Repositório Institucional do FGV, 2016. http://hdl.handle.net/10438/17044.
Texto completo da fonteApproved for entry into archive by Suzinei Teles Garcia Garcia (suzinei.garcia@fgv.br) on 2016-09-09T17:20:03Z (GMT) No. of bitstreams: 1 Long-Term Asset Allocation Based on Stochastic Multistage Multi-Objective Portfolio Optimization.pdf: 6336618 bytes, checksum: 67d3dd1c3b982252c5012b3078278f95 (MD5)
Made available in DSpace on 2016-09-09T17:21:47Z (GMT). No. of bitstreams: 1 Long-Term Asset Allocation Based on Stochastic Multistage Multi-Objective Portfolio Optimization.pdf: 6336618 bytes, checksum: 67d3dd1c3b982252c5012b3078278f95 (MD5) Previous issue date: 2016-08-19
Multi-Period Stochastic Programming (MSP) offers an appealing approach to identity optimal portfolios, particularly over longer investment horizons, because it is inherently suited to handle uncertainty. Moreover, it provides flexibility to accommodate coherent risk measures, market frictions, and most importantly, major stylized facts as volatility clustering, heavy tails, leverage effects and tail co-dependence. However, to achieve satisfactory results a MSP model relies on representative and arbitrage-free scenarios of the pertaining multivariate financial series. Only after we have constructed such scenarios, we can exploit it using suitable risk measures to achieve robust portfolio allocations. In this thesis, we discuss a comprehensive framework to accomplish that. First, we construct joint scenarios based on a combined GJR-GARCH + EVT-GPD + t-Copula approach. Then, we reduce the original scenario tree and remove arbitrage opportunities using a method based on Optimal Discretization and Process Distances. Lastly, using the approximated scenario tree we perform a multi-period Mean-Variance-CVaR optimization taking into account market frictions such as transaction costs and regulatory restrictions. The proposed framework is particularly valuable to real applications because it handles various key features of real markets that are often dismissed by more common optimization approaches.
Programação Estocástica Multi-Período (MSP) oferece uma abordagem conveniente para identificar carteiras ótimas, particularmente para horizontes de investimento mais longos, pois incorpora adequadamente a incerteza no processo de otimização. Adicionalmente, ela proporciona flexibilidade para acomodar medidas coerentes de risco, fricções de mercado e fatos estilizados relevantes como agrupamento de volatilidade, caudas pesadas, efeitos de alavancagem e co-dependência nas caudas. No entanto, para alcançar resultados satisfatórios, um modelo MSP depende de cenários representativos e livres de arbitragem. Somente após construídos esses cenários, podemos explorá-los usando medidas de risco adequadas para alcançar alocações ótimas. Nessa tese, discutimos uma metodologia completa para alcançar esse objetivo. Em primeiro lugar, construímos cenários conjuntos baseados numa abordagem conjunta GJR-GARCH + EVT-GPD + t-Copula. Posteriormente, reduzimos a árvore original de cenários e removemos oportunidades de arbitragem utilizando um método de discretização ótima baseado nas distâncias de processos estocásticos. Por último, usando a árvore aproximada de cenários, realizamos uma otimização multi-período de média-variância-CVaR considerando fricções de mercado, custos de transação e restrições regulamentares. A metodologia proposta é particularmente útil para aplicações reais, porque considera várias características relevantes dos mercados reais que muitas vezes são ignorados por abordagens mais simples de otimização.
Zhou, Zhihong. "Multistage Stochastic Decomposition and its Applications". Diss., The University of Arizona, 2012. http://hdl.handle.net/10150/222892.
Texto completo da fonteKüchler, Christian. "Stability, approximation, and decomposition in two- and multistage stochastic programming". Wiesbaden : Vieweg + Teubner, 2009. http://d-nb.info/995018979/04.
Texto completo da fonteYeo, In-Young. "Multistage hierarchical optimization for land use allocation to control nonpoint source water pollution". Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1127156412.
Texto completo da fonteTitle from first page of PDF file. Document formatted into pages; contains xvii, 180 p.; also includes graphics (some col.). Includes bibliographical references (p. 156-171). Available online via OhioLINK's ETD Center
Teiller, Alexandre. "Aspects algorithmiques de l'optimisation « multistage »". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS471.
Texto completo da fonteN a classical combinatorial optimization setting, given an instance of a problem one needs to find a good feasible solution. However, in many situations, the data may evolve over time and one has to solve a sequence of instances. Gupta et al. (2014) and Eisenstat et al. (2014) proposed a multistage model where given a time horizon the input is a sequence of instances (one for each time step), and the goal is to find a sequence of solutions (one for each time step) reaching a trade-off between the quality of the solutions in each time step and the stability/similarity of the solutions in consecutive time steps. In Chapter 1 of the thesis, we will present an overview of optimization problems tackling evolving data. Then, in Chapter 2, the multistage knapsack problem is addressed in the offline setting. The main contribution is a polynomial time approximation scheme (PTAS) for the problem in the offline setting. In Chapter 3, the multistage framework is studied for multistage problems in the online setting. The main contribution of this chapter was the introduction of a structure for these problems and almost tight upper and lower bounds on the best-possible competitive ratio for these models. Finally in chapter 4 is presented a direct application of the multistage framework in a musical context i.e. the target-based computed-assisted orchestration problem. Is presented a theoretical analysis of the problem, with NP-hardness and approximation results as well as some experimentations
Røstad, Lars Dybsjord, e Jeanette Christine Erichsen. "Investments in the LNG Value Chain : A Multistage Stochastic Optimization Model focusing on Floating Liquefaction Units". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for industriell økonomi og teknologiledelse, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-20980.
Texto completo da fonteSolak, Senay. "Efficient Solution Procedures for Multistage Stochastic Formulations of Two Problem Classes". Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19812.
Texto completo da fonteOstermaier, Georg. "Electric power system scheduling by multistage stochastic programming : an optimization approach to profitability in volatile electricity markets /". [S.l.] : [s.n.], 2001. http://aleph.unisg.ch/hsgscan/hm00151473.pdf.
Texto completo da fonteAl-Shayji, Khawla Abdul Mohsen. "Modeling, Simulation, and Optimization of large-Scale Commercial Desalination Plants". Diss., Virginia Tech, 1998. http://hdl.handle.net/10919/30462.
Texto completo da fontePh. D.
Li, Mengting Verfasser], e Michael Z. [Akademischer Betreuer] [Hou. "Optimization of multistage hydraulic fracturing treatment for maximization of the tight gas productivity / Mengting Li ; Betreuer: Michael Z. Hou". Clausthal-Zellerfeld : Technische Universität Clausthal, 2019. http://d-nb.info/1231363568/34.
Texto completo da fonteTekaya, Wajdi. "Risk neutral and risk averse approaches to multistage stochastic programming with applications to hydrothermal operation planning problems". Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47582.
Texto completo da fonteLeng, Yujun. "Preliminary design tools in turbomachinery| Non-uniformly spaced blade rows, multistage interaction, unsteady radial waves, and propeller horizontal-axis turbine optimization". Thesis, Purdue University, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10149746.
Texto completo da fonteTurbomachinery flow fields are inherently unsteady and complex which makes the related CFD analyses computationally intensive. Physically based preliminary design tools are desirable for parametric studies early in the design stage, and to provide deep physical insight and a good starting point for the later CFD analyses. Four analytical/semi-analytical models are developed in this study: 1) a generalized flat plate cascade model for investigating the unsteady aerodynamics of a blade row with non-uniformly spaced blades; 2) a multistage interaction model for investigating rotor-stator interactions; 3) an analytical solution for quantifying the impeller wake convection and pressure wave propagating between a centrifugal compressor impeller and diffuser vane; and 4) a semi-analytical model based Lifting line theory for unified propeller and horizontal-axis turbine optimization. Each model has been thoroughly validated with existing models.
With these models, non-uniformly spaced blade rows and vane clocking are investigated in detail for their potential use as a passive control technique to reduce forced response, flutter and aeroacoustic problems in axial compressors. Parametric studies with different impeller blade numbers and back sweep angles are conducted to investigate their effect on impeller wake and pressure wave propagation. Results show that the scattered pressure waves with high circumferential wave numbers may be an important excitation source to the impeller as their amplitude grows much faster as they travel inwardly than the lower order primary pressure waves. Detailed analysis of Lifting line theory reveals the mathematical and physical equivalence of Lifting line models for propellers and horizontal-axis turbines. With a new implementation, the propeller optimization code can be used for horizontal-axis turbine optimization without any modification. The newly developed unified propeller and horizontal-axis turbine optimization code based on lifting line theory and interior point method has been shown to be a very versatile tool with the capability of hub modelling, working with non-uniform inflow and including extra user specified constraints.
Caliari, Daniele. "Development and optimization of surface hardening treatments and anodizing processes". Doctoral thesis, Università degli studi di Padova, 2018. http://hdl.handle.net/11577/3422679.
Texto completo da fonteL’ottimizzazione delle performance di superfici metalliche è una delle sfide industriali più avvincenti nell’ambito dell’ingegneria delle superfici. I trattamenti di indurimento superficiale sono quei processi sviluppati per incrementare la durezza e resistenza a usura superficiali di componenti senza però peggiorare la tenacità che presentano a cuore. Questo lavoro di dottorato è focalizzato sullo studio sia di trattamenti multistadio di ossinitrocarburazione applicati a substrati in acciaio basso legato, sia di trattamenti di anodizzazione dura applicati a componenti pressocolati in lega di alluminio. Attualmente vi sono ancora importanti lacune riguardo queste specifiche tipologie di trattamenti, sia in letteratura che nel mondo industriale. L’obiettivo di questo lavoro è approfondire sia l’evoluzione microstrutturale durante un trattamento multistadio di ossinitrocarburazione applicato a un substrato ferroso, sia come le caratteristiche microstrutturali di un substrato in lega di alluminio impattano sul film di ossido anodico duro. L’obiettivo finale è quello di ampliare il sapere scientifico e, quindi, gettare le basi per poter poi replicare con successo su scala industriale quanto studiato in laboratorio. Un’accurata revisione della letteratura e una serie di trattamenti replicati in impianti industriali ha portato a una visione ad ampio spettro su questi trattamenti termochimici e di ossidazione anodica dura.
Rieß, Steffen [Verfasser]. "Architecture Optimization and Implementation of a Radio Receiver with a Multistage Spectrum Sensing Technique as Part of a Low-Cost Spectrum Sensing Grid / Steffen Rieß". München : Verlag Dr. Hut, 2016. http://d-nb.info/1097818098/34.
Texto completo da fonteVigerske, Stefan. "Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming". Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://dx.doi.org/10.18452/16704.
Texto completo da fonteThis thesis contributes to two topics in mathematical programming: stochastic optimization and mixed-integer nonlinear programming (MINLP). In the first part, we extend quantitative continuity results for two-stage stochastic mixed-integer linear programs to include situations with simultaneous uncertainty in costs and right-hand side, give an extended review on decomposition algorithm for two- and multistage stochastic linear and mixed-integer linear programs, and discuss extensions and combinations of the Nested Benders Decomposition and Nested Column Generation methods for multistage stochastic linear programs to exploit the advantages of so-called recombining scenario trees. As an application of the latter, we consider the optimal scheduling and investment planning for a regional energy system including wind power and energy storages. In the second part, we give a comprehensive overview about the state-of-the-art in algorithms and solver technology for MINLPs and show that some of these algorithm can be applied within the constraint integer programming framework SCIP. The availability of the latter allows us to utilize the power of already existing mixed integer linear and constraint programming technologies to handle the linear and discrete parts of the problem. Thus, we focus mainly on the domain propagation, outer-approximation, and reformulation techniques to handle convex and nonconvex nonlinear constraints. In an extensive computational study, we investigate the performance of our approach on applications from open pit mine production scheduling and water distribution network design and on various benchmarks sets. The results show that SCIP has become a competitive solver for MINLPs.
Mohammadi, Mehrdad. "A multi-objective optimization framework for an inspection planning problem under uncertainty and breakdown". Thesis, Paris, ENSAM, 2015. http://www.theses.fr/2015ENAM0055/document.
Texto completo da fonteQuality inspection in multistage production systems (MPSs) has become an issue and this is because the MPS presents various possibilities for inspection. The problem of finding the best inspection plan is an “inspection planning problem”. The main simultaneous decisions in an inspection planning problem in a MPS are: 1) which quality characteristics need to be inspected, 2) what type of inspection should be performed for the selected quality characteristics, 3) where these inspections should be performed, and 4) how the inspections should be performed. In addition, lack of information about production processes and several environmental factors has become an important issue that imposes a degree of uncertainty to the inspection planning problem. This research provides an optimization framework to plan an inspection process in a MPS, wherein, input parameters are uncertain and inspection tools and production machines are subject to breakdown. This problem is formulated through several mixed-integer mathematical programming models with the objectives of minimizing total manufacturing cost, maximizing customer satisfaction, and minimizing total production time. Furthermore, Taguchi and Monte Carlo methods are applied to cope with the uncertainties. Due to the complexity of the proposed models, meta-heuristic algorithms are employed to find optimal or near-optimal solutions. Finally, this research implements the findings and methods of the inspection planning problem in another application as hub location problem. General and detail concluding remarks are provided for both inspection and hub location problems
An, Na. "Resource Modeling and Allocation in Competitive Systems". Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/6997.
Texto completo da fonteNasri, Karima. "Frigo pompes à absorption multiétagées de haute performance : simulation et conception d'une maquette expérimentale". Vandoeuvre-les-Nancy, INPL, 1997. http://www.theses.fr/1997INPL054N.
Texto completo da fonteFrithiof, Fredrik. "A framework for designing a modular muffler system by global optimization". Thesis, KTH, Optimeringslära och systemteori, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169650.
Texto completo da fonteNär man skapar en ljuddämpare som ska installeras på en ljud-genererande maskin bör designparametrarna samt placeringarna av ljuddämpande element optimeras för att minimera ljudet som kommer ut ur ekipaget. Detta exemplifieras i en liten projektuppgift för studenter till en grundkurs i optimering på KTH. Uppgiften är dock bristfällig, eftersom både det sätt som optimeringsproblemet är utformat är alltför förenklat och den algoritm som används för att lösa problemet, fmincon, inte klarar av modellens matematiska komplexitet bra, vilket menas med att den fastnar i ett lokalt optimum som inte är ett globalt optimum. Detta examensarbete handlar om att undersöka hur man kan lösa båda dessa problem. Modellen är modifierad för att kombinera flera frekvenser och anpassa dem till känsligheten för olika frekvenser i det mänskliga örat. Genom att göra detta är målet ändrat från det tidigare sättet att maximera den dynamiska insatsisoleringen DIL för en specifik frekvens till att minimera den totala upplevda ljudnivån LA. Modellen bygger på den modulära designen av TMM från 4-polsteori. Detta delar upp ljuddämparen i separata delar, med ljuddämpande element som matematiskt endast definieras av vilken T matris de har. De elementtyper att välja mellan är expansionskammare, kvartsvågsresonator och Helmholtzresonator. De globala optimeringsmetoder att välja mellan är Global Search, MultiStart, Genetic Algorithm, Pattern Search och Simulated Annealing. Genom att kombinera de olika typerna av ljuddämpande element på alla sätt och lösa varje fall med varje global optimeringsmetod, blir den bästa kombinationen vald och implementerad i modellen. Valet är två kvartsvågsresonatorer som löses genom MultiStart, vilket ger tillfredsställande resultat. Ytterligare analyser görs för att säkerställa robustheten av den valda implementationen, som inte avslöjar några väsentliga brister. Syftet med detta examensarbete är uppfyllt.
Pendleton, Tyler M. "Design and Fabrication of Rotationally Tristable Compliant Mechanisms". Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1552.pdf.
Texto completo da fonteHussein, Hussein. "Contribution to digital microrobotics : modeling, design and fabrication of curved beams, U-shaped actuators and multistable microrobots". Thesis, Besançon, 2015. http://www.theses.fr/2015BESA2048/document.
Texto completo da fonteA number of topics concerning digital microrobotics were addressed in this thesis. A new generation of the digital microrobot ”DiMiBot” was proposed with several advantages making the DiMiBot more accurate, more controllable and smaller. The new structure consists of only two multistable modules which adds some important features such as increasing the number of positions with smaller size and the ability to realize complex trajectories in the workspace. The principle of the new multistable module combines the advantages of the stepping microactuators in terms of the principle and of the digital concept in terms of the repeatability and robustness without feedback. The accuracy is ensured with an accurate positioning mechanism that compensate the fabrication tolerances. In parallel, analytical models was developed for the main components in the DiMiBot: preshaped curved beams and U-shaped electrothermal actuators. Subsequently, design methods were developed that allow choosing the optimal dimensions that ensure the desired outputs and respecting the design specifications and limitations. Multistable module prototypes, fabricated in the clean room MIMENTO, showed a proper functioning in the experiments
Ertl, Jakub. "Spolehlivost výkonových olejových transformátorů". Doctoral thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2013. http://www.nusl.cz/ntk/nusl-234174.
Texto completo da fonteLinowsky, Karsten. "Sampling-based decomposition methods in multistage stochastic optimization /". 2005. http://www.gbv.de/dms/zbw/50285023X.pdf.
Texto completo da fonteChen, Wei 1974. "Multistage stochastic programming models for the portfolio optimization of oil projects". Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-08-3884.
Texto completo da fontetext
Ming-TsungHung e 洪銘聰. "Using Simulation Optimization to Choose an Optimal Inspection Policy in Multistage Production System". Thesis, 2014. http://ndltd.ncl.edu.tw/handle/kwcn27.
Texto completo da fonte國立成功大學
工業與資訊管理學系
102
The aim of this study is to develop a heuristic for a multistage production system to find the optimal sample size and acceptance number for each stage, which can minimize the total cost while maintaining the required average outgoing quality. The heuristic uses metamodel to reduce the required replications of simulation, and combines with multiple feasibility check procedure to guarantee that the solution we found is feasible with respect to multiple stochastic constraints under a specified confidence level. The heuristic is compared with the OptQuest which is commonly embedded in Arena. The results show that our heuristic outperforms OptQuest in terms of objective values and the probability of finding feasible solutions.
Queiroz, Anderson Rodrigo de. "A sampling-based decomposition algorithm with application to hydrothermal scheduling : cut formation and solution quality". Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-12-4690.
Texto completo da fontetext
YANG, PEI-JUN, e 楊佩君. "Design and stepwise set-point optimization for multistage adiabatic reactors subject to catalyst deactivation with interstage heat exchange and cold shot cooling". Thesis, 1990. http://ndltd.ncl.edu.tw/handle/31151593282455931621.
Texto completo da fonteHorejšová, Markéta. "Vícestupňové vnořené vzdálenosti v stochastické optimalizaci". Master's thesis, 2018. http://www.nusl.cz/ntk/nusl-382742.
Texto completo da fonteUhliar, Miroslav. "Ekonomické růstové modely ve stochastickém prostředí". Master's thesis, 2017. http://www.nusl.cz/ntk/nusl-367898.
Texto completo da fonteCordeiro, Tiago Alexandre Barrinha. "A global optimization algorithm using trust-region methods and clever multistart". Master's thesis, 2021. http://hdl.handle.net/10362/135864.
Texto completo da fonteA otimização global é um importante domínio científico, não só pelos desafios algorítmicos que lhe estão associados, mas pela sua aplicação prática em diferentes áreas do conhecimento, que vão desde a Biologia à Engenharia Aeroespacial. Neste trabalho é desenvolvido um algoritmo baseado em métodos de regiões de confiança, para problemas de otimização global com derivadas, usando uma estratégia de multi-inicializações inteligente, sendo testada a sua eficiência e eficácia por comparação com outros algoritmos de otimização global. Baseado numa ideia aplicada à resolução de problemas de otimização sem derivadas, este algoritmo procura reduzir o esforço computacional que a busca de ótimos globais requer, comparando pontos que se situam relativamente próximos usando como raio de comparação o raio associado ao método de região de confiança, e retendo apenas os mais promissores, que continuarão a ser explorados. O método proposto permite não só a obtenção do ótimo global mas também de uma lista de ótimos locais que podem ser de interesse, dependendo do contexto do problema em questão.
Huang, Sheng-Fu, e 黃聖富. "Multi-objective Optimization for a Multistate Job- Shop Production Network Using NSGA-II and TOPSIS". Thesis, 2018. http://ndltd.ncl.edu.tw/handle/sw79cy.
Texto completo da fonte國立臺灣科技大學
工業管理系
106
A job-shop production system (JPS) is a general manufacturing system. In a JPS, each workstation configures multiple types of machines in order to increase flexibility of production. In a JPS, the number of normal machines in each workstation presents multiple levels due to partial failures, unexpected failures, and maintenance, etc. Therefore, it is suitable to state that the number of normal machines in each workstation is stochastic (i.e. multistate). To reflect the phenomenon of stochastic number of normal machines, network reliability can assess the performance of a JPS facing uncertain demand. The multi-objective optimization in this thesis is focusing on maximizing the network reliability and minimizing the total cost of JPS, which most supervisors pursue. In order to solve the multi-objective optimization problem, we separate it into two parts. First, we transform JPS into a multistate job-shop production network (MJPN) by using network topology, proposing an algorithm to evaluate network reliability. The major difficulty in evaluating network reliability of the MJPN is that the state distribution is not determined. When the number of machine types is large, it is impossible to calculate the probability one by one. Therefore, a machine vector (MV), representing the current number of normal machines in a workstation, is introduced to overcome the difficulty. We propose an algorithm based on the depth-first search (DFS) with special expanding technique, to search all MVs, which satisfying demand. Second, to search the machine configuration (MF) with maximal network reliability and minimal total cost simultaneously, we propose a two-stage approach based on NSGA-II and TOPSIS. In addition, a real case of t-shirt production is utilized to illustrate the proposed method. Supervisors can apply it to find the proper MF based on their preference.