Results 41 to 50 of about 3,843 (214)

A Memetic Algorithm with a Novel Repair Heuristic for the Multiple-Choice Multidimensional Knapsack Problem

open access: yesMathematics, 2022
We propose a memetic algorithm for the multiple-choice multidimensional knapsack problem (MMKP). In this study, we focus on finding good solutions for the MMKP instances, for which feasible solutions rarely exist.
Jaeyoung Yang   +2 more
doaj   +1 more source

Memetic Algorithms for Spatial Partitioning Problems

open access: yesACM Transactions on Spatial Algorithms and Systems, 2023
Spatial optimization problems (SOPs) are characterized by spatial relationships governing the decision variables, objectives, and/or constraint functions. In this article, we focus on a specific type of SOP called spatial partitioning, which is a combinatorial problem due to the presence of discrete spatial units.
Subhodip Biswas   +4 more
openaire   +3 more sources

Distributed Dynamic Memetic Algorithm Based Coding Aware Routing for Wireless Mesh Sensor Networks

open access: yesInternational Journal of Distributed Sensor Networks, 2016
Network coding has been confirmed as a potential technology to improve performance of wireless mesh networks (WMNs); network coding has great advantages for sensor networks like minimization of communication needed to collect sensor data and error ...
Saeed Hamam, Ahmad S. Almogren
doaj   +1 more source

A MOS-based Dynamic Memetic Differential Evolution Algorithm for Continuous Optimization: A Scalability Test

open access: yes, 2010
Continuous optimization is one of the areas with more activity in the field of heuristic optimization. Many algorithms have been proposed and compared on several benchmarks of functions, with different performance depending on the problems.
Antonio LaTorre   +5 more
core   +1 more source

Memetic algorithm behavior on timetabling infeasibility [PDF]

open access: yes, 2011
Memetic Algorithm is one of the metaheuristic techniques commonly used to solve timetabling problems due to its explorative as well as exploitative properties to produce feasible timetables.
Wong, K.W.   +3 more
core   +1 more source

Solving the rotating seru production problem with dynamic multi-objective evolutionary algorithms

open access: yesJournal of Management Science and Engineering, 2022
Today's volatile market conditions in electronic industries have lead to a new production system, seru (which is the Japanese pronunciation for cell), and has been widely implemented in hundreds of Japanese and other Asia companies.
Feng Liu, Kan Fang, Jiafu Tang, Yong Yin
doaj   +1 more source

Countering FIMI by Digital Authoritarianisms: Audience Architecture and Reverse Language Engineering

open access: yesGlobal Policy, EarlyView.
ABSTRACT Foreign information manipulation and interference (FIMI) campaigns on social media are currently both more accessible and more impactful than the North Atlantic Treaty Organization's (NATO) or European Union's (EU), offering their opponents superiority and efficiency on those platforms.
Michelangelo Conoscenti
wiley   +1 more source

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering [PDF]

open access: yes, 2007
This paper proposes a new memetic evolutionary algorithm to achieve explicit learning in rule-based nurse rostering, which involves applying a set of heuristic rules for each nurse's assignment.
Aickelin, Uwe   +9 more
core   +1 more source

Building algorithm portfolios for memetic algorithms

open access: yesProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014
The present study introduces an automated mechanism to build algorithm portfolios for memetic algorithms. The objective is to determine an algorithm set involving combinations of crossover, mutation and local search operators based on their past performance. The past performance is used to cluster algorithm combinations. Top performing combinations are
Mustafa Misir   +2 more
openaire   +3 more sources

A matheuristic for the traveling salesman problem with positional consistency constraints

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley   +1 more source

Home - About - Disclaimer - Privacy