Dissertations / Theses on the topic 'Search problems'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Search problems.'
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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Lim, Wei Shi. "Problems in rendezvous search." Thesis, London School of Economics and Political Science (University of London), 1996. http://etheses.lse.ac.uk/2457/.
Full textBlack, Daniel Peter. "Search in weighted constraint satisfaction problems." Thesis, University of Leeds, 2003. http://etheses.whiterose.ac.uk/1309/.
Full textArbelaez, Rodriguez Alejandro. "Learning during search." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00600523.
Full textKorneffel, Torsten. "On combinatorial search problems which involve graphs." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=984062386.
Full textVoudouris, Christos. "Guided local search for combinatorial optimisation problems." Thesis, University of Essex, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361019.
Full textMarett, Richard Colin. "Neighbourhood search techniques for multi-objective combinatorial problems." Thesis, Lancaster University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296889.
Full textZahrani, Mohammed Saeed. "Genetic local search algorithms for selected graph problems." Thesis, University of Hertfordshire, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440188.
Full textLamprou, I. "Mobility problems in distributed search and combinatorial games." Thesis, University of Liverpool, 2018. http://livrepository.liverpool.ac.uk/3028459/.
Full textLopez, Soto Claudia Orquidea. "Formulation space search for two-dimensional packing problems." Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7455.
Full textBuljubasic, Mirsad. "Efficient local search for several combinatorial optimization problems." Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS010/document.
Full textThis Ph.D. thesis concerns algorithms for Combinatorial Optimization Problems. In Combinatorial Optimization Problems the set of feasible solutions is discrete or can be reduced to a discrete one, and the goal is to find the best possible solution. Specifically, in this research we consider three different problems in the field of Combinatorial Optimization including One-dimensional Bin Packing (and two similar problems), Machine Reassignment Problem and Rolling Stock Problem. The first one is a classical and well known optimization problem, while the other two are real world and very large scale problems arising in industry and have been recently proposed by Google and French Railways (SNCF) respectively. For each problem we propose a local search based heuristic algorithm and we compare our results with the best known results in the literature. Additionally, as an introduction to local search methods, two metaheuristic approaches, GRASP and Tabu Search are explained through a computational study on Set Covering Problem
Goh, Say Leng. "An investigation of Monte Carlo tree search and local search for course timetabling problems." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/43558/.
Full textCornu, Marek. "Local Search, data structures and Monte Carlo Search for Multi-Objective Combinatorial Optimization Problems." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLED043/document.
Full textMany Combinatorial Optimization problems consider several, often conflicting, objectives. This thesis deals with Local Search, data structures and Monte Carlo Search methods for finding the set of efficient solutions of such problems, which is the set of all best possible trade-offs given all the objectives.We propose a new approximation method called 2-Phase Iterated Pareto Local Search based on Decomposition (2PIPLS/D) combining the notions of Pareto Local Search (PLS) and Decomposition. PLS is a local search descent adapted to Multi-Objective spaces, and Decomposition consists in the subdivision of the Multi-Objective problem into a number of Single-Objective problems. Two Single-Objective methods are considered: Iterated Local Search and Nested Monte Carlo Search. Two main components are embedded within the 2PIPLS/D framework. The first one generalizes and improves an existing method generating an initial set of solutions. The second one reduces efficiently the search space and accelerates PLS without notable impact on the quality of the generated approximation. We also introduce two new data structures for dynamically managing a set of incomparable solutions. The first one is specialized for the bi-objective case, while the second one is general.2PIPLS/D is applied to the bi-objective and tri-objective Traveling Salesman Problem and outperforms its competitors on tested instances. Then, 2PIPLS/D is instantiated on a new five-objective problem related to the recent territorial reform of French regions which resulted in the reassignment of departments to new larger regions
Kampmeyer, Thomas. "Cyclic scheduling problems." Doctoral thesis, [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980566215.
Full textLincke, Thomas Robert. "Exploring the computational limits of large exhaustive search problems." [S.l. : s.n.], 2002. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=14701.
Full textSze, Jeeu Fong. "Hybridisation search for a class of vehicle routing problems." Thesis, University of Kent, 2017. https://kar.kent.ac.uk/61328/.
Full textSiala, Mohamed. "Search, propagation, and learning in sequencing and scheduling problems." Thesis, Toulouse, INSA, 2015. http://www.theses.fr/2015ISAT0008/document.
Full textSequencing and scheduling involve the organization in time of operations subject to capacity and resource constraints. We propose in this dissertation several improvements to the constraint satisfaction and combinatorial optimization methods for solving these problems. These contributions concern three different aspects: how to choose the next node to explore (search)? how much, and how efficiently, one can reduce the search space (propagation)? and what can be learnt from previous failures (learning)? Our contributions start with an empirical study of search heuristics for the well known car-sequencing problem. This evaluation characterizes the key aspects of a good heuristic and shows that the search strategy is as important as the propagation aspect in this problem. Second, we carefully investigate the propagation aspect in a class of sequencing problems. In particular, we propose an algorithm for filtering a type of sequence constraints which worst case time complexity is lower than the best known upper bound, and indeed optimal. Third, we investigate the impact of clause learning for solving the car-sequencing problem. In particular, we propose reduced explanations for the new filtering. The experimental evaluation shows compelling evidence supporting the importance of clause learning for solving efficiently this problem. Next, we revisit the general approach of lazy generation for the Boolean variables encoding the domains. Our proposition avoids a classical redundancy issue without computational overhead. Finally, we investigate conflict analysis algorithms for solving disjunctive scheduling problems. In particular, we introduce a novel learning procedure tailored to this family of problems. The new conflict analysis differs from conventional methods by learning clauses whose size are not function of the scheduling horizon. Our comprehensive experimental study with traditional academic benchmarks demonstrates the impact of the novel learning scheme that we propose. In particular, we find new lower bounds for a well known scheduling benchmark
Pereira, André Grahl. "Solving moving-blocks problems." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/149574.
Full textIn this thesis, we study the class of moving-blocks problems. A moving-blocks problem consists of k movable blocks placed on a grid-square maze where there is an additional movable block called the man, which is the only block that can be moved directly. In particular, each moving-blocks problem is defined by the set of moves available, by the goal description and by what happens when the man attempts to move a block. Sokoban is the best known and researched moving-blocks problem. We study moving-blocks problems in theory and practice. We investigate the computational complexity of problems of moving-blocks. Prior to this thesis, most of the scientific literature addressed moving-blocks problems with PUSH moves only, in most of the cases proving that these problems are PSPACE-complete. We consider two sets of problems: PULL moves only, and PUSH and PULL moves combined. Our reductions are from Nondeterministic Constraint Logic. We prove that many problems with PULL moves only are PSPACE-complete. In addition, we prove that the entire set of PUSH and PULL moves is PSPACE-complete. Our contribution in this research line is to enhance the knowledge on the complexity landscape of moving-blocks problems. Our main objective in this thesis is to optimally solve moving-blocks problems with a focus on Sokoban. Methods based on heuristic search and abstraction heuristics such as pattern databases are the most effective approaches to optimally solve these problems. We make many contributions in this research line. We introduce novel heuristic functions using pattern databases with the idea of intermediate goal states. We propose a technique based on pattern databases to detect deadlocks. We propose tie-breaking rules that exploit the structure of the problem. Using these heuristic functions and tie-breaking rules we increase the number of optimally solved instances of Sokoban and other problems compared to previous methods.
Robertson, Blair Lennon. "Direct Search Methods for Nonsmooth Problems using Global Optimization Techniques." Thesis, University of Canterbury. Mathematics and Statistics, 2010. http://hdl.handle.net/10092/5060.
Full textSlater, Andrew, and andrew slater@csl anu edu au. "Investigations into Satisfiability Search." The Australian National University. Research School of Information Sciences and Engineering, 2003. http://thesis.anu.edu.au./public/adt-ANU20040310.103258.
Full textImahori, Shinji. "Studies on Local Search Algorithms for Cutting and Packing Problems." 京都大学 (Kyoto University), 2004. http://hdl.handle.net/2433/147575.
Full textOsman, Ibrahim Hassan. "Metastrategy : simulated annealing and tabu search for combinatorial optimization problems." Thesis, Imperial College London, 1991. http://hdl.handle.net/10044/1/7596.
Full textMorioka, Tsuyoshi. "Classification of search problems and their definability in bounded arithmetic." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ58775.pdf.
Full textKotthoff, Lars. "On algorithm selection, with an application to combinatorial search problems." Thesis, University of St Andrews, 2012. http://hdl.handle.net/10023/2841.
Full textBenedettini, Stefano <1983>. "Metaheuristics for Search Problems in Genomics - New Algorithms and Applications." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amsdottorato.unibo.it/4403/.
Full textWassan, Niaz Ahmed. "Tabu search metaheuristics for a class of vehicle routing problems." Thesis, University of Kent, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263742.
Full textChiarandini, Marco. "Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems." Phd thesis, [S.l. : s.n.], 2005. https://tuprints.ulb.tu-darmstadt.de/595/1/ChiarandiniPhD.pdf.
Full textJha, Krishna Chandra. "Very large-scale neighborhood search heuristics for combinatorial optimization problems." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0004352.
Full textQiao, Wenbao. "GPU component-based neighborhood search for Euclidean graph minimization problems." Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCA020.
Full textIn this thesis, we propose parallel solutions based on current graphics processing unit (GPU) system for two Euclidean graph minimization problems, namely the Euclidean minimum spanning forest/tree (EMSF/EMST) and the travelling salesman problem (TSP). The proposed solutions also solve the bichromatic closest pair (BCP) problem, and follow technique of ``decentralized control, data parallelism, GPU shared memories".We propose a Euclidean K-dimensional nearest neighbourhood search (NNS) technique based on classical Elias' NNS approaches that divide the Euclidean space into congruent and non-overlapping cells where size of points in each cell is bounded. We propose a pruning technique to obtain component-based NNS to find a query point set Q's closest outgoing point within sequential linear time complexity when the data is uniformly distributed. These techniques are used together with two proposed GPU tree traversal algorithms, namely the GPU two-direction Breadth-first search and distributed dynamic linked list, to address the BCP. Based on the BCP solution, a divide and conquer parallel algorithm is implemented for building EMSF and EMST totally on GPU side. The TSP is addressed with different parallel 2-opt local search algorithms, in which we propose a ``multiple K-opt evaluation, multiple K-opt moves" methodology in order to simultaneously execute, without interference, massive 2-/3-opt moves that are globally found on the same TSP tour for many edges. This methodology is explained in details to show how we obtain high performance computing both on GPU and CPU side. We test the proposed solutions and report experimental comparison results against the state-of-the-art algorithms
Venter, Lieschen. "Metaheuristics for petrochemical blending problems." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/4180.
Full textAFRIKAANSE OPSOMMING: Die hoofdoelwit met die oplos van mengprobleme is om die beste mengsel van beskikbare bestandele te bepaal om 'n sekere hoeveelheid produk(te) te vervaardig. Die produk moet aan streng vereistes voldoen. Die beste kombinasie is die goedkoopste kombinasie van bestandele (toevoer) wat aan die minimum produkvereistes (afvoer) voldoen. Die algemeenste benaderings waarmee mengprobleme in die industrie opgelos word, is met behulp van sigblaaie, simulasies en wiskundige programmering. Hierdie metodes is baie nuttig om belowende oplossings of ontoelaatbaarhede te identi seer, maar dit kan potensieel meer voordelig wees om metodes te gebruik wat sistematies meer ekonomiese en e ektiewe oplossings vind. Heuristieke en metaheuristieke word as goeie alternatiewe oplossingsbenaderings aangebied. In hierdie tesis word verskillende metaheuristiekbenaderings toegepas op drie tipiese mengprobleme van verskillende groottes wat vanuit die petrochemiese industrie spruit. 'n Vierde geval met realistiese (regte wêreld) grootte word ook aangebied. Heuristieke word volgens intuïsie ontwikkel terwyl metaheuristieke aangepas word vanuit die literatuur. Lukrake soektegnieke soos die blinde lukrake soektegniek en die plaaslike lukrake soektegniek lewer redelike resultate. Binne die klas van genetiese algoritmes word die beste resultate gelewer wanneer die algoritme met 'n kombinasie van rangorde ksheidstoekenning en toernooiseleksie van individue geïmplimenteer word. Goeie resultate word ook verkry met behulp van tabusoektogbenaderings ten spyte van die kontinue aard van hierdie probleme. Gesimuleerde tempering lewer ook redelike resultate. 'n Vergelyking van die resultate van die verskillende tegnieke toon dat die tabusoektogtegniek die beste resultate met betrekking tot die kwaliteit van die oplossing sowel as uitvoertyd lewer. Gesimuleerde tempering lewer egter die beste resultate met betrekking tot die kwaliteit van die oplossing sowel as uitvoertyd vir die voorgestelde realistiese grootte probleem.
Umetani, Shunji. "Studies on Local Search Approaches to One Dimensional Cutting Stock Problems." 京都大学 (Kyoto University), 2003. http://hdl.handle.net/2433/68900.
Full textFlötteröd, Gunnar. "A search acceleration method for optimization problems with transport simulation constraints." Elsevier, 2017. https://publish.fid-move.qucosa.de/id/qucosa%3A72819.
Full textLawson, Mark Jon. "The Search for a Cost Matrix to Solve Rare-Class Biological Problems." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/29623.
Full textPh. D.
Merz, Peter. "Memetic algorithms for combinatorial optimization problems fitness landscapes and effective search strategies /." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=960860029.
Full textBin, Hussin Mohamed Saifullah. "Stochastic local search algorithms for single and bi-objective quadratic assignment problems." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/222286.
Full textDoctorat en Sciences de l'ingénieur et technologie
info:eu-repo/semantics/nonPublished
Linhares, Alexandre. "Industrial pattern seguencing problems: some complexity results and new local search models." Instituto Nacional de Pesquisas Espaciais, 2001. http://urlib.net/sid.inpe.br/jeferson/2004/03.30.14.23.
Full textIn this thesis we explore some industrial pattern sequencing problems arising in settings as distinct as the scheduling of flexible machines, the design of VLSI circuits, and the sequencing of cutting patterns. This latter setting presents us the minimization of open stacks problem, which is the main focus of our study. Some complexity results are presented for these sequencing problems, establishing a surprising connection between previously unrelated fields. New local search methods are also presented to deal with these problems, and their effectiveness is evaluated by comparisons with results previously obtained in the literature. The first method is derived from the simulated annealing algorithm, bringing new ideas from statistical physics. The second method advances these ideas, by proposing a collective search model based on two themes: (i) to explore the search space while simultaneously exhibiting search intensity and search diversity, and (ii) to explore the search space in proportion to the perceived quality of each region. Some preliminaries, given by coordination policies (to guide the search processes) and distance metrics, are introduced to support the model.
Hashimoto, Hideki. "Studies on local search-based approaches for vehicle routing and scheduling problems." 京都大学 (Kyoto University), 2008. http://hdl.handle.net/2433/93466.
Full textCouetoux, Adrien. "Monte Carlo Tree Search for Continuous and Stochastic Sequential Decision Making Problems." Thesis, Paris 11, 2013. http://www.theses.fr/2013PA112192.
Full textIn this thesis, we study sequential decision making problems, with a focus on the unit commitment problem. Traditionally solved by dynamic programming methods, this problem is still a challenge, due to its high dimension and to the sacrifices made on the accuracy of the model to apply state of the art methods. We investigate on the applicability of Monte Carlo Tree Search methods for this problem, and other problems that are single player, stochastic and continuous sequential decision making problems. We started by extending the traditional finite state MCTS to continuous domains, with a method called Double Progressive Widening (DPW). This method relies on two hyper parameters, and determines the ratio between width and depth in the nodes of the tree. We developed a heuristic called Blind Value (BV) to improve the exploration of new actions, using the information from past simulations. We also extended the RAVE heuristic to continuous domain. Finally, we proposed two new ways of backing up information through the tree, that improved the convergence speed considerably on two test cases.An important part of our work was to propose a way to mix MCTS with existing powerful heuristics, with the application to energy management in mind. We did so by proposing a framework that allows to learn a good default policy by Direct Policy Search (DPS), and to include it in MCTS. The experimental results are very positive.To extend the reach of MCTS, we showed how it could be used to solve Partially Observable Markovian Decision Processes, with an application to game of Mine Sweeper, for which no consistent method had been proposed before.Finally, we used MCTS in a meta-bandit framework to solve energy investment problems: the investment decision was handled by classical bandit algorithms, while the evaluation of each investment was done by MCTS.The most important take away is that continuous MCTS has almost no assumption (besides the need for a generative model), is consistent, and can easily improve existing suboptimal solvers by using a method similar to what we proposed with DPS
Kübel, David J. F. [Verfasser]. "On some Geometric Search Problems : Algorithms, Complexity, Computability / David J. F. Kübel." Bonn : Universitäts- und Landesbibliothek Bonn, 2020. http://d-nb.info/1224270606/34.
Full textPham, Duc Nghia, and n/a. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems." Griffith University. Institute for Integrated and Intelligent Systems, 2006. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070216.143447.
Full textZubaran, Tadeu Knewitz. "A study onshop sceduling problems." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/174953.
Full textShop scheduling is a combinatorial optimization type of problem in which we must allocate machines to jobs for specific periods time. A set of constraints defines which schedules are valid, and we must select one that minimizes or maximizes an objective function. In this work we use the makespan, which is the time the last job finishes. The literature contains several studies proposing techniques to solve shop problems such as the job shop and open shop. These problems allow the steps of the production processes to be either fully ordered or not ordered at all. With increasing complexity and size of industrial applications we find, more recently, several works which propose more general shop problems to model the production processes more accurately. The mixed shop, group shop and partial shop are examples of such problems In this work we propose an iterated tabu search for the partial shop, which is a general problem and includes several other more restrictive shop problems. The most important novel components of the solver are the initial solution generator, the neighbourhood, and the lower bound for the neighbourhood. In computational experiments we were able to show that the general partial shop solver is able to compete with, and sometimes surpass, the state-of-the-art solvers developed specifically for the partial, open, mixed and group shops. Sometimes a machine is a bottleneck in the production process, and is replicated. In the literature the parallel machines case has being included in several extensions of shop problems. In this thesis we also propose a technique to schedule the parallel machines heuristically, without including them explicitly in the representation of the problem. We use general techniques for the non-parallel machine cases to produce a fast tabu search heuristic results for the job shop with parallel machines.
McPeake, John Warren Robert. "Owner occupier search behaviour in the Belfast Urban Area : an investigation of residential search in a segregated housing market." Thesis, University of Glasgow, 1995. http://theses.gla.ac.uk/5504/.
Full textHenry, Obit Joe. "Developing novel meta-heuristic, hyper-heuristic and cooperative search for course timetabling problems." Thesis, University of Nottingham, 2010. http://eprints.nottingham.ac.uk/13581/.
Full textMadabushi, Ananth R. "Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36833.
Full textMaster of Science
Kypta, Tomáš. "Search Strategies for Scheduling Problems." Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-310936.
Full textChang, Yu-Ting, and 張瑜庭. "Harmony Search for Portfolio Optimization Problems." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/30581158851267741042.
Full text元智大學
工業工程與管理學系
99
This study proposes a harmony search algorithm for solving constrained portfolio optimization problems with the objective of investment return maximization and risk minimization according to Chang et al. (2000) which is based on the mean-variance model of Markowitz (1952). This study develops a hybrid encoding to deal with both continuous and combinatorial properties of the problem. The proposed algorithms employ harmony memory consideration, pitch adjustment and random search to achieve the balance between exploitation and exploration and generate high-quality new solutions effectively. The performance of the eleven proposed HS variations is tested using five global stock market indexes provided by the OR-Library from March 1992 to September 1997. The results of proposed HS algorithms are also compared with SA, TS and VNS algorithms in the literature. HS outperforms all the competing algorithms in all five test data sets, and proves to be a promising alterative in solving portfolio optimization problems.
Lo, Min-Hua, and 羅敏華. "Variable Neighborhood Search for Combinatorial Problems." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/99556577519317188892.
Full text元智大學
工業工程與管理學系
98
Variable neighborhood search (VNS) algorithm is one of the newly developed meta-heuristic methods. VNS and its variations have been successfully applied to many combinatorial optimization problems. Redundancy allocation problem (RAP) and team orienteering problem (TOP) are two NP-hard problems and play very important roles in real-world application. RAP has wide applications in nuclear industry, aeronautic engineering, astronautic engineering, military application and medical engineering, etc. and TOP can be considered the representative problem in logistics field. Therefore, RAP and TOP are chosen to test the robustness of VNS in this study. This dissertation is divided into three parts: First, a VNS algorithm embedded with a penalty function is proposed to solve single-objective RAPs. Two types of RAP - multi-stage and series-parallel systems are considered. Eight sets of benchmark which contains 152 instances are tested. Second, the MOVNS-RAP algorithm is developed to solve the multi-objective redundancy allocation problems. Three test instances are tested. Lastly, two VNS algorithm – VNS-TOP I and VNS-TOP II are proposed to solve orienteering problems and team orienteering problems. The concept of VNS-TOP algorithms is to extend the search space so the algorithm can solve the single-objective optimization problems under different constraint levels simultaneously. Six sets of OP benchmarks including 107 instances and seven sets of TOP benchmark including 353 instances are tested. The computational results of VNS on the three types of problems above show that VNS algorithms are very promising and competitive in both solution quality and computational expense.
Venugopal, Mamatha. "A Stochastic Search Approach to Inverse Problems." Thesis, 2016. http://hdl.handle.net/2005/3042.
Full textLin, Chun-Hao, and 林俊豪. "Tabu Search for Discrete Simulation Optimization Problems." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/yw7j89.
Full text中原大學
工業工程研究所
93
The optimization problems can be categorized into two types: continuous and discrete, base on the decision variables. We also discuss the simulation and numerical analysis. Now we consider mainly discrete simulation optimization problems. The simulation optimization problems, finding the optimal point using only estimates of the function values. Such problems occur in system design with simulation applications. The decision variables are controllable system parameters and objective function is the associate system cost to be minimized. Due to the complexity in the simulation system, the objective function values can not be computed numerically but can be estimated through simulation experiments. We propose the TSDRA algorithm for solving discrete simulation optimization problems. This algorithm combines the Dependent Retrospective Approximation (DRA) procedure and Tabu Search (TS). The main idea of DRA algorithm is to iteratively solve a sequence of sample-path problems with increasing sample size. Each sample-path problem is then solved by the heuristic tabu search (TS). We consider two performance indexes in this research: first is sensitivity analysis of the algorithm parameters, second is comparison of TSDRA to six existing algorithms --- MSSA, SRS, MSSR, MSSC, GADRA and SADRA---. Both studies use MSEf and CP as algorithm performance measures, where MSEf is the mean square error in the function value and CP is the number of convergent paths out of replications (a convergent path is one that terminates with the true optimal point). Algorithms with small MSEf and big CP are preferred. The simulation results also show that M/M/1 system is one dimension. In tabu search, long as search it from the large iterations, can reach best solution. Uni-model system is two dimensions, so that it will produce the cycle. TSDRA will get small MSEf than SADRA and GADRA, But SADRA ( ) get a good CP value.
Lai, Lien-Chi, and 賴鍊奇. "Adaptive Search Regions in Derivative Free Optimization Problems." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/78861635237905202838.
Full text國立高雄大學
應用數學系碩士班
96
This article attempts to find all local minima in an experimental region of interest. The optimization problems of interest are characterized as follows. First, the function is either complicated or defined implicitly. Second, the computational cost associated with simulating the function values is very high. We develop a new framework suited not only to accurate location of a given minimum, but also to finding multiple local minima automatically. In this aim, the algorithm first determines an approximate surrogate surface. Next, the algorithm shrinks the search region, refines the grids and then uses a specific form of retracing over the experimental region. The algorithm includes an asymptotic convergence analysis for each local minimum as well as a theoretical global dense searching to ensure that all local minima and the global minimum can be found. The numerical results produced by the algorithm are seen to perform well, even for oscillatory models and high-dimensional problems.
Chan, Teng-Yuan, and 詹登淵. "A Web Search Assistant on Google-hard Problems." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/10328230178146588116.
Full text銘傳大學
資訊工程學系碩士班
98
Search engine has been an indispensable tool in our daily lives. However, search engine cannot always satisfy users’ information needs. There are still many problems hard to be solved by Google. Such problems are called “Google-hard problems” in this paper. Information extraction scheme was built to resolve the Google-hard problems. The scheme extracts information from depth-zero and depth-one web pages. First, text is split into sentences and sentences are split as a term sequence by longest term first method. Second, sentences perform Chinese word segmentation by N-gram method. The scheme provides a relationship term list. Another capability uses features and benefits of Term-Clip algorithm. Text mining is performed through learning mode to collect appositional terms with the same properties as the query terms. The scheme helps users to speed up the search process. Users can handle the term list to change search direction. This is a new concept of search modes.