Metaheuristic approaches for optimal broadcasting design in metropolitan MANETs [PDF]
, 2007 11th International Conference on Computer Aided Systems Theory. Las Palmas de Gran Canaria, Spain, February 12-16, 2007Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any
Alba, Enrique +11 more
core +2 more sources
A Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers [PDF]
Journal of Optimization in Industrial Engineering, 2016 Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of
Jafar Bagherinejad, Mina Dehghani
doaj +1 more source
A Multi-Objective DV-Hop Localization Algorithm Based on NSGA-II in Internet of Things
Mathematics, 2019 Locating node technology, as the most fundamental component of wireless sensor networks (WSNs) and internet of things (IoT), is a pivotal problem. Distance vector-hop technique (DV-Hop) is frequently used for location node estimation in WSN, but it has a
Penghong Wang +5 more
doaj +1 more source
Multi-objective routing optimization using evolutionary algorithms [PDF]
, 2012 Wireless ad hoc networks suffer from several limitations, such as routing failures, potentially excessive bandwidth requirements, computational constraints and limited storage capability. Their routing strategy plays a significant role in determining the
Cheung, Kent Tsz Kan +2 more
core +1 more source
Integrated LI-NSGA-II Approach for Solving the Non-linear Multi-objective Optimization Problem
Austrian Journal of StatisticsReal-world engineering projects frequently involve complex, non-linear multi-objective optimization challenges. Traditional methods like PERT/CPM and basic heuristics often fail to provide optimal solutions in such scenarios.
Muskan Kapoor +2 more
doaj +1 more source
Multi-agent collaborative search : an agent-based memetic multi-objective optimization algorithm applied to space trajectory design [PDF]
, 2011 This article presents an algorithm for multi-objective optimization that blends together a number of heuristics. A population of agents combines heuristics that aim at exploring the search space both globally and in a neighbourhood of each agent.
Deb K. A. +5 more
core +2 more sources
Better approximation guarantees for the NSGA-II by using the current crowding distance
Annual Conference on Genetic and Evolutionary Computation, 2022 A recent runtime analysis (Zheng, Liu, Doerr (2022)) has shown that a variant of the NSGA-II algorithm can efficiently compute the full Pareto front of the OneMinMax problem when the population size is by a constant factor larger than the Pareto front ...
Weijie Zheng, Benjamin Doerr
semanticscholar +1 more source
Analysis of NSGA-II and NSGA-II with CDAS, and Proposal of an Enhanced CDAS Mechanism
Journal of Advanced Computational Intelligence and Intelligent Informatics, 2009 In this work, we analyze the functionality transition in the evolution process of NSGA-II and an enhanced NSGA-II with the method of controlling dominance area of solutions (CDAS) from the viewpoint of front distribution. We examine the relationship between the population of the first front consisting of non-dominated solutions and the values of two ...
Kyoko Tsuchida +3 more
openaire +1 more source
2-Phase NSGA II: An Optimized Reward and Risk Measurements Algorithm in Portfolio Optimization
Algorithms, 2017 Portfolio optimization is a serious challenge for financial engineering and has pulled down special attention among investors. It has two objectives: to maximize the reward that is calculated by expected return and to minimize the risk. Variance has been
Seyedeh Elham Eftekharian +2 more
doaj +1 more source
A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem [PDF]
, 2011 Copyright @ Springer-Verlag Berlin Heidelberg 2011.The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided ...
D. Datta +10 more
core +1 more source