Reviewer Assignment for Scientific Articles using Memetic Algorithms

2007 ◽  
pp. 113-134 ◽  
Author(s):  
Alexander Schirrer ◽  
Karl F. Doerner ◽  
Richard F. Hartl
Keyword(s):  
Memetic Algorithms

scholarly journals Improved Predictive Ability of KPLS Regression with Memetic Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 506
Author(s):  
Jorge Daniel Mello-Román ◽  
Adolfo Hernández ◽  
Julio César Mello-Román
Keyword(s):  
Kernel Function ◽  
Linear Method ◽  
Predictive Ability ◽  
Feature Space ◽  
Memetic Algorithms ◽  
Least Squares Regression ◽  
Optimal Parameters ◽  
Number Of Components ◽  
Kernel Partial Least Squares ◽  
Dependent Variables

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 extract orthogonal factors also called components. A difficulty in implementing KPLS regression is determining the number of components and the kernel function parameters that maximize its performance. In this work, a method is proposed to improve the predictive ability of the KPLS regression by means of memetic algorithms. A metaheuristic tuning procedure is carried out to select the number of components and the kernel function parameters that maximize the cumulative predictive squared correlation coefficient, an overall indicator of the predictive ability of KPLS. The proposed methodology led to estimate optimal parameters of the KPLS regression for the improvement of its predictive ability.

scholarly journals META-HEURISTIC APPROACH FOR HIGH-DEMAND FACILITY LOCATIONS CONSIDERING TRAFFIC CONGESTION AND GREENHOUSE GAS EMISSION

2016 ◽  
Vol 24 (4) ◽  
pp. 233-244 ◽  
Author(s):  
Taesung HWANG ◽  
Minho LEE ◽  
Chungwon LEE ◽  
Seungmo KANG
Keyword(s):  
Greenhouse Gas ◽  
Facility Location ◽  
Traffic Congestion ◽  
Urban Areas ◽  
Greenhouse Gas Emission ◽  
Memetic Algorithms ◽  
Distribution Centers ◽  
Ghg Emission ◽  
High Demand ◽  
Facility Locations

Large facilities in urban areas, such as storage facilities, distribution centers, schools, department stores, or public service centers, typically generate high volumes of accessing traffic, causing congestion and becoming major sources of greenhouse gas (GHG) emission. In conventional facility-location models, only facility construction costs and fixed transportation costs connecting customers and facilities are included, without consideration of traffic congestion and the subsequent GHG emission costs. This study proposes methods to find high-demand facility locations with incorporation of the traffic congestion and GHG emission costs incurred by both existing roadway traffic and facility users into the total cost. Tabu search and memetic algorithms were developed and tested with a conventional genetic algorithm in a variety of networks to solve the proposed mathematical model. A case study to determine the total number and locations of community service centers under multiple scenarios in Incheon City is then presented. The results demonstrate that the proposed approach can significantly reduce both the transportation and GHG emission costs compared to the conventional facility-location model. This effort will be useful for decision makers and transportation planners in the analysis of network-wise impacts of traffic congestion and vehicle emission when deciding the locations of high demand facilities in urban areas.

scholarly journals An evolutionary approach to the vehicle route planning in e-waste mobile collection on demand

2021 ◽  
Vol 25 (8) ◽  
pp. 6665-6680
Author(s):  
Krzysztof Szwarc ◽  
Piotr Nowakowski ◽  
Urszula Boryczka
Keyword(s):  
Tabu Search ◽  
Quality Evaluation ◽  
Memetic Algorithm ◽  
Route Planning ◽  
Memetic Algorithms ◽  
Approximate Methods ◽  
On Demand ◽  
Suboptimal Solutions ◽  
Novel Method ◽  
The Given

AbstractThe article discusses the utilitarian problem of the mobile collection of waste electrical and electronic equipment. Due to its $$\mathcal {NP}$$ NP -hard nature, implies the application of approximate methods to discover suboptimal solutions in an acceptable time. The paper presents the proposal of a novel method of designing the Evolutionary and Memetic Algorithms, which determine favorable route plans. The recommended methods are determined using quality evaluation indicators for the techniques applied herein, subject to the limits characterizing the given company. The proposed Memetic Algorithm with Tabu Search provides much better results than the metaheuristics described in the available literature.

scholarly journals Finding low autocorrelation binary sequences with memetic algorithms

2009 ◽  
Vol 9 (4) ◽  
pp. 1252-1262 ◽  
Author(s):  
José E. Gallardo ◽  
Carlos Cotta ◽  
Antonio J. Fernández
Keyword(s):  
Memetic Algorithms ◽  
Binary Sequences

Research on the Forward Kinematics of Stewart Platform Using Memetic Algorithms

2012 ◽  
Vol 268-270 ◽  
pp. 1416-1421
Author(s):  
Yu Hui Zhang ◽  
Li Wen Guan ◽  
Li Ping Wang ◽  
Yong Zhi Hua
Keyword(s):  
Nonlinear Equations ◽  
Rapid Development ◽  
Memetic Algorithms ◽  
Stewart Platform ◽  
Global Optimum ◽  
General Purpose ◽  
Forward Kinematics ◽  
Systems Of Nonlinear Equations ◽  
Artificial Intelligence Technology ◽  
Difficult Issue

The forward kinematics analysis of parallel manipulator is a difficult issue, which has been studied by many researchers recently. In this paper, in order to solve the difficult issue, a new computing method with higher calculation accuracy, good operation steadiness and faster speed is mentioned. Firstly, the mathematical model of direct kinematics of the Stewart platform is founded, which is nonlinear equations. Secondly, with the rapid development of artificial intelligence technology, Memetic algorithms (MA) are applied to solve the systems of nonlinear equations more and more, replacing the traditional algorithms. MA is a kind of meta-heuristic algorithm combined genetic algorithms (GA) with local search at the end of iteration. Finally, the validity of this algorithm has been testified by simulating iteration operation. The numerical simulation shows that MA can surely and rapidly get global optimum solution and greatly improve convergence rate. Thereby, MA can be widely used as a general-purpose algorithm for solving the forward kinematics of parallel mechanism.

SCHEDULING OF FLEXIBLE FLOW LINES WITH BLOCKING BY MEMETIC ALGORITHMS

2006 ◽  
Vol 39 (3) ◽  
pp. 21-26 ◽  
Author(s):  
R. Tavakkoli-Moghaddam ◽  
N. Safaei ◽  
S.A. Torabi
Keyword(s):  
Memetic Algorithms ◽  
Flow Lines ◽  
Flexible Flow Lines
Sign in / Sign up

Export Citation Format

Share Document