Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (7)
  • Open Access

    ARTICLE

    Deep Multi-Agent Stochastic Optimization for Traffic Management in IoT-Enabled Transportation Networks

    Nada Alasbali*

    CMC-Computers, Materials & Continua, Vol.85, No.3, pp. 4943-4958, 2025, DOI:10.32604/cmc.2025.068330 - 23 October 2025

    Abstract Intelligent Traffic Management (ITM) has progressively developed into a critical component of modern transportation networks, significantly enhancing traffic flow and reducing congestion in urban environments. This research proposes an enhanced framework that leverages Deep Q-Learning (DQL), Game Theory (GT), and Stochastic Optimization (SO) to tackle the complex dynamics in transportation networks. The DQL component utilizes the distribution of traffic conditions for epsilon-greedy policy formulation and action and choice reward calculation, ensuring resilient decision-making. GT models the interaction between vehicles and intersections through probabilistic distributions of various features to enhance performance. Results demonstrate that the proposed More >

  • Open Access

    ARTICLE

    An Adaptive Hybrid Metaheuristic for Solving the Vehicle Routing Problem with Time Windows under Uncertainty

    Manuel J. C. S. Reis*

    CMC-Computers, Materials & Continua, Vol.85, No.2, pp. 3023-3039, 2025, DOI:10.32604/cmc.2025.066390 - 23 September 2025

    Abstract The Vehicle Routing Problem with Time Windows (VRPTW) presents a significant challenge in combinatorial optimization, especially under real-world uncertainties such as variable travel times, service durations, and dynamic customer demands. These uncertainties make traditional deterministic models inadequate, often leading to suboptimal or infeasible solutions. To address these challenges, this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms (GA) with Local Search (LS), while incorporating stochastic uncertainty modeling through probabilistic travel times. The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance. This adaptivity enhances the algorithm’s… More >

  • Open Access

    ARTICLE

    Distributed Stochastic Optimization with Compression for Non-Strongly Convex Objectives

    Xuanjie Li, Yuedong Xu*

    CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.1, pp. 459-481, 2024, DOI:10.32604/cmes.2023.043247 - 30 December 2023

    Abstract We are investigating the distributed optimization problem, where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions. Since nodes exchange optimization parameters through the wireless network, large-scale training models can create communication bottlenecks, resulting in slower training times. To address this issue, CHOCO-SGD was proposed, which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions. Nevertheless, most convex functions are not strongly convex (such as logistic regression or Lasso), which raises the question of whether this… More >

  • Open Access

    REVIEW

    Deep Learning Applied to Computational Mechanics: A Comprehensive Review, State of the Art, and the Classics

    Loc Vu-Quoc1,*, Alexander Humer2

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1069-1343, 2023, DOI:10.32604/cmes.2023.028130 - 26 June 2023

    Abstract Three recent breakthroughs due to AI in arts and science serve as motivation: An award winning digital image, protein folding, fast matrix multiplication. Many recent developments in artificial neural networks, particularly deep learning (DL), applied and relevant to computational mechanics (solid, fluids, finite-element technology) are reviewed in detail. Both hybrid and pure machine learning (ML) methods are discussed. Hybrid methods combine traditional PDE discretizations with ML methods either (1) to help model complex nonlinear constitutive relations, (2) to nonlinearly reduce the model order for efficient simulation (turbulence), or (3) to accelerate the simulation by predicting… More >

  • Open Access

    ARTICLE

    An Endogenous Feedback and Entropy Analysis in Machine Learning Model for Stock’s Return Forecast

    Edson Vinicius Pontes Bastos1,*, Jorge Junio Moreira Antunes2, Lino Guimarães Marujo1, Peter Fernandes Wanke2, Roberto Ivo da Rocha Lima Filho1

    Intelligent Automation & Soft Computing, Vol.36, No.3, pp. 3175-3190, 2023, DOI:10.32604/iasc.2023.034582 - 15 March 2023

    Abstract Stock markets exhibit Brownian movement with random, non-linear, uncertain, evolutionary, non-parametric, nebulous, chaotic characteristics and dynamism with a high degree of complexity. Developing an algorithm to predict returns for decision-making is a challenging goal. In addition, the choice of variables that will serve as input to the model represents a non-triviality, since it is possible to observe endogeneity problems between the predictor and the predicted variables. Thus, the goal is to analyze the endogenous origin of the stock return prediction model based on technical indicators. For this, we structure a feed-forward neural network. We evaluate More >

  • Open Access

    ARTICLE

    Archery Algorithm: A Novel Stochastic Optimization Algorithm for Solving Optimization Problems

    Fatemeh Ahmadi Zeidabadi1, Mohammad Dehghani2, Pavel Trojovský2,*, Štěpán Hubálovský3, Victor Leiva4, Gaurav Dhiman5

    CMC-Computers, Materials & Continua, Vol.72, No.1, pp. 399-416, 2022, DOI:10.32604/cmc.2022.024736 - 24 February 2022

    Abstract Finding a suitable solution to an optimization problem designed in science is a major challenge. Therefore, these must be addressed utilizing proper approaches. Based on a random search space, optimization algorithms can find acceptable solutions to problems. Archery Algorithm (AA) is a new stochastic approach for addressing optimization problems that is discussed in this study. The fundamental idea of developing the suggested AA is to imitate the archer's shooting behavior toward the target panel. The proposed algorithm updates the location of each member of the population in each dimension of the search space by a… More >

  • Open Access

    ABSTRACT

    Robust Formation Design for the Magnetospheric Multiscale Mission using a Stochastic Optimization Approach

    C. W. T. Roscoe, S. R. Vadali, K. T. Alfriend

    The International Conference on Computational & Experimental Engineering and Sciences, Vol.20, No.1, pp. 17-18, 2011, DOI:10.3970/icces.2011.020.017

    Abstract A stochastic optimization approach is used to design a tetrahedral spacecraft formation for the NASA Magnetospheric Multiscale (MMS) mission whose performance characteristics are robust with respect to differential semimajor axis errors. The MMS mission requires a formation of four satellites which is to form a nearly regular tetrahedron near apogee of a highly eccentric orbit, and is to remain in this configuration throughout as many successive orbits as possible without maintenance maneuvers. When all design parameters are deterministic, such a formation can be designed by maximizing a "quality factor" throughout a "region of interest," either More >

Displaying 1-10 on page 1 of 7. Per Page