Operations Research and Intelligent Computing for System Optimization

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: 31 October 2024 | Viewed by 876

Special Issue Editors


E-Mail Website
Guest Editor
Department of Management, Universitat Politècnica de Catalunya, 08028 Barcelona, Spain
Interests: metaheuristics; high-performance computing; artificial intelligence; transportation

Special Issue Information

Dear Colleagues,

The fields of Operations Research (OR) and Computer Science have long been at the forefront of optimizing complex systems across various domains. From transportation, logistics, and supply chain management to scheduling, finance, and resource allocation, OR techniques have played a crucial role in improving efficiency, decision making, and overall system performance. On the other hand, Computer Science has contributed advancements in algorithmic design, computational intelligence, and data analytics, revolutionizing how we approach complex problems.

In recent years, the integration of Intelligent Computing techniques, such as Artificial Intelligence (AI), Machine Learning (ML), and Metaheuristics, has opened new possibilities for tackling challenging optimization problems. AI and ML algorithms enable systems to learn from data, adapt to changing conditions, and make intelligent decisions. Metaheuristics, inspired by natural processes or intelligent search procedures, offer powerful optimization algorithms capable of navigating large search spaces and finding high-quality solutions.

This Special Issue aims to explore the synergies between Operations Research and Intelligent Computing in the context of Systems Optimization, with a focus on applications in different sectors. We seek original research articles, reviews, and case studies that demonstrate the integration and utilization of OR techniques and Intelligent Computing methodologies for optimizing complex systems. Potential topics of interest include but are not limited to:

  • Intelligent optimization algorithms that combine OR techniques and AI/ML methods for system optimization.
  • Applications of AI and ML techniques in solving optimization problems in domains such as transportation, healthcare, finance, energy, manufacturing, and telecommunications.
  • Metaheuristic approaches integrated with OR models for system optimization, including biased‒randomized algorithms, GRASP, iterated local search, evolutionary algorithms, swarm intelligence, simulated annealing, ant colony optimization, etc.
  • Simheuristic approaches combining metaheuristics with simulation to deal with systems under uncertainty.
  • Learnheuristic approaches combining metaheuristics with ML to deal with dynamic systems.
  • Decision support systems that leverage the integration of OR and Intelligent Computing techniques to enhance decision-making processes.
  • Hybrid approaches that combine OR models with intelligent algorithms to solve complex optimization problems.
  • Real-world case studies demonstrating the benefits and effectiveness of the integration between Operations Research and Intelligent Computing in various sectors.
  • Performance evaluation and benchmarking of optimization algorithms, considering both traditional OR methods and Intelligent Computing techniques, in the context of system optimization.

We look forward to receiving your contributions and making this Special Issue an exceptional platform for advancing the field of Operations Research and Intelligent Computing in the context of Systems Optimization, opening new frontiers of knowledge and fostering practical applications across diverse sectors.

Dr. Javier Panadero
Prof. Dr. Angel A. Juan
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

  • operations research
  • intelligent computing
  • systems optimization
  • artificial intelligence
  • machine learning
  • metaheuristics
  • simulation
  • hybrid intelligent algorithms

Published Papers (1 paper)

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

Research

22 pages, 718 KiB  
Article
A Forward–Backward Simheuristic for the Stochastic Capacitated Dispersion Problem
by Juan F. Gomez, Anna Martínez-Gavara, Javier Panadero, Angel A. Juan and Rafael Martí
Mathematics 2024, 12(6), 909; https://doi.org/10.3390/math12060909 - 20 Mar 2024
Viewed by 539
Abstract
In an effort to balance the distribution of services across a given territory, dispersion and diversity models typically aim to maximize the minimum distance between any pair of facilities. Specifically, in the capacitated dispersion problem (CDP), each facility has an associated capacity or [...] Read more.
In an effort to balance the distribution of services across a given territory, dispersion and diversity models typically aim to maximize the minimum distance between any pair of facilities. Specifically, in the capacitated dispersion problem (CDP), each facility has an associated capacity or level of service, and the objective is to select a set of facilities so that the minimum distance between any pair of them (dispersion) is maximized, while ensuring a user-defined level of service. This problem can be formulated as a linear integer model, where the sum of the capacities of the selected facilities must match or exceed the total demand in the network. Real-life applications often necessitate considering the levels of uncertainty affecting the capacity of the nodes. Failure to account for this uncertainty could lead to low-quality or infeasible solutions in practical scenarios. However, research addressing the stochastic version of the CDP is scarce. This paper introduces two models for the CDP with stochastic capacities, incorporating soft constraints and penalty costs for violating the total capacity constraint. The first model includes a probabilistic constraint to ensure the required level of service with a certain probability, while the second model introduces a soft constraint with penalty costs for violations. To solve both variants of the model, a forward–backward simheuristic algorithm is proposed. Our approach combines a metaheuristic algorithm with Monte Carlo simulation, enabling the efficient handling of the random behavior of node capacities and obtaining reliable solutions regardless of their probability distribution. Full article
(This article belongs to the Special Issue Operations Research and Intelligent Computing for System Optimization)
Show Figures

Figure 1

Planned Papers

The below list represents only planned manuscripts. Some of these manuscripts have not been received by the Editorial Office yet. Papers submitted to MDPI journals are subject to peer-review.

Title: Two synched capacitated-VRP problem with time windows
Authors: Esther Fernández-Bravo (UPM) · Hugo Larzabal (baobab soluciones) · Álvaro García-Sánchez (UPM) · Carlos A. Méndez (UNL) · Miguel Ortega-Mier (UPM)
Affiliation: UPM
Abstract: Several companies have to deal with decisions in which two different kind of resources (for example, trucks and working teams of people) have to be coordinated. Each resource has its own routes (with its own constraints like time windows) but both of them have to join in the client site to perform an activity to the client. In this paper, we define the two synched capacitated-VRPs with time windows problem (2S-CVRPTW). To solve the problem, we first suggest a MILP mathematical formulation with a full-space approach as the solution strategy. Later on, we propose three decomposed formulations arising from the original MILP problem as to study their ability to quickly find feasible solutions. Finally, we consider two local search algorithms based on heuristic techniques for improving the initial solutions.

Back to TopTop