THE DAWN OF METAHEURISTIC ALGORITHMS
Journal Title: International Journal of Software Engineering and Computer Systems - Year 2018, Vol 4, Issue 2
Abstract
Optimization has become such a favored area of research in recent times necessitating the need for technical papers and tutorials that will properly analyze and explain the basics of the field. At the heart of efficiency and effectiveness of optimization of engineering, business and industrial processes is metaheuristics, hence the need for proper explanations of the basics of optimization algorithms since the optimization algorithms are the engine room of successful optimization enterprise. This paper presents a foundational discussion on metaheuristic algorithms as a necessary ingredient in successful optimization endeavors and concludes, after analysis of some metaheuristic algorithms that a good metaheuristic algorithm should consist of four components, namely global search, local search, randomization and identification of the best solution at each iteration.
FINGERPRINT WATERMARKING WITH TAMPER LOCALIZATION AND EXACT RECOVERY USING MULTI-LEVEL AUTHENTICATION
This paper presents the tamper localization and exact recovery using multi-level authentication in fingerprint watermarking. The proposed scheme will be detecting the tampered sector of fingerprint images when the waterm...
IMPLEMENTING COMBINED FSM WITH CPLDS
The subject of the research in this article is the logic circuit of the combined finite state machine (CFSM), which combines the functions of the both FSM Mealy and Moore. In practice, such a model of control automata is...
A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR) PROTOCOL IN MOBILE AD-HOC NETWORKS
Mobile Ad-hoc networks (MANETs) involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, b...
A REVIEW OF SINGLE AND POPULATION-BASED METAHEURISTIC ALGORITHMS SOLVING MULTI DEPOT VEHICLE ROUTING PROBLEM
Multi-Depot Vehicle Routing Problem (MDVRP) arises with rapid development in the logistics and transportation field in recent years. This field, mainly, faces challenges in arranging their fleet efficiently to distribute...
COMPARATIVE BENCHMARKING OF CONSTRAINTS T-WAY TEST GENERATION STRATEGY BASED ON LATE ACCEPTANCE HILL CLIMBING ALGORITHM
This paper describes the new t-way strategy based the Late Acceptance based Hill Climbing algorithm, called LAHC, for constraints t-way test generation. Unlike earlier competing work, LAHC does not require significant tu...