A Multi-Start Biased-Randomized Algorithm for the Capacitated Dispersion Problem
The capacitated dispersion problem is a variant of the maximum diversity problem in which a set of elements in a network must be determined. These elements might represent, for instance, facilities in a logistics network or transmission devices in a telecommunication network. Usually, it is consider...
Main Authors: | Juan F. Gomez, Javier Panadero, Rafael D. Tordecilla, Juliana Castaneda, Angel A. Juan |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-07-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/14/2405 |
Similar Items
-
A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions
by: Juan F. Gomez, et al.
Published: (2023-11-01) -
A Forward–Backward Simheuristic for the Stochastic Capacitated Dispersion Problem
by: Juan F. Gomez, et al.
Published: (2024-03-01) -
Biased-Randomized Discrete-Event Heuristics for Dynamic Optimization with Time Dependencies and Synchronization
by: Juliana Castaneda, et al.
Published: (2022-08-01) -
Solving NP-Hard Challenges in Logistics and Transportation under General Uncertainty Scenarios Using Fuzzy Simheuristics
by: Angel A. Juan, et al.
Published: (2023-12-01) -
Fuzzy Simheuristics for Optimizing Transportation Systems: Dealing with Stochastic and Fuzzy Uncertainty
by: Rafael D. Tordecilla, et al.
Published: (2021-08-01)