New Challenges in Evolutionary Computation

A special issue of Applied Sciences (ISSN 2076-3417). This special issue belongs to the section "Electrical, Electronics and Communications Engineering".

Deadline for manuscript submissions: closed (28 July 2022) | Viewed by 5249

Special Issue Editor


E-Mail Website
Guest Editor
Computer Science Department, Universidad Carlos III of Madrid, Leganés, 28911 Madrid, Spain
Interests: artificial intelligence; evolutionary computation; neuroevolution, machine learning; auctions; computational economics; evolutionary game theory

Special Issue Information

Dear Colleagues,

The field of evolutionary computation (EC) has been a prolific research area since its inception. In recent decades, many techniques have taken advantage of the evolutionary paradigm and widely demonstrated their problem-solving capability in numerous real-world applications in various  contexts and applications. This idea of mimicking procedures found in nature have led to remarkably effective techniques; indeed, EC has been rapidly growing to yield complex techniques with extremely sophisticated exploration mechanisms ideal for dynamic optimization. Nowadays, there are several new challenges for EC techniques mostly linked to their new applications across a range of fields, such as evolutionary data mining, vehicle routing, scheduling, multiobjective optimization with high dimensionality problems, hyperparameter optimization, or evolutionary algorithms as hyperheuristics. In addition to their novel applications, given the intrinsic stochastic nature of these techniques, interesting research lines explore their combination with other techniques, such as deep neural networks or deterministic techniques. Finally, any innovative proposal to improve parametrization, computational cost, convergence robustness, or scalability will be taken into consideration.

The aim of this Special Issue is to publish innovative research works related to the modern challenges faced by EC, particularly those that contribute to advances in the field of EC from both theoretical and applied perspectives.

Prof. Yago Saez
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Applied Sciences is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • evolutionary computation
  • genetic algorithms
  • evolutionary strategies
  • genetic programming
  • evolutionary programming
  • grammatical evolution
  • memetic computation
  • differential evolution
  • evolutionary game theory
  • evolutionary data mining
  • coevolution
  • neuroevolution
  • multiobjective evolutionary computation
  • interactive evolutionary computation
  • dynamic optimization

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

19 pages, 731 KiB  
Article
Solving the Integrated Multi-Port Stowage Planning and Container Relocation Problems with a Genetic Algorithm and Simulation
by Catarina Junqueira, Anibal Tavares de Azevedo and Takaaki Ohishi
Appl. Sci. 2022, 12(16), 8191; https://0-doi-org.brum.beds.ac.uk/10.3390/app12168191 - 16 Aug 2022
Cited by 4 | Viewed by 1982
Abstract
The greater flow of containers in global supply chains requires ever-increasing productivity at port terminals. The research found in the literature has focused on optimizing specific parts of port operations but has ignored important features, such as the stack-wise organization of containers in [...] Read more.
The greater flow of containers in global supply chains requires ever-increasing productivity at port terminals. The research found in the literature has focused on optimizing specific parts of port operations but has ignored important features, such as the stack-wise organization of containers in a container ship and port yard and the effects of interconnection among the operations in both places. The objective of this paper is to show the importance of designing an integrated plan of the container relocation problem at the port yard with the stowage planning problem for loading and unloading a ship through ports. Both individual problems are NP-Complete, and exact approaches for each problem are only able to find optimal or feasible solutions for small instances. We describe a simulation-optimization methodology that combines simulation, a genetic algorithm, and a new solution representation based on rules. The test results show that the solution from the integrated plan is mutually beneficial for port yards and ship owners. Full article
(This article belongs to the Special Issue New Challenges in Evolutionary Computation)
Show Figures

Figure 1

31 pages, 28185 KiB  
Article
Dimension-Wise Particle Swarm Optimization: Evaluation and Comparative Analysis
by Justin Schlauwitz and Petr Musilek
Appl. Sci. 2021, 11(13), 6201; https://0-doi-org.brum.beds.ac.uk/10.3390/app11136201 - 04 Jul 2021
Cited by 2 | Viewed by 2371
Abstract
This article evaluates a recently introduced algorithm that adjusts each dimension in particle swarm optimization semi-independently and compares it with the traditional particle swarm optimization. In addition, the comparison is extended to differential evolution and genetic algorithm. This presented comparative study provides a [...] Read more.
This article evaluates a recently introduced algorithm that adjusts each dimension in particle swarm optimization semi-independently and compares it with the traditional particle swarm optimization. In addition, the comparison is extended to differential evolution and genetic algorithm. This presented comparative study provides a clear exposition of the effects introduced by the proposed algorithm. Performance of all evaluated optimizers is evaluated based on how well they perform in finding the global minima of 24 multi-dimensional benchmark functions, each having 7, 14, or 21 dimensions. Each algorithm is put through a session of self-tuning with 100 iterations to ensure convergence of their respective optimization parameters. The results confirm that the new variant is a significant improvement over the traditional algorithm. It also obtained notably better results than differential evolution when applied to problems with high-dimensional spaces relative to the number of available particles. Full article
(This article belongs to the Special Issue New Challenges in Evolutionary Computation)
Show Figures

Figure 1

Back to TopTop