Research on Optimization Algorithm Design Techniques
Parul Sood, Department of Computer Science and Engineering, Chandigarh University Gharuan (Punjab), India.
Manuscript received on 01 November 2019 | Revised Manuscript received on 13 November 2019 | Manuscript Published on 22 November 2019 | PP: 1991-1992 | Volume-8 Issue-6S3 September 2019 | Retrieval Number: F12010986S319/19©BEIESP | DOI: 10.35940/ijeat.F1201.0986S319
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper discusses various optimization algorithm design techniques. So, optimization techniques which are discussed in this paper are greedy method, dynamic programming and branch and bound. Problem comes under optimization are used to find either maximum or minimum. All these techniques we have multiple inputs and some constraints and we have to find feasible solution using these inputs and constraints. In greedy method we follow some predefined method. Using that predefined method, we reach to the solution. On contrary to this in dynamic programming we take decision at every step and in the end we reach to the solution. In branch and bound we create state space tree and explore all possibilities of live node. Based on some constraint we start killing some alive nodes. Here, firstly I will discuss all the design techniques. Then types of problems that can be solved under each design techniques and their time complexities.
Keywords: Greedy Method, Dynamic Programming, Branch and Bound, Optimization, Algorithm Design Techniques, Maximum and Minimum Problems.
Scope of the Article: Cross-Layer Optimization