A sim-learnheuristic algorithm for solving a capacitated dispersion problem under stochastic and non-static conditions

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A fundamental assumption in addressing real-world problems is acknowledging the presence of uncertainty and dynamism. Dismissing these factors can lead to the formulation of an optimal solution for an entirely different problem. This paper presents a novel variant of the capacitated dispersion problem (CDP) referred to as the stochastic and non-static CDP. The main objective of this problem is to strategically position facilities to achieve maximum dispersion while meeting the capacity demand constraint. The proposed approach combines stochastic and non-static elements, introducing a new paradigm to address the problem. This innovation allows us to consider more realistic and flexible environments. To solve this challenging problem, a novel sim-learnheuristic algorithm is proposed. This algorithm combines a biased-randomized metaheuristic (optimization component) with a simulation component (to model the uncertainty) and a machine learning component (to model non-static behavior). The non-static part works by using black box and white box mechanisms to learn the uncertainty with some related facilities’ variables. Based on an extended set of traditional benchmarks for the CDP, a series of computational experiments were carried out. The results demonstrate the effectiveness of the proposed sim-learnheuristic approach for solving the CDP under non-static and stochastic scenarios.

Cite

CITATION STYLE

APA

Ghorbani, E., Gomez, J. F., Panadero, J., & Juan, A. A. (2024). A sim-learnheuristic algorithm for solving a capacitated dispersion problem under stochastic and non-static conditions. AIMS Mathematics, 9(9), 24247–24270. https://doi.org/10.3934/math.20241180

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free