Mathematical Optimization and Decision Making Analysis

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E: Applied Mathematics".

Deadline for manuscript submissions: closed (30 June 2024) | Viewed by 5395

Special Issue Editors


E-Mail Website
Guest Editor
Engineering College, Carmen Autonomous University, Calle 56, 4, Esq. Avenida Concordia, Col. Benito Juárez, Campeche, Mexico
Interests: artificial neural network architectures and optimization; advanced backpropagation algorithm development; statistical modeling for environmental systems; process parameter optimization; machine learning in environmental engineering; neural network development; environmental applications; statistical methods; computational techniques; advanced process technologies; methodological expertise
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Sciences and Engineering, University of Quintana Roo, Blvd Bahía S/N, Chetumal 77019, Mexico
Interests: VoIP technologies; QoS and network measurements; IP traffic modeling; network performance evaluation; WSN; network security

Special Issue Information

Dear Colleagues,

In this groundbreaking Special Issue of the renowned journal Mathematics, entitled "Mathematical Optimization and Decision-Making Analysis: Innovations and Challenges", we delve into the latest advancements, pressing challenges, and promising potential of harnessing mathematical optimization and decision-making analysis across a variety of disciplines. The focus of this Special Issue is on introducing cutting-edge methodologies and ingenious solutions, underlining their indispensable role in today's complex decision-making dynamics.

The breadth of topics spanned by this Special Issue is both extensive and compelling. It provides an in-depth exploration of traditional areas such as linear and non-linear programming and multi-objective optimization, alongside more contemporary subjects like fuzzy decision-making, robust optimization, stochastic programming, and evolutionary algorithms that adeptly handle constraints.

It proceeds to highlight the practical applications of these techniques, illustrating their transformative potential in sectors as varied as engineering, economics, transport logistics, healthcare, and supply chain management. We particularly underscore the application of mathematical optimization in the emerging areas like green logistics and sustainable supply chains, healthcare informatics, and smart transportation systems, among others.

Moreover, it draws attention to the current trends and developments in machine learning and artificial intelligence, in which mathematical optimization and decision-making analysis are playing increasingly vital roles. It introduces new concepts such as reinforcement learning, deep learning, and algorithmic fairness in the context of optimization and decision-making.

This Special Issue serves as an indispensable guide and resource for researchers, practitioners, and academics invested in state-of-the-art advancements in mathematical optimization and decision-making analysis. With its mix of theory, practical applications, and emphasis on modern advancements, it stands as a critical reference in the current landscape and future direction of these essential disciplines.

Prof. Dr. Youness El Hamzaoui
Dr. Homero Toral-Cruz
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

  • mathematical optimization
  • operations research
  • decision making
  • convex optimization
  • integer programming
  • linear and nonlinear programming
  • decision tree
  • game theory
  • risk analysis

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (3 papers)

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

Research

21 pages, 535 KiB  
Article
A Mathematical Optimization Model Designed to Determine the Optimal Timing of Online Rumor Intervention Based on Uncertainty Theory
by Meiling Jin, Fengming Liu, Yufu Ning, Yichang Gao and Dongmei Li
Mathematics 2024, 12(16), 2457; https://doi.org/10.3390/math12162457 - 8 Aug 2024
Cited by 1 | Viewed by 1112
Abstract
The multifaceted nature of online rumors poses challenges to their identification and control. Current approaches to online rumor governance are evolving from fragmented management to collaborative efforts, emphasizing the proactive management of rumor propagation processes. This transformation considers diverse rumor types, the response [...] Read more.
The multifaceted nature of online rumors poses challenges to their identification and control. Current approaches to online rumor governance are evolving from fragmented management to collaborative efforts, emphasizing the proactive management of rumor propagation processes. This transformation considers diverse rumor types, the response behaviors of self-media and netizens, and the capabilities of regulatory bodies. This study proposes a multi-agent intervention model rooted in uncertainty theory to mitigate online rumor dissemination. Its empirical validation includes comparing three rumor categories and testing it against a single-agent model, highlighting the efficacy of collaborative governance. Quantitative assessments underscore the model’s utility in providing regulatory authorities with a robust theoretical framework for adaptive decision-making and strategy adjustments based on real-world conditions. Full article
(This article belongs to the Special Issue Mathematical Optimization and Decision Making Analysis)
Show Figures

Figure 1

12 pages, 1737 KiB  
Article
A Revisit to Sunk Cost Fallacy for Two-Stage Stochastic Binary Decision Making
by Xuecheng Tian, Bo Jiang, King-Wah Pang, Yuquan Du, Yong Jin and Shuaian Wang
Mathematics 2024, 12(10), 1557; https://doi.org/10.3390/math12101557 - 16 May 2024
Viewed by 1868
Abstract
This paper undertakes a revisit of the sunk cost fallacy, which refers to the tendency of people to persist investing resources into something, even if it is destined to have no good outcome. We emphasize that the utilities associated with different alternatives are [...] Read more.
This paper undertakes a revisit of the sunk cost fallacy, which refers to the tendency of people to persist investing resources into something, even if it is destined to have no good outcome. We emphasize that the utilities associated with different alternatives are not static for decision makers, which is exactly opposite to the traditional perspective. This paper argues that the utility of an option may change due to the choice of another option, suggesting that decisions considered irrational by the traditional analytical method, i.e., sunk cost fallacy, may be rational. We propose a novel analytical method for decision making with sunk cost when considering the utility change and validate the effectiveness of this method through mathematical modeling and computational experiments. This paper mathematically describes such decision-making problems, analyzing the impact of changes in the utilities across different alternatives on decision making with a real-world example. Furthermore, we develop a two-stage stochastic optimization model for such decision-making problems and employ the sample average approximation (SAA) method to solve them. The results from computational experiments indicate that some decisions traditionally considered irrational are, in fact, rational when the utility of an option changes as a result of choosing another option. This paper, therefore, highlights the significance of incorporating utility changes into the decision-making process and stands as a valuable addition to the literature, offering a refreshed and effective decision-making method for improved decision making. Full article
(This article belongs to the Special Issue Mathematical Optimization and Decision Making Analysis)
Show Figures

Figure 1

39 pages, 727 KiB  
Article
Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics
by Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, Giovanni Giachetti, Álex Paz and Alvaro Peña Fritz
Mathematics 2024, 12(2), 262; https://doi.org/10.3390/math12020262 - 12 Jan 2024
Cited by 8 | Viewed by 1712
Abstract
Chaotic maps are sources of randomness formed by a set of rules and chaotic variables. They have been incorporated into metaheuristics because they improve the balance of exploration and exploitation, and with this, they allow one to obtain better results. In the present [...] Read more.
Chaotic maps are sources of randomness formed by a set of rules and chaotic variables. They have been incorporated into metaheuristics because they improve the balance of exploration and exploitation, and with this, they allow one to obtain better results. In the present work, chaotic maps are used to modify the behavior of the binarization rules that allow continuous metaheuristics to solve binary combinatorial optimization problems. In particular, seven different chaotic maps, three different binarization rules, and three continuous metaheuristics are used, which are the Sine Cosine Algorithm, Grey Wolf Optimizer, and Whale Optimization Algorithm. A classic combinatorial optimization problem is solved: the 0-1 Knapsack Problem. Experimental results indicate that chaotic maps have an impact on the binarization rule, leading to better results. Specifically, experiments incorporating the standard binarization rule and the complement binarization rule performed better than experiments incorporating the elitist binarization rule. The experiment with the best results was STD_TENT, which uses the standard binarization rule and the tent chaotic map. Full article
(This article belongs to the Special Issue Mathematical Optimization and Decision Making Analysis)
Show Figures

Figure 1

Back to TopTop