Optimization with Engineering Applications: Heuristics, Meta-Heuristics and Hyper-Heuristics

A special issue of Mathematics (ISSN 2227-7390).

Deadline for manuscript submissions: closed (29 February 2024) | Viewed by 3606

Special Issue Editors


E-Mail Website
Guest Editor
Department of Electrical and Computer Engineering, Shahid Beheshti University, Tehran, Iran
Interests: artificial intelligence; optimization algorithms; biomedical engineering; remote healthcare monitoring; prognosis and diagnosis; machine learning; deep learning; swarm and evolutionary algorithms; hyper-heuristic algorithms; biomedical image processing; biomedical signal processing; time-series analysis; Internet-of-Things; wireless body sensor networks
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Faculty of Mathematics, Otto-von-Guericke-University, P.O. Box 4120, D-39016 Magdeburg, Germany
Interests: scheduling; development of exact and approximate algorithms; stability investigations; discrete optimization; scheduling with interval processing times; complex investigations for scheduling problems; train scheduling; graph theory; logistics; supply chains; packing; simulation; applications
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Faculty of Information Technology, Al Al-Bayt University, Mafraq, Jordan
Interests: arithmetic optimization algorithm (AOA); bio-inspired computing; nature-inspired computing; swarm intelligence; artificial intelligence; meta-heuristic modeling; optimization algorithms; evolutionary computations; information retrieval; text clustering; feature selection; combinatorial problems; optimization; advanced machine learning; big data; natural language processing
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
1. University Research and Innovation Center, Obuda University, 1034 Budapest, Hungary
2. Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, Brisbane, QLD 4006, Australia
Interests: artificial intelligence; metaheuristics; engineering optimization; evolutionary algorithm; swarm intelligence; photonics
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Solution search methods for solving optimization problems can be categorized into exact, knowledge-based heuristic, and random-based meta-heuristic algorithms. Although exact search methods consistently achieve an optimal solution, such practices are not applicable to complex engineering problems that belong to the class of NP-complete/hard problems.

Over the past few years, various heuristic, meta-heuristic, and hyper-heuristic optimization algorithms have been introduced and applied to tackle the complexities of real-world engineering problems. Heuristics are high-speed application-specific methods, but they do not effectively investigate the search space. In contrast, meta-heuristics can obtain higher quality solutions due to their ability to cope with high computational complexity. As an extension to heuristics, hyper-heuristics provide agile and high-quality solutions that are capable of changing from one application variant to a new one quickly, which is important for solving real-time engineering problems.

This Special Issue aims to report the recent advances in optimization methods from theoretical, methodological, and applied viewpoints. We invite researchers and participants from academia and industry to submit their original research and review articles concerning new and existing heuristics, meta-heuristics, and hyper-heuristics for solving optimization problems in different branches of engineering.

Dr. Mohammad Shokouhifar
Prof. Dr. Frank Werner
Dr. Laith Abualigah
Prof. Dr. Seyedali Mirjalili
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. Mathematics 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 2600 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

  • engineering optimization
  • mathematical modeling
  • combinatorial optimization
  • robust optimization
  • exact methods
  • heuristic algorithms
  • meta-heuristic algorithms
  • hyper-heuristic algorithms
  • evolutionary computation
  • swarm intelligence
  • local-search algorithms
  • multi-objective optimization
  • constraint handling methods
  • hybrid optimization methods
  • fuzzy sets and systems
  • machine learning
  • deep learning
  • graph theory and applications
  • scheduling problems
  • resource allocation problems
  • vehicle routing problems
  • big-data analytics
  • signal/image processing
  • manufacturing systems
  • chemical processes
  • Internet-of-Things

Published Papers (3 papers)

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

Research

12 pages, 269 KiB  
Article
Iterated Local Search Approach to a Single-Product, Multiple-Source, Inventory-Routing Problem
by Federico Alonso-Pecina, Irma Yazmín Hérnandez-Báez, Roberto Enrique López-Díaz and Martin H. Cruz-Rosales
Mathematics 2024, 12(7), 991; https://doi.org/10.3390/math12070991 - 27 Mar 2024
Viewed by 429
Abstract
We address an inventory-routing problem that arises in a liquid oxygen-producing company. Decisions must be made for the efficient transport of the product from sources to destinations by means of a heterogeneous fleet of trucks. This combinatorial problem has been stated as a [...] Read more.
We address an inventory-routing problem that arises in a liquid oxygen-producing company. Decisions must be made for the efficient transport of the product from sources to destinations by means of a heterogeneous fleet of trucks. This combinatorial problem has been stated as a constrained minimization one, whose objective function is the quotient of the operating cost divided by the total amount of delivered product. The operating cost comes from the distances traveled, the drivers’ salary, and the drivers’ overnight accommodation. The constraints include time windows for drivers and destinations, inventory safety levels, lower bounds for the quantity of product delivered to destinations, and maximum driving times. To approximate the optimal solution of this challenging problem, we developed a heuristic algorithm that first finds a feasible solution, and then iteratively improves it by combining the Metropolis criterion with local search. Our results are competitive with the best proposals in the literature. Full article
17 pages, 5194 KiB  
Article
A New Class of Irregular Packing Problems Reducible to Sphere Packing in Arbitrary Norms
by Igor Litvinchev, Andreas Fischer, Tetyana Romanova and Petro Stetsyuk
Mathematics 2024, 12(7), 935; https://doi.org/10.3390/math12070935 - 22 Mar 2024
Viewed by 476
Abstract
Packing irregular objects composed by generalized spheres is considered. A generalized sphere is defined by an arbitrary norm. For three classes of packing problems, balance, homothetic and sparse packing, the corresponding new (generalized) models are formulated. Non-overlapping and containment conditions for irregular objects [...] Read more.
Packing irregular objects composed by generalized spheres is considered. A generalized sphere is defined by an arbitrary norm. For three classes of packing problems, balance, homothetic and sparse packing, the corresponding new (generalized) models are formulated. Non-overlapping and containment conditions for irregular objects composed by generalized spheres are presented. It is demonstrated that these formulations can be stated for any norm. Different geometrical shapes can be treated in the same way by simply selecting a suitable norm. The approach is applied to generalized spheres defined by Lp norms and their compositions. Numerical solutions of small problem instances obtained by the global solver BARON are provided for two-dimensional objects composed by spheres defined in Lp norms to demonstrate the potential of the approach for a wide range of engineering optimization problems. Full article
Show Figures

Figure 1

37 pages, 4323 KiB  
Article
A Multi–Objective Gaining–Sharing Knowledge-Based Optimization Algorithm for Solving Engineering Problems
by Nour Elhouda Chalabi, Abdelouahab Attia, Khalid Abdulaziz Alnowibet, Hossam M. Zawbaa, Hatem Masri and Ali Wagdy Mohamed
Mathematics 2023, 11(14), 3092; https://doi.org/10.3390/math11143092 - 13 Jul 2023
Cited by 2 | Viewed by 1018
Abstract
Metaheuristics in recent years has proven its effectiveness; however, robust algorithms that can solve real-world problems are always needed. In this paper, we suggest the first extended version of the recently introduced gaining–sharing knowledge optimization (GSK) algorithm, named multiobjective gaining–sharing knowledge optimization (MOGSK), [...] Read more.
Metaheuristics in recent years has proven its effectiveness; however, robust algorithms that can solve real-world problems are always needed. In this paper, we suggest the first extended version of the recently introduced gaining–sharing knowledge optimization (GSK) algorithm, named multiobjective gaining–sharing knowledge optimization (MOGSK), to deal with multiobjective optimization problems (MOPs). MOGSK employs an external archive population to store the nondominated solutions generated thus far, with the aim of guiding the solutions during the exploration process. Furthermore, fast nondominated sorting with crowding distance was incorporated to sustain the diversity of the solutions and ensure the convergence towards the Pareto optimal set, while the ϵ-dominance relation was used to update the archive population solutions. ϵ-dominance helps provide a good boost to diversity, coverage, and convergence overall. The validation of the proposed MOGSK was conducted using five biobjective (ZDT) and seven three-objective test functions (DTLZ) problems, along with the recently introduced CEC 2021, with fifty-five test problems in total, including power electronics, process design and synthesis, mechanical design, chemical engineering, and power system optimization. The proposed MOGSK was compared with seven existing optimization algorithms, including MOEAD, eMOEA, MOPSO, NSGAII, SPEA2, KnEA, and GrEA. The experimental findings show the good behavior of our proposed MOGSK against the comparative algorithms in particular real-world optimization problems. Full article
Show Figures

Figure 1

Back to TopTop