Please use this identifier to cite or link to this item:
|Title:||ON SOLVING MULTI-OBJECTIVE SIMULATION OPTIMIZATION BY OPTIMAL COMPUTING BUDGET ALLOCATION AND RANDOM SEARCH||Authors:||LIU WEIZHI||ORCID iD:||orcid.org/0000-0002-0566-1604||Keywords:||Simulation Optimization, Multi-objective Optimization, Pareto Optimality, Ranking and Selection, Optimal Computing Budget Allocation, Random Search||Issue Date:||7-Aug-2018||Citation:||LIU WEIZHI (2018-08-07). ON SOLVING MULTI-OBJECTIVE SIMULATION OPTIMIZATION BY OPTIMAL COMPUTING BUDGET ALLOCATION AND RANDOM SEARCH. ScholarBank@NUS Repository.||Abstract:||For decision-making in large-scale complex stochastic systems considering multiple conflicting objectives, analytical models and closed-form optimal solutions are usually hard to formulate and derive. These issues can be addressed by multi-objective simulation optimization, which employs efficient simulation to evaluate solutions' performance and such information is further used to guide the optimization. Despite the advantages of simulation optimization, there exist many challenges to be solved. In this thesis, three approaches are proposed to address these challenges through optimal computing budget allocation and random search. First, three simulation budget allocation strategies with asymptotic optimal guarantee are developed to tackle with multi-objective Ranking and Selection from the perspective of large deviation principle. Second, two globally convergent partition-based random search algorithms are developed to solve multi-objective optimization via simulation. Last, a less conservative approach is proposed to attack robust Ranking and Selection with input uncertainty.||URI:||http://scholarbank.nus.edu.sg/handle/10635/148570|
|Appears in Collections:||Ph.D Theses (Open)|
Show full item record
Files in This Item:
|LiuWZ.pdf||6.06 MB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.