TAILIEUCHUNG - A probability-driven search algorithm for solving multi-objective optimization problems

This paper proposes a new probabilistic algorithm for solving multi-objective optimization problems - Probability-Driven Search Algorithm. The algorithm uses probabilities to control the process in search of Pareto optimal solutions. Especially, we use the absorbing Markov Chain to argue the convergence of the algorithm. Authors test this approach by implementing the algorithm on some benchmark multi-objective optimization problems, and find very good and stable results. | Tạp chí KHOA HỌC ĐHSP TPHCM Số 33 năm 2012 A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS NGUYEN HUU THONG TRAN VAN HAO ABSTRACT This paper proposes a new probabilistic algorithm for solving multi-objective optimization problems - Probability-Driven Search Algorithm. The algorithm uses probabilities to control the process in search of Pareto optimal solutions. Especially we use the absorbing Markov Chain to argue the convergence of the algorithm. We test this approach by implementing the algorithm on some benchmark multi-objective optimization problems and find very good and stable results. Keywords multi-objective optimization stochastic probability algorithm. TÓM TẮT Một giải thuật tìm kiếm được điều khiển theo xác suất giải bài toán tối ưu đa mục tiêu Bài này đề nghị một giải thuật xác suất mới để giải bài toán tối ưu đa mục tiêu giải thuật tìm kiếm được điều khiển theo xác suất. Giải thuật sử dụng các xác suất để điều khiển quá trình tìm kiếm các lời giải tối ưu Pareto. Đặc biệt chúng tôi sử dụng Chuỗi Markov hội tụ để thảo luận về tính hội tụ của giải thuật. Chúng tôi thử nghiệm hướng tiếp cận này trên các bài toán tối ưu đa mục tiêu chuẩn và chúng tôi đã tìm được các kết quả rất tốt và ổn định. Từ khóa tối ưu đa mục tiêu ngẫu nhiên xác suất giải thuật. 1. Introduction We introduce the Search via Probability SVP algorithm for solving singleobjective optimization problems 4 . In this paper we extend SVP algorithm into Probabilistic-Driven Search PDS algorithm for solving multi-objective optimization problems by replacing the normal order with the Pareto one. We compute the complexity of the Changing Technique of the algorithm. Especially we use the absorbing Markov Chain to argue the convergence of the Changing Technique of the algorithm. We test this approach by implementing the algorithm on some benchmark multi-objective optimization problems and find very good and stable results. 2. The model of Multi-objective .

• Toán học
• Search algorithm
• Multi objective
• Optimization problems
• Giải thuật tìm kiếm
• Xác suất giải bài toán tối ưu
• Model of Multi objective
• Optimization of machining processes using pattern search algorithm
• Pattern search algorithm
• The PS algorithm
• Machining optimization problems
• Algorithm design
• Lecture Algorithm design
• Algorithm analysis
• Local search
• Gradient descent
• Metropolis algorithm
• Advanced Algorithms Analysis and Design
• Lecture Advanced Algorithms Analysis and Design
• Bài giảng Phân tích và thiết kế thuật toán nâng cao
• Breadth first search algorithm
• Depth first search
• Parenthesis theorem
• Local search basics
• General local search algorithm
• Tabu search
• Simulated Annealing
• Hill climbing
• Optimization and swarm intelligence
• Evolutionary algorithm
• Resourceconstrained project scheduling problem
• Cuckoo search algorithm
• Optimization algorithm
• Modified tabu search algorithm
• The single machine scheduling problem
• Additive manufacturing technology
• New meta heursitic
• The tabu search algorithms
• Variable neighborhood search algorithm
• The green vehicle routing problem
• Green vehicle routing problem
• Variable neighborhood search
• The limit of fuel tank capacity
• Gravity search algorithm
• Information hiding
• Transposition scheme
• Meta heuristic algorithm
• Confidential message
• Secret communication systems
• Implementation analysis of cuckoo search
• The benchmark rosenbrock and levy test functions
• The benchmark rosenbrock
• The algorithm’s search processes
• The search population
• Cosine modulation
• Non uniform filter banks
• Artificial Bee Colony algorithm
• Gravitational Search algorithm
• Harmony Search algorithm
• Reservoir simulation
• Well placement optimization
• Nonlinear optimization problem
• Multimodal optimization
• Crow search algorithm
• Jellyfish search algorithm
• Electric power generating plant outputs
• Economic load dispatch
• Multi constraint nonlinear
• Metaheuristics algorithms
• Differential evolution algorithm
• Graph search
• Graph connectivity
• Graph traversal
• Graph Branch Algorithm An Optimum Tree Search Method
• Scored Dependency Graph
• Arc Co occurrence Constraints
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• A Beam Search Extraction Algorithm
• Comparable Data
• Christoph Tillmann
• báo cáo ngôn ngữ
• ADP based Search Algorithm
• Statistical Machine Translation
• Long Papers
• A Best First Search Algorithm
• Generating Referring Expressions
• Helmut Horacek
• scientific reports
• model language
• process natural language
• Differential search algorithm based parametric optimization
• Electrochemical micromachining processes
• Parametric settings of EMM processes
• Three EMM processes
• Micro electromechanical system
• Nanoelectromechanical system applications
• Hybrid genetic gravitational search algorithm
• Multi objective flow shop scheduling problem
• Multi objective problems
• Traditional dispatching rules
• Backtracking Search Optimization Algorithm
• Unconstrained non linear function optimization
• BSA and Quadratic approximation
• Non differentiable optimization problem
• Continuous function optimization
• Luận văn Thạc sĩ
• Luận văn Thạc sĩ Kỹ thuật điện
• Thuật toán Gravitational Search Algorithm
• Phân bố công suất tối ưu
• Thuật toán tối ưu
• Bài toán điều phối kinh tế
• BMC Anesthesiology
• Extubation failure
• Intensive care unit
• Dilemma stems partly
• Longest common subsequence
• Dynamic algorithm
• Optimal binary search trees
• International journal of computer science & communication networks
• Efficient and customized facets
• Ordering for product search engine
• Product search engine
• Facet Classification Algorithm
• Novel evaluation methodology