Results 31 to 40 of about 1,538,880 (162)
Mathematics, 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
Improved Predictive Ability of KPLS Regression with Memetic Algorithms
Mathematics, 2021 Kernel partial least squares regression (KPLS) is a non-linear method for predicting one or more dependent variables from a set of predictors, which transforms the original datasets into a feature space where it is possible to generate a linear model and
Jorge Daniel Mello-Román +2 more
doaj +1 more source
Solving text clustering problem using a memetic differential evolution algorithm.
PLoS ONE, 2020 The text clustering is considered as one of the most effective text document analysis methods, which is applied to cluster documents as a consequence of the expanded big data and online information.
Hossam M J Mustafa +3 more
doaj +1 more source
A Memetic Algorithm for an External Depot Production Routing Problem
Algorithms, 2021 This study aims to compare the results of a memetic algorithm with those of the two-phase decomposition heuristic on the external depot production routing problem in a supply chain.
Bi Kouaï Bertin Kayé +3 more
doaj +1 more source
A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem
Applied Artificial Intelligence, 2020 The Traveling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, but also for its difficulty to find optimal solutions.
Mehdi El Krari +2 more
doaj +1 more source
Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem
IEEE Access, 2021 Search trajectory networks (STNs) were proposed as a tool to analyze the behavior of metaheuristics in relation to their exploration ability and the search space regions they traverse.
Valentina Narvaez-Teran +2 more
doaj +1 more source
IEEE Access, 2020 This paper studies a novel and practical distributed flexible assembly permutation flowshop scheduling problem with makespan criterion, which has attracted wide attention due to important applications in modern manufacturing.
Guanghui Zhang +3 more
doaj +1 more source
Orbit transfer maneouvres as a test benchmark for comparison metrics of evolutionary algorithms [PDF]
, 2009 In the present paper some metrics for evaluating the performance of evolutionary algorithms are considered. The capabilities of two different optimisation approaches are compared on three test cases, represented by the optimisation of orbital transfer ...
Avanzini, Giulio, Minisci, Edmondo
core +4 more sources
Hybridization of Multi-Objective Deterministic Particle Swarm with Derivative-Free Local Searches
Mathematics, 2020 The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems.
Riccardo Pellegrini +5 more
doaj +1 more source
Building Blocks as Experiences in Dynamic Capacitated Arc Routing Problems
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The dynamic capacitated arc routing problem (DCARP) aims to update the service paths of vehicles in the capacitated arc routing problem when uncertain factors deteriorate the current schedule of vehicles' services. A DCARP scenario comprises a series of DCARP instances that share similarities with each other. Therefore, optimisation experience
Hao Tong +4 more
wiley +1 more source