Algorithms for Real-World Complex Engineering Optimization Problems

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Algorithms for Multidisciplinary Applications".

Deadline for manuscript submissions: closed (31 August 2022) | Viewed by 2313

Special Issue Editors


E-Mail Website
Guest Editor
School of Computer Science, University of Nottingham, Nottingham NG8 1BB, UK
Interests: artificial intelligence; bio-inspired computation; evolutionary computation; neural networks; computational arts; computer music
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Electrical & Electronics Engineering, Dayananda Sagar College of Engineering, Bengaluru, Karnataka 560078, India
Interests: single-objective algorithms; multi-objective algorithms; many-objective algorithms; robust optimization; artificial intelligence; machine learning; smart grid and microgrid; power and energy systems; solar photovoltaic systems

Special Issue Information

Dear Colleagues,

With the continuous development of computational power, researchers have recently had the chance to investigate engineering problems more precisely, in greater depth, while considering numerous uncertainties and constraints. Incorporating diverse limitations and increasing the number of variables in various engineering challenges necessitates more sophisticated problem-solving methodologies. Numerous implementations have proved that evolutionary and metaheuristic optimization algorithms are valuable tools for contemporary researchers and engineers.

Optimization algorithms are a higher-level tool that may help to solve any technical challenge in a definite and constructive way. Optimization algorithms can be used if an engineering problem can be quantified, properly defined, and algorithmically expressed. Handling real-world problems typically necessitates bringing together various disciplines during the optimization procedure. Advancements in evolutionary and metaheuristic optimization algorithms research continue to push the boundaries of application practicality, improving the accuracy and efficiency of optimization algorithms.

The primary objective of this Special Issue is to compile a comprehensive collection of cutting-edge research findings in science and engineering on optimization theory, methods, and applications. It also intends to bring together research that uses optimization algorithms to solve complex real-world engineering problems, evaluates their advantages and shortcomings, makes required adjustments to existing approaches, and introduces new algorithms. Original research and review contributions that use evolutionary and metaheuristic optimization algorithms to solve complex and large-scale engineering problems are invited.

Potential topics include but are not limited to the following:

  • Evolutionary optimization algorithms and variants;
  • Metaheuristic optimization algorithms and variants;
  • Single- and multi-objective optimization algorithms;
  • Many-objective optimization algorithms;
  • Constrained and unconstrained problems;
  • Artificial intelligence and machine learning;
  • Shape optimization algorithms;
  • Inverse optimization algorithms;;
  • Robust optimization algorithms;
  • Stochastic optimization algorithms;
  • Discrete and combinatorial optimization algorithms;
  • Application of algorithms in various real-world engineering problems.

Dr. Colin Johnson
Dr. M. Premkumar
Guest Editors

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. Algorithms is an international peer-reviewed open access monthly 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 1600 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

  • artificial intelligence
  • machine learning
  • optimization algorithms
  • real-world problems
  • smart city
  • smart systems

Published Papers (1 paper)

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

Research

0 pages, 342 KiB  
Article
Unrelated Parallel Machine Scheduling with Job and Machine Acceptance and Renewable Resource Allocation
by Alexandru-Liviu Olteanu, Marc Sevaux and Mohsen Ziaee
Algorithms 2022, 15(11), 433; https://doi.org/10.3390/a15110433 - 17 Nov 2022
Cited by 1 | Viewed by 1503
Abstract
In this paper, an unrelated parallel machine scheduling problem with job (product) and machine acceptance and renewable resource constraints was considered. The main idea of this research was to establish a production facility without (or with minimum) investment in machinery, equipment, and location. [...] Read more.
In this paper, an unrelated parallel machine scheduling problem with job (product) and machine acceptance and renewable resource constraints was considered. The main idea of this research was to establish a production facility without (or with minimum) investment in machinery, equipment, and location. This problem can be applied to many real problems. The objective was to maximize the net profit; that is, the total revenue minus the total cost, including fixed costs of jobs, job transportation costs, renting costs of machines, renting cost of resources, and transportation costs of resources. A mixed-integer linear programming (MILP) model and several heuristics (greedy, GRASP, and simulated annealing) are presented to solve the problem. Full article
(This article belongs to the Special Issue Algorithms for Real-World Complex Engineering Optimization Problems)
Show Figures

Figure 1

Back to TopTop