Repository logo
  • English
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Log In
    or
    New user? Click here to register.
Repository logo

Repositorio Institucional de la Universidad de Murcia

Repository logoRepository logo
  • Communities & Collections
  • All of DSpace
  • Statistics
  • menu.section.collectors
  • menu.section.acerca
  • English
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Log In
    or
    New user? Click here to register.
  1. Home
  2. Browse by Subject

Browsing by Subject "Heuristic algorithms"

Now showing 1 - 3 of 3
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Publication
    Open Access
    A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule
    (IOS PRESS, 2020) Fernández Hernández, Pascual; Lancinskas, Algirdas; Pelegrín Pelegrín, Blas; Zilinskas, Julius; Estadística e Investigación Operativa
    We consider a geographical region with spatially separated customers, whose demand is currently served by some pre-existing facilities owned by different firms. An entering firm wants to compete for this market locating some new facilities. Trying to guarantee a future satisfactory captured demand for each new facility, the firm imposes a constraint over its possible locations (a finite set of candidates): a new facility will be opened only if a minimal market share is captured in the short-term. To check that, it is necessary to know the exact captured demand by each new facility. It is supposed that customers follow the partially binary choice rule to satisfy its demand. If there are several new facilities with maximal attraction for a customer, we consider that the proportion of demand captured by the entering firm will be equally distributed among such facilities (equity-based rule). This ties breaking rule involves that we will deal with a nonlinear constrained discrete competitive facility location problem. Moreover, minimal attraction conditions for customers and distances approximated by intervals have been incorporated to deal with a more realistic model. To solve this nonlinear model, we first linearize the model, which allows to solve small size problems because of its complexity, and then, for bigger size problems, a heuristic algorithm is proposed, which could also be used to solve other constrained problems.
  • Loading...
    Thumbnail Image
    Publication
    Open Access
    Uncovering personal circadian responses to light through particle swarm optimization
    (Elsevier, 2023-11-19) Vicente Martínez, Jesús; Madrid, Juan Antonio; Rol de Lama, María de los Ángeles; Bonmatí Carrión, María de los Ángeles; Fisiología
    Background and objectives Kronauer's oscillator model of the human central pacemaker is one of the most commonly used approaches to study the human circadian response to light. Two sources of error when applying it to a personal light exposure have been identified: (1) as a populational model, it does not consider inter-individual variability, and (2) the initial conditions needed to integrate the model are usually unknown, and thus subjectively estimated. In this work, we evaluate the ability of particle swarm optimization (PSO) algorithms to simultaneously uncover the optimal initial conditions and individual parameters of a pre-defined Kronauer's oscillator model. Methods A Canonical PSO, a Dynamic Multi-Swarm PSO and a novel modification of the latter, namely Hierarchical Dynamic Multi-Swarm PSO, are evaluated. Two different target models (under a regular and an irregular schedule) are defined, and the same realistic light profile is fed to them. Based on their output, a fitness function is proposed, which is minimized by the algorithms to find the optimum set of parameters and initial conditions of the model. Results We demonstrate that Dynamic Multi-Swarm and Hierarchical Dynamic Multi-Swarm algorithms can accurately uncover personal circadian parameters under both regular and irregular schedules, but as expected, optimization is easier under a regular schedule. Circadian parameters play the most important role in the optimization process and should be prioritized over initial conditions, although assessment of the impact of misestimating the latter is recommended. The log-log linear relationship between mean absolute error and computational cost shows that the number of particles to use is at the discretion of the user. Conclusions The robustness and low errors achieved by the algorithms support their further testing, validation and systematic application to empirical data under a regular or irregular schedule. Uncovering personal circadian parameters can improve the assessment of the circadian status of a person and the applicability of personalized light therapies, as well as help to discover other factors that may lie behind the interindividual variability in the circadian response to light.
  • Loading...
    Thumbnail Image
    Publication
    Open Access
    Uncovering personal circadian responses to light through particle swarm optimization
    (Elsevier, 2023-11-25) Vicente-Martínez, Jesús; Madrid, Juan Antonio; Rol, María Ángeles; Bonmatí Carrión, María de los Ángeles; Anatomía Humana y Psicobiología
    Background and objectives: Kronauer’s oscillator model of the human central pacemaker is one of the most commonly used approaches to study the human circadian response to light. Two sources of error when applying it to a personal light exposure have been identified: (1) as a populational model, it does not consider interindividual variability, and (2) the initial conditions needed to integrate the model are usually unknown, and thus subjectively estimated. In this work, we evaluate the ability of particle swarm optimization (PSO) algorithms to simultaneously uncover the optimal initial conditions and individual parameters of a pre-defined Kronauer’s oscillator model. Methods: A Canonical PSO, a Dynamic Multi-Swarm PSO and a novel modification of the latter, namely Hierarchical Dynamic Multi-Swarm PSO, are evaluated. Two different target models (under a regular and an irregular schedule) are defined, and the same realistic light profile is fed to them. Based on their output, a fitness function is proposed, which is minimized by the algorithms to find the optimum set of parameters and initial conditions of the model. Results: We demonstrate that Dynamic Multi-Swarm and Hierarchical Dynamic Multi-Swarm algorithms can accurately uncover personal circadian parameters under both regular and irregular schedules, but as expected, optimization is easier under a regular schedule. Circadian parameters play the most important role in the optimization process and should be prioritized over initial conditions, although assessment of the impact of misestimating the latter is recommended. The log-log linear relationship between mean absolute error and computational cost shows that the number of particles to use is at the discretion of the user. Conclusions: The robustness and low errors achieved by the algorithms support their further testing, validation and systematic application to empirical data under a regular or irregular schedule. Uncovering personal circadian parameters can improve the assessment of the circadian status of a person and the applicability of personalized light therapies, as well as help to discover other factors that may lie behind the interindividual variability in the circadian response to light.

DSpace software copyright © 2002-2026 LYRASIS

  • Cookie settings
  • Accessibility
  • Send Feedback