Academic literature on the topic 'Optimization'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic '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 "Optimization"
Mukherjee, Manasij, and John Regehr. "Hydra: Generalizing Peephole Optimizations with Program Synthesis." Proceedings of the ACM on Programming Languages 8, OOPSLA1 (April 29, 2024): 725–53. http://dx.doi.org/10.1145/3649837.
Full textSartoros, Christine, Douglas M. Goltz, and Eric D. Salin. "Program Considerations for Simplex Optimization of Ion Lenses in ICP-MS." Applied Spectroscopy 52, no. 5 (May 1998): 643–48. http://dx.doi.org/10.1366/0003702981944292.
Full textZhong, Mei Peng. "Parameter Optimization of Compressor Based on an Ant Colony Optimization." Applied Mechanics and Materials 201-202 (October 2012): 916–19. http://dx.doi.org/10.4028/www.scientific.net/amm.201-202.916.
Full textNan, Yang. "An Improved Ant Colony Optimization Algorithm Based on Immunization Strategy." Advanced Materials Research 490-495 (March 2012): 66–70. http://dx.doi.org/10.4028/www.scientific.net/amr.490-495.66.
Full textRajeanderan Revichandran, Jaffar Syed Mohamed Ali, Moumen Idres, and A. K. M. Mohiuddin. "A Review of HVAC System Optimization and Its Effects on Saving Total Energy Utilization of a Building." Journal of Advanced Research in Fluid Mechanics and Thermal Sciences 93, no. 1 (March 25, 2022): 64–82. http://dx.doi.org/10.37934/arfmts.93.1.6482.
Full textSeth, Ashish. "Regression Test Case Optimization Using Ant Colony Optimization." Journal of Advanced Research in Dynamical and Control Systems 12, no. 3 (March 20, 2020): 111–18. http://dx.doi.org/10.5373/jardcs/v12i3/20201172.
Full textBatay, Sagidolla, Bagdaulet Kamalov, Dinmukhamed Zhangaskanov, Yong Zhao, Dongming Wei, Tongming Zhou, and Xiaohui Su. "Adjoint-Based High-Fidelity Concurrent Aerodynamic Design Optimization of Wind Turbine." Fluids 8, no. 3 (February 28, 2023): 85. http://dx.doi.org/10.3390/fluids8030085.
Full textMasarik, Jozef. "A thermodynamically motivated optimization algorithm: Circular wheel balance optimization." Applications of Mathematics 30, no. 6 (1985): 413–24. http://dx.doi.org/10.21136/am.1985.104171.
Full textXu, Liansong, and Dazhi Pan. "Multi-objective Optimization Based on Chaotic Particle Swarm Optimization." International Journal of Machine Learning and Computing 8, no. 3 (June 2018): 229–35. http://dx.doi.org/10.18178/ijmlc.2018.8.3.692.
Full textCelik, Yuksel, and Erkan Ulker. "An Improved Marriage in Honey Bees Optimization Algorithm for Single Objective Unconstrained Optimization." Scientific World Journal 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/370172.
Full textDissertations / Theses on the topic "Optimization"
Pieume, Calice Olivier. "Multiobjective optimization approaches in bilevel optimization." Phd thesis, Université Paris-Est, 2011. http://tel.archives-ouvertes.fr/tel-00665605.
Full textRuan, Ning. "Global optimization for nonconvex optimization problems." Thesis, Curtin University, 2012. http://hdl.handle.net/20.500.11937/1936.
Full textGedin, Sebastian. "Securities settlement optimization using an optimization software solution." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-279295.
Full textMånga har bedrivit handel med aktier eller andra värdepapper, men få är medvetna om hur transaktionerna genomförs. Processen där ägandet av värdepapper överförs, ofta i utbyte mot kontanter, kallas värdepappersavveckling. Om parterna som är involverade i transaktionen har de tillgångar som de är skyldiga att leverera vid tidpunkten för avvecklingen är värdepappersavvecklingen enkel. Men om värdepappersavvecklingssystemet står inför en uppsättning transaktioner, där någon part saknar den tillgång som hon är skyldig att leverera, kommer avvecklandet att misslyckas. Eftersom den mottagande parten av en transaktion som inte genomförs kan ha varit beroende av tillgångarna från den transaktionen för att uppfylla sina egna förpliktelser, kan en misslyckad avveckling leda till att många andra transaktioner inte kan genomföras. Värdepappersavveckling bör därmed optimeras för att minimera skadan i en situation där en eller flera transaktioner inta kan genomföras. I det här examensarbetet modellerar vi optimering av värdepappersavveckling som ett linjärprogrammeringsproblem med heltalsvillkor och utvärderar hur en optimeringsprogramvara presterar i jämförelse med en girig heuristisk algoritm på probleminstanser härledda från verklig avvecklingsdata. Vi finner att programvaran erbjuder en betydande fördel jämfört med den heuristiska algoritmen när det gäller att minimera antalet transaktioner som misslyckas, men att det görs till kostnaden av längre exekveringstid. Dessutom upptäcker vi att även om programvaran bara får köra i några minuter ger den en betydande fördel jämfört med den heuristiska algoritmen. Vår slutsats är att användningen av denna typ av programvara för optimering av värdepappersavveckling verkar vara en genomförbar strategi, men att ytterligare experiment med andra dataset behövs.
Sim, Melvyn 1971. "Robust optimization." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17725.
Full textIncludes bibliographical references (p. 169-171).
We propose new methodologies in robust optimization that promise greater tractability, both theoretically and practically than the classical robust framework. We cover a broad range of mathematical optimization problems, including linear optimization (LP), quadratic constrained quadratic optimization (QCQP), general conic optimization including second order cone programming (SOCP) and semidefinite optimization (SDP), mixed integer optimization (MIP), network flows and 0 - 1 discrete optimization. Our approach allows the modeler to vary the level of conservatism of the robust solutions in terms of probabilistic bounds of constraint violations, while keeping the problem tractable. Specifically, for LP, MIP, SOCP, SDP, our approaches retain the same complexity class as the original model. The robust QCQP becomes a SOCP, which is computationally as attractive as the nominal problem. In network flows, we propose an algorithm for solving the robust minimum cost flow problem in polynomial number of nominal minimum cost flow problems in a modified network. For 0 - 1 discrete optimization problem with cost uncertainty, the robust counterpart of a polynomially solvable 0 - 1 discrete optimization problem remains polynomially solvable and the robust counterpart of an NP-hard o-approximable 0-1 discrete optimization problem, remains a-approximable.
(cont.) Under an ellipsoidal uncertainty set, we show that the robust problem retains the complexity of the nominal problem when the data is uncorrelated and identically distributed. For uncorrelated, but not identically distributed data, we propose an approximation method that solves the robust problem within arbitrary accuracy. We also propose a Frank-Wolfe type algorithm for this case, which we prove converges to a locally optimal solution, and in computational experiments is remarkably effective.
by Melvyn Sim.
Ph.D.
Lopes, David Granja. "Collections Optimization." Master's thesis, Instituto Superior de Economia e Gestão, 2013. http://hdl.handle.net/10400.5/6505.
Full textEste trabalho debruça-se sobre a otimização do transporte de componentes automóveis. Começa-se por fazer uma revisão bibliográfica e de seguida um enquadramento da situação a estudar, bem como da empresa onde será aplicado (Volkswagen Autoeuropa). É desenvolvido um modelo matemático que permite identificar as rotas ótimas. O objetivo principal deste trabalho é a identificação de rotas otimizadas que permitam o aumento da eficiência, económica e operacional, da cadeia de abastecimento da Volkswagen Autoeuropa. Os resultados foram bastantes promissores, pois foi possível obter uma poupança média de 37% nas rotas identificadas.
This work focuses on optimizing the transport of automotive components. Starts by a literature review and then a framework of the situation being studied, as well as the company where it will be applied (Volkswagen Autoeuropa). A mathematical model that identifies the optimal routes is developed. The main objective of this work is the identification of optimal routes which can increase efficiency, economic and operational, of the supply chain of Wolkswagen Autoeuropa. The results were very promising as it was achieved an average saving of 37% on the identified routes.
Bylund, Johanna. "Collateral Optimization." Thesis, Umeå universitet, Institutionen för fysik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-148006.
Full textYu, Hao. "Run-time optimization of adaptive irregular applications." Diss., Texas A&M University, 2004. http://hdl.handle.net/1969.1/1285.
Full textArayapan, Khanittha, and Piyanut Warunyuwong. "Logistics Optimization: Application of Optimization Modeling in Inbound Logistics." Thesis, Mälardalen University, School of Innovation, Design and Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-6213.
Full textTo be a market leader, low cost and responsiveness are the key success factors. Logistics activities create high cost reducing competitiveness of the company, especially for the remote production base. Thus, logistics activities which are delivery planning, freight forwarder and delivery mode selection must be optimized. The focusing area of this paper is inbound logistics due to its big proportion in the total cost and involvement with several stakeholders. The optimization theory and Microsoft Excel’s Solver is used to create the standard optimization tools since it is an efficient and user friendly program. The models are developed based on the supply chain management theory in order to achieve the lowest cost, responsiveness and shared objectives. 2 delivery planning optimization models, container loading for fixed slitting and loading pattern and container loading for pallet loaded material, are formulated. Also, delivery mode selection is constructed by using optimization concept to determine the best alternative. Furthermore, freight forwarder selection process is created by extending the use of the delivery mode selection model. The results express that safety stock, loading pattern, transport mode, and minimum order quantity (MOQ) significantly affect the total logistics cost. Including hidden costs, long transit time and delay penalties, leads freight forwarder selection process to become more realistic and reliable. Shorter processing time, ensured optimal solution, transparency increase and better communication are gained by using these optimization models. However, the proper boundaries must be defined carefully to gain the feasible solution.
GOUCHER, DANIEL. "Database optimization : An investigation of code-based optimization techniques." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-153754.
Full textDatabasoptimering - En utredning av kodbaseradeoptimeringstekniker. I den här rapporten utreds databasoptimering med en inriktning på området som kan implementeras med mjukvara. Anledningen till denna inriktning är att mjukvaruoptimering är att område som alla utvecklare har resurserna att implementera.För att undersöka dessa optimeringstekniker så har jag först presenterat teorin bakom olika optimeringstekniker så som index, cachning och materialiserade vyer. En kort beskrivning på hur dessa tekniker kan implementeras i MySQL och PHP ges sedan. Med hjälp av dessa teorier så har en mängd tester skapats för att se hur olika optimeringstekniker reagerar på olika databasfrågor och storlekar. Resultatet av dessa tester presenteras sedan tillsammans med en diskussion på hur de sammanhänger med teorierna som presenterades och hur de kan användas i ett specifikt system.
Aggarwal, Varun. "Analog circuit optimization using evolutionary algorithms and convex optimization." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40525.
Full textIncludes bibliographical references (p. 83-88).
In this thesis, we analyze state-of-art techniques for analog circuit sizing and compare them on various metrics. We ascertain that a methodology which improves the accuracy of sizing without increasing the run time or the designer effort is a contribution. We argue that the accuracy of geometric programming can be improved without adversely influencing the run time or increasing the designer's effort. This is facilitated by decomposition of geometric programming modeling into two steps, which decouples accuracy of models and run-time of geometric programming. We design a new algorithm for producing accurate posynomial models for MOS transistor parameters, which is the first step of the decomposition. The new algorithm can generate posynomial models with variable number of terms and real-valued exponents. The algorithm is a hybrid of a genetic algorithm and a convex optimization technique. We study the performance of the algorithm on artificially created benchmark problems. We show that the accuracy of posynomial models of MOS parameters is improved by a considerable amount by using the new algorithm. The new posynomial modeling algorithm can be used in any application of geometric programming and is not limited to MOS parameter modeling. In the last chapter, we discuss various ideas to improve the state-of-art in circuit sizing.
by Varun Aggarwal.
S.M.
Books on the topic "Optimization"
Lange, Kenneth. Optimization. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-5838-8.
Full textPearce, Charles, and Emma Hunt, eds. Optimization. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-98096-6.
Full textNguyen, Van Hien, Jean-Jacques Strodiot, and Patricia Tossings, eds. Optimization. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-57014-8.
Full textPolak, Elijah. Optimization. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-0663-7.
Full textMiller, Ronald E. Optimization. Hoboken, NJ, USA: John Wiley & Sons, Inc., 1999. http://dx.doi.org/10.1002/9781118032930.
Full textLange, Kenneth. Optimization. New York, NY: Springer New York, 2004. http://dx.doi.org/10.1007/978-1-4757-4182-7.
Full textSharer, Elizabeth, and Hari Rajagopalan. Optimization. 2455 Teller Road, Thousand Oaks California 91320 United States: SAGE Publications, Inc., 2023. http://dx.doi.org/10.4135/9781071908082.
Full textHua, Luogene. Optimization. New York; London: Wiley, 1985.
Find full textOpen University. Optimization Course Team., ed. Optimization. Milton Keynes: Open University, 2002.
Find full textUniversity, Open, ed. Optimization. Milton Keynes: Open University, 2002.
Find full textBook chapters on the topic "Optimization"
Marwedel, Peter. "Optimization." In Embedded Systems, 349–79. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-60910-8_7.
Full textSerovajsky, Simon. "Additions." In Optimization, 36–66. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-2.
Full textSerovajsky, Simon. "Counterexamples of optimal control problems with a fixed final state." In Optimization, 313–47. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-11.
Full textSerovajsky, Simon. "Different counterexamples for optimization problems with isoperimetric conditions." In Optimization, 433–60. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-15.
Full textSerovajsky, Simon. "Alternative methods." In Optimization, 104–41. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-4.
Full textSerovajsky, Simon. "Absence of sufficiency and uniqueness in problems with isoperimetric conditions." In Optimization, 405–32. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-14.
Full textSerovajsky, Simon. "Ill-posed optimal control problems with a fixed final state." In Optimization, 348–72. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-12.
Full textSerovajsky, Simon. "Optimization of systems with isoperimetric conditions." In Optimization, 377–404. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-13.
Full textSerovajsky, Simon. "Different optimal control problems for systems with a free initial state." In Optimization, 489–510. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-17.
Full textSerovajsky, Simon. "Singular controls." In Optimization, 173–204. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003398585-6.
Full textConference papers on the topic "Optimization"
Krus, Petter, and Johan Andersson. "Optimizing Optimization for Design Optimization." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/dac-48803.
Full textTang, Zedong, Maoguo Gong, Fenlong Jiang, Hao Li, and Yue Wu. "Multipopulation Optimization for Multitask Optimization." In 2019 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2019. http://dx.doi.org/10.1109/cec.2019.8790234.
Full textGu, Xiaoyu, John E. Renaud, Leah M. Ashe, Stephen M. Batill, Amarjit S. Budhiraja, and Lee J. Krajewski. "Decision-Based Collaborative Optimization Under Uncertainty." In ASME 2000 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/detc2000/dac-14297.
Full textJian Jiao, Xianjia Wang, and Liubo Zhang. "Applying particle swarm optimization in multiobjective optimization and hybrid optimization." In 2010 Second International Conference on Computational Intelligence and Natural Computing (CINC). IEEE, 2010. http://dx.doi.org/10.1109/cinc.2010.5643832.
Full textAkpamukcu, Mehmet, and Abdullah Ate. "Improving Equlibrium Optimization Algorithm Performance with Optimization to Optimization Approach." In 2022 Innovations in Intelligent Systems and Applications Conference (ASYU). IEEE, 2022. http://dx.doi.org/10.1109/asyu56188.2022.9925491.
Full textClapp, Russell M., and Trevor Mudge. "Optimization." In the working group. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/322807.322845.
Full textYang, Shiyou. "A Modified Particle Swarm Optimization Algorithm for Engineering Optimizations." In The 5th International Conference on Computer Engineering and Networks. Trieste, Italy: Sissa Medialab, 2015. http://dx.doi.org/10.22323/1.259.0004.
Full textGuo, Zhendong, Wei Sun, Liming Song, Jun Li, and Zhenping Feng. "Generative Transfer Optimization for Aerodynamic Design." In GPPS Xi'an21. GPPS, 2022. http://dx.doi.org/10.33737/gpps21-tc-225.
Full textMukesh, R., K. Lingadurai, and S. Karthick. "Aerodynamic optimization using proficient optimization algorithms." In 2012 International Conference on Computing, Communication and Applications (ICCCA). IEEE, 2012. http://dx.doi.org/10.1109/iccca.2012.6179183.
Full textSOBIESZCZANSKI-SOBIESKI, J., B. JAMES, and M. RILEY. "Structural optimization by generalized, multilevel optimization." In 26th Structures, Structural Dynamics, and Materials Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1985. http://dx.doi.org/10.2514/6.1985-697.
Full textReports on the topic "Optimization"
Dunlavy, Daniel M., and Dianne P. O'Leary. Homotopy optimization methods for global optimization. Office of Scientific and Technical Information (OSTI), December 2005. http://dx.doi.org/10.2172/876373.
Full textZirilli, Francesco, and Luciano Misici. Numerical Optimization. Fort Belvoir, VA: Defense Technical Information Center, July 1988. http://dx.doi.org/10.21236/ada198586.
Full textBilbro, Griff. Quantum Optimization. Fort Belvoir, VA: Defense Technical Information Center, August 2000. http://dx.doi.org/10.21236/ada384604.
Full textWenren, Yonghu, Joon Lim, Luke Allen, Robert Haehnel, and Ian Dettwiler. Helicopter rotor blade planform optimization using parametric design and multi-objective genetic algorithm. Engineer Research and Development Center (U.S.), December 2022. http://dx.doi.org/10.21079/11681/46261.
Full textApostolatos, A., B. Keith, C. Soriano, and R. Rossi. D6.1 Deterministic optimization software. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.018.
Full textWeiland, Lisa M. Nanoscale Transport Optimization. Fort Belvoir, VA: Defense Technical Information Center, December 2008. http://dx.doi.org/10.21236/ada500838.
Full textGearhart, Jared Lee, Kristin Lynn Adair, Katherine A. Jones, Alisa Bandlow, Justin David Durfee, Dean A. Jones, Nathaniel Martin, Richard Joseph Detry, Alan Stewart Nanco, and Linda Karen Nozick. Contingency contractor optimization. Office of Scientific and Technical Information (OSTI), October 2013. http://dx.doi.org/10.2172/1104778.
Full textHahn, H. RHIC Luminosity Optimization. Office of Scientific and Technical Information (OSTI), October 1986. http://dx.doi.org/10.2172/1119051.
Full textYouker, A. J., P. Chung, E. Krahn, and G. F. Vandegrift. Column Optimization Studies. Office of Scientific and Technical Information (OSTI), June 2013. http://dx.doi.org/10.2172/1131388.
Full textGearhart, Jared Lee, Kristin Lynn Adair, Katherine A. Jones, Alisa Bandlow, Richard Joseph Detry, Justin David Durfee, Dean A. Jones, Nathaniel Martin, Alan Stewart Nanco, and Linda Karen Nozick. Contingency contractor optimization. Office of Scientific and Technical Information (OSTI), June 2013. http://dx.doi.org/10.2172/1090228.
Full text