Добірка наукової літератури з теми "Global optimisation solution"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Global optimisation solution".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Global optimisation solution"
Khurana, M., and H. Winarto. "Development and validation of an efficient direct numerical optimisation approach for aerofoil shape design." Aeronautical Journal 114, no. 1160 (October 2010): 611–28. http://dx.doi.org/10.1017/s0001924000004097.
Повний текст джерелаKianifar, Mohammed Reza, and Felician Campean. "Global Optimisation of Car Front-End Geometry to Minimise Pedestrian Head Injury Levels." Proceedings of the Design Society: International Conference on Engineering Design 1, no. 1 (July 2019): 2873–82. http://dx.doi.org/10.1017/dsi.2019.294.
Повний текст джерелаShankland, K., T. Griffin, A. Markvardsen, W. David, and J. van de Streek. "Rapid structure solution using global optimisation and distributed computing." Acta Crystallographica Section A Foundations of Crystallography 61, a1 (August 23, 2005): c37. http://dx.doi.org/10.1107/s0108767305098417.
Повний текст джерелаTunay, Mustafa, and Rahib Abiyev. "Improved Hypercube Optimisation Search Algorithm for Optimisation of High Dimensional Functions." Mathematical Problems in Engineering 2022 (April 22, 2022): 1–13. http://dx.doi.org/10.1155/2022/6872162.
Повний текст джерелаOppong, Stephen Opoku, Benjamin Ghansah, Evans Baidoo, Wilson Osafo Apeanti, and Daniel Danso Essel. "Experimental Study of Swarm Migration Algorithms on Stochastic and Global Optimisation Problem." International Journal of Distributed Artificial Intelligence 14, no. 1 (January 2022): 1–26. http://dx.doi.org/10.4018/ijdai.296389.
Повний текст джерелаPurchina, Olga, Anna Poluyan, and Dmitry Fugarov. "The algorithm development based on the immune search for solving unclear problems to detect the optical flow with minimal cost." E3S Web of Conferences 258 (2021): 06052. http://dx.doi.org/10.1051/e3sconf/202125806052.
Повний текст джерелаAmine, Khalil. "Multiobjective Simulated Annealing: Principles and Algorithm Variants." Advances in Operations Research 2019 (May 23, 2019): 1–13. http://dx.doi.org/10.1155/2019/8134674.
Повний текст джерелаAzmi, Azralmukmin, Samila Mat Zali, Mohd Noor Abdullah, Mohammad Faridun Naim Tajuddin, and Siti Rafidah Abdul Rahim. "The performance of COR optimisation using different constraint handling strategies to solve ELD." Indonesian Journal of Electrical Engineering and Computer Science 17, no. 2 (February 1, 2020): 680. http://dx.doi.org/10.11591/ijeecs.v17.i2.pp680-688.
Повний текст джерелаAli, Ahmed F., and Mohamed A. Tawhid. "Direct Gravitational Search Algorithm for Global Optimisation Problems." East Asian Journal on Applied Mathematics 6, no. 3 (July 20, 2016): 290–313. http://dx.doi.org/10.4208/eajam.030915.210416a.
Повний текст джерелаMakki, Mohammed, Milad Showkatbakhsh, Aiman Tabony, and Michael Weinstock. "Evolutionary algorithms for generating urban morphology: Variations and multiple objectives." International Journal of Architectural Computing 17, no. 1 (May 29, 2018): 5–35. http://dx.doi.org/10.1177/1478077118777236.
Повний текст джерелаДисертації з теми "Global optimisation solution"
Zidani, Hafid. "Représentation de solution en optimisation continue, multi-objectif et applications." Phd thesis, INSA de Rouen, 2013. http://tel.archives-ouvertes.fr/tel-00939980.
Повний текст джерелаLazare, Arnaud. "Global optimization of polynomial programs with mixed-integer variables." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLY011.
Повний текст джерелаIn this thesis, we are interested in the study of polynomial programs, that is optimization problems for which the objective function and/or the constraints are expressed by multivariate polynomials. These problems have many practical applications and are currently actively studied. Different methods can be used to find either a global or a heuristic solution, using for instance, positive semi-definite relaxations as in the "Moment/Sum of squares" method. But these problems remain very difficult and only small instances are addressed. In the quadratic case, an effective exact solution approach was initially proposed in the QCR method. It is based on a quadratic convex reformulation, which is optimal in terms of continuous relaxation bound.One of the motivations of this thesis is to generalize this approach to the case of polynomial programs. In most of this manuscript, we study optimization problems with binary variables. We propose two families of convex reformulations for these problems: "direct" reformulations and quadratic ones.For direct reformulations, we first focus on linearizations. We introduce the concept of q-linearization, that is a linearization using q additional variables, and we compare the bounds obtained by continuous relaxation for different values of q. Then, we apply convex reformulation to the polynomial problem, by adding additional terms to the objective function, but without adding additional variables or constraints.The second family of convex reformulations aims at extending quadratic convex reformulation to the polynomial case. We propose several new alternative reformulations that we compare to existing methods on instances of the literature. In particular we present the algorithm PQCR to solve unconstrained binary polynomial problems. The PQCR method is able to solve several unsolved instances. In addition to numerical experiments, we also propose a theoretical study to compare the different quadratic reformulations of the literature and then apply a convex reformulation to them.Finally, we consider more general problems and we propose a method to compute convex relaxations for continuous problems
Bergounioux, Marie. "Analyse de sensibilité d'un problème paramétré en optimisation : étude globale et locale des variations d'une solution." Lille 1, 1985. http://www.theses.fr/1985LIL10126.
Повний текст джерелаBocquillon, Benoît. "Contributions à l'autocalibrage des caméras : modélisations et solutions garanties par l'analyse d'intervalle." Toulouse 3, 2008. http://thesesups.ups-tlse.fr/600/.
Повний текст джерелаThis work deals with computer vision and more precisely camera self-calibration. Self-calibration is an important step involved in numerous applications such as tridimensional reconstruction or metrology. By self-calibration, we mean estimation of the camera model parameters, from a sequence of images and without a priori knowledge. Self-calibration methods have been widely used these last years since they allow calibration without a calibration target and since they can handle focal length variations. In this context, we have focused on plane-based self-calibration and 3D self-calibration. Our main contributions are concerned with the geometric modelisation of these problems and their mathematical resolution. The first main part of our work deals with geometric modelisation of self-calibration. In the plane-based case, we have revealed an inter-dependence in the model usally used and proposed by Triggs in 1998. In the light of this, we have proposed a minimal parameterization of the problem in which the number of unknowns is reduced. In the 3D case, we provide a thorough study of the critical motion sequences, i. E. Camera motions for which self-calibration is ambiguous, in the constant focal length case. Although Sturm and Kahl have given a complete classification of the critical motion sequences in the variable focal length case, this special case has not been studied yet. Secondly, we have investigated the resolution part of the self-calibration problems. These problems usually lead to an algebraic equation system which is solved by minimizing a cost function. Local minimization methods are generally used. They need a good initial solution and they do not provide any guaranty on the found optimum (many local minima are present, due to the non linearity of the cost function). The calibration step is a crucial step and affects the other steps such as reconstruction. .
Sellami, Mohamed. "Optimisation et aide au choix de solutions globales fondations-superstructure en construction métallique." Chambéry, 1995. http://www.theses.fr/1995CHAMS001.
Повний текст джерелаBugarin, Florian. "Vision 3D multi-images : contribution à l'obtention de solutions globales par optimisation polynomiale et théorie des moments." Phd thesis, Institut National Polytechnique de Toulouse - INPT, 2012. http://tel.archives-ouvertes.fr/tel-00768723.
Повний текст джерелаSchepler, Xavier. "Solutions globales d'optimisation robuste pour la gestion dynamique de terminaux à conteneurs." Thesis, Le Havre, 2015. http://www.theses.fr/2015LEHA0005/document.
Повний текст джерелаThis thesis deals with the case of a maritime port in which container terminals are cooperating to provide better global service. In order to coordinate operations between the terminals, a model and several solving methods are proposed. The objective is to minimize turnaround times of mother and feeder vessels, barges and trains. A solution to the model provides an assignment of container-transport vehicles to the terminals, including trucks, as well as an allocation of resources and time intervals to handle them and their containers. To obtain solutions to the model, a mixed-integer programming formulation is provided, as well as several mathematical programming based heuristics. A rolling horizon framework is introduced for dynamic management under uncertainty. Numerical experiments are conducted on thousands of various realistic instances. Results indicate the viability of our approach and demonstrate that allowing cooperation between terminals significantly increases the performance of the system
Bugarin, Florian. "Vision 3D multi-images : contribution à l’obtention de solutions globales par optimisation polynomiale et théorie des moments." Thesis, Toulouse, INPT, 2012. http://www.theses.fr/2012INPT0068/document.
Повний текст джерелаThe overall objective of this thesis is to apply a polynomial optimization method, based on moments theory, on some vision problems. These problems are often nonconvex and they are classically solved using local optimization methods. Without additional hypothesis, these techniques don’t converge to the global minimum and need to provide an initial estimate close to the exact solution. Global optimization methods overcome this drawback. Moreover, the polynomial optimization based on moments theory could take into account particular constraints. In this thesis, we extend this method to the problems of minimizing a sum of many rational functions. In addition, under particular assumptions of "sparsity", we show that it is possible to deal with a large number of variables while maintaining reasonable computation times. Finally, we apply these methods to particular computer vision problems: minimization of projective distortions due to image rectification process, Fundamental matrix estimation, and multi-view 3D reconstruction with and without radial distortions
(13992058), David W. Bulger. "Stochastic global optimisation algorithms." Thesis, 1996. https://figshare.com/articles/thesis/Stochastic_global_optimisation_algorithms/21377646.
Повний текст джерелаThis thesis addresses aspects of stochastic algorithms for the solution of global optimisation problems. The bulk of the research investigates algorithm models of the adaptive search variety. Performances of stochastic and deterministic algorithms are also compared.
Chapter 2 defines pure adaptive search, the prototypical improving region search scheme from the literature. Analyses from the literature of the search duration of pure adaptive search in two specialised situations are recounted and interpreted. In each case pure adaptive search is shown to require an expected search time which varies only linearly with the dimension of the feasible region.
In Chapter 3 a generalisation of pure adaptive search is introduced under the name of hesitant adaptive search. This original algorithm retains the sample point generation mechanism of pure adaptive search, but allows for hesitation, in which an algorithm iteration passes without an improving sample being located. In this way hesitant adaptive search is intended to model more closely practically implementable algorithms. The analysis of the convergence of hesitant adaptive search is more thorough than the analyses already appearing in the literature, as it describes how hesitant adaptive search behaves when given more general objective functions than in previous studies. By specialising to the case of pure adaptive search we obtain a unification of the results appearing in those papers.
Chapter 4 is the most applied of the chapters in this thesis. Here hesitant adaptive search is specialised to describe the convergence behaviour of localisation search schemes. A localisation search scheme produces a bracket of the current improving region at each iteration. The results of Chapter 3 are applied to find necessary and sufficient conditions on the 'tightness' of the brackets to ensure that the dependence of the expected search duration on the dimension of the feasible region is linear, quadratic, cubic, and so forth.
Chapter 5 describes another original generalisation of pure adaptive search, known as fenestral adaptive search. This algorithm generates sample points from a region determined not merely by the previous sample, but by the previous w samples, where w is some prespecified positive integer. The expected search duration of fenestral adaptive search is greater than that of pure adaptive search, but still varies only linearly with the dimension of the feasible region. The sequence of objective function values obtained constitutes an interesting stochastic process, and Chapter 5 is devoted to understanding this process.
Chapter 6 presents a theoretical comparison of the search durations of deterministic and stochastic global optimisation algorithms, together with some discussion of the implications. It is shown that to any stochastic algorithm, there corresponds a deterministic algorithm which requires no more iterations on average, but we discuss why stochastic algorithms may still be more efficient than their deterministic counterparts in practice.
Частини книг з теми "Global optimisation solution"
Shankland, Kenneth. "Structure Solution: Global Optimisation Methods." In NATO Science for Peace and Security Series B: Physics and Biophysics, 117–24. Dordrecht: Springer Netherlands, 2012. http://dx.doi.org/10.1007/978-94-007-5580-2_11.
Повний текст джерелаPenev, Kalin. "Precision in High Dimensional Optimisation of Global Tasks with Unknown Solutions." In Large-Scale Scientific Computing, 524–29. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-41032-2_60.
Повний текст джерелаAmine, Khalil. "Insights Into Simulated Annealing." In Advances in Computational Intelligence and Robotics, 121–39. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2857-9.ch007.
Повний текст джерелаGonzalez-Sanchez, Emilio J., Gottlieb Basch, Julio Roman-Vazquez, Elizabeth Moreno-Blanco, Miguel Angel Repullo-Ruiberriz de Torres, Theodor Friedrich, and Amir Kassam. "Conservation Agriculture in the agri-environmental European context." In Burleigh Dodds Series in Agricultural Science, 149–84. Burleigh Dodds Science Publishing, 2022. http://dx.doi.org/10.19103/as.2021.0088.05.
Повний текст джерелаFaulin, Javier, Fernando Lera-López, and Angel A. Juan. "Optimizing Routes with Safety and Environmental Criteria in Transportation Management in Spain." In Management Innovations for Intelligent Supply Chains, 144–65. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2461-0.ch008.
Повний текст джерелаТези доповідей конференцій з теми "Global optimisation solution"
Bodin, Per, Kristian Lindqvist, David Seelbinder, Artemi Makarow, José Garrido, Alessandro Visintini, Marilena Di Carlo, Andrew Hyslop, and Valentin Preda. "Attitude Guidance Using On-Board Optimisation." In ESA 12th International Conference on Guidance Navigation and Control and 9th International Conference on Astrodynamics Tools and Techniques. ESA, 2023. http://dx.doi.org/10.5270/esa-gnc-icatt-2023-113.
Повний текст джерелаAbam, Joshua T., Yongchang Pu, and Zhiqiang Hu. "Cost-Effective Optimal Solutions for Steel Catenary Riser Using Artificial Neural Network." In ASME 2022 41st International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/omae2022-79044.
Повний текст джерелаAbam, Joshua T., Yongchang Pu, and Zhiqiang Hu. "Weight Optimisation of Steel Catenary Riser Using Genetic Algorithm and Finite Element Analysis." In ASME 2022 41st International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/omae2022-79084.
Повний текст джерелаSethson, Magnus. "Extremal Optimisation Approach to Component Placement in Blood Analysis Equipment." In SICFP’21 The 17:th Scandinavian International Conference on Fluid Power. Linköping University Electronic Press, 2021. http://dx.doi.org/10.3384/ecp182p332.
Повний текст джерелаVollmer, Michael, Camille Pedretti, Alexander Ni, and Manfred Wirsum. "Advanced Bottoming Cycle Optimisation for Large Alstom CCPP." In ASME Turbo Expo 2007: Power for Land, Sea, and Air. ASMEDC, 2007. http://dx.doi.org/10.1115/gt2007-27578.
Повний текст джерелаLourenço, Pedro, Hugo Costa, João Branco, Pierre-Loïc Garoche, Arash Sadeghzadeh, Jonathan Frey, Gianluca Frison, Anthea Comellini, Massimo Barbero, and Valentin Preda. "Verification & validation of optimisation-based control systems: methods and outcomes of VV4RTOS." In ESA 12th International Conference on Guidance Navigation and Control and 9th International Conference on Astrodynamics Tools and Techniques. ESA, 2023. http://dx.doi.org/10.5270/esa-gnc-icatt-2023-155.
Повний текст джерелаCarydias, Peter, and Preben Nielsen. "Towards 2030: Transforming Asset Emissions in Upstream Production Operations." In ADIPEC. SPE, 2023. http://dx.doi.org/10.2118/216006-ms.
Повний текст джерелаImamovic, N., and D. J. Ewins. "Automatic Selection of Parameters for Updating Procedures." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/vib-4153.
Повний текст джерелаZhao, Tao, Dan Lee, Kasra Farahani, and Philip Cooper. "Advanced Numerical Simulation to Meet Design Challenges of XHPHT Metallurgically Clad PIP Platform Riser." In ASME 2011 30th International Conference on Ocean, Offshore and Arctic Engineering. ASMEDC, 2011. http://dx.doi.org/10.1115/omae2011-49679.
Повний текст джерелаter Brake, Erik, Andy Clegg, and Frederic Perdrix. "Development of Turbine Access System." In ASME 2013 32nd International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/omae2013-10301.
Повний текст джерела