Carlos Bermúdez

Universidad Autónoma de Chiapas (UNACH)

In the context of Simulated Annealing (SA) algorithms, a Markov chain transition corresponds to a move in the solution space. The number of transitions or the Markov chain (MC) length at each temperature step is usually constant and empirically set. However, adaptive methods to compute the MC length can be used. This work focus on the effect of usi...

A secure water distribution system is an essential element for any city in the world. The importance and huge capital cost of the system lead to their design optimization. However, the water distribution network design optimization is a multimodal and NP-hard problem, as a consequence, we propose an intelligent optimization solver based on a Parall...

A water distribution network consists of many nodes interconnected to provide water to consumers. The importance and huge capital cost of the system lead to their design optimization. The present work proposes an intelligent optimization solver based on a Hybrid Simulated Annealing (HSA) to solve this problem. One of the main HSA control parameters...

Flexible Job Shop Scheduling Problem (FJSP) is one of the most challenging combinatorial optimization problems, with practical applicability in a real production environment. In this work, we propose a simple Differential Evolution (DE) algorithm to tackle this problem. To represent an FJSSP solution, a real value representation is adopted, which r...

Sensor network design problem (SNDP) in process plants includes the determination of which process variables should be measured to achieve a required degree of knowledge about the plant. We propose to solve the SNDP problem in plants of increasing size and complexity using a hybrid algorithm based on Simulated Annealing (HSA) as main metaheuristic...

This work presents an optimization technique based on Simulated Annealing (SA) to solve the Water Distribution Network Design problem, considering multi-period restrictions with time varying demand patterns. The design optimization of this kind of networks is an important issue in modern cities, since a safe, adequate, and accessible supply of pota...

The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles and the sequencing of stops for each vehicle to minimize transportation costs. This paper presents two different genetic algorithm models (panmitic and cellular models) for providing solutions for the Capacitated VRP (CVRP), which is...

The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles and the sequencing of stops for each vehicle to minimize transportation costs. This paper presents two different genetic algorithm models (panmitic and cellular models) for providing solutions for the Capacitated VRP (CVRP), which is...

Se desarrolla una herramienta, Firesolutions, que implementa un modelo de AC bidimensionales consistente con las premisas y observaciones sobre propagación de incendios superficiales. Los parámetros claves están asociados con el tipo de vegetación combustible y la velocidad de propagación, en nuestro caso, asociadas a las suministradas por el INPAR...

Resumen La contribución de esta línea de investigación es el diseño e implementación de algoritmos evolutivos, tanto secuencia-les como paralelos, que puedan guiar el cambio de ciertos parámetros usando información del estado del proceso de búsqueda. El objetivo que se persigue es la reducción de los tiempos incurridos en la tradicional definición...