Search

Your search keyword '"Cruz ‐ Chávez, Marco Antonio"' showing total 45 results
Start Over Author "Cruz ‐ Chávez, Marco Antonio"
45 results on '"Cruz ‐ Chávez, Marco Antonio"'

1. Comparative Study of the Starting Stage of Adaptive Differential Evolution on the Induction of Oblique Decision Trees

Author

Morales-Hernández, Miguel Ángel, Rivera-López, Rafael, Mezura-Montes, Efrén, Canul-Reich, Juana, Cruz-Chávez, Marco Antonio, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Calvo, Hiram, editor, Martínez-Villaseñor, Lourdes, editor, Ponce, Hiram, editor, Zatarain Cabada, Ramón, editor, Montes Rivera, Martín, editor, and Mezura-Montes, Efrén, editor

Published
2024
Full Text
View/download PDF

5. Iterated local search for the label printing problem.

Author

Alonso-Pecina, Federico, Romero, David, and Cruz-Chávez, Marco Antonio

Subjects
LABEL printing, COMBINATORIAL optimization, HEURISTIC, INTEGER programming
Abstract

In the label printing problem (LPP), a set of labels must be printed in specified quantities, using n templates to be defined. Each template can accommodate a fixed number of printing plates. The LPP consists of determining: (1) an n-partition of the labels, where each block defines the labels that share a template, (2) for each label the number of identical printing plates to place in one of the n templates, and (3) the number of imprints to make with each template. The objective is to satisfy the labels' demand while minimising total waste. Since the LPP is NP-Hard, to solve it, we propose here an Iterated Local Search heuristic that, once tested on all the instances available to us, it improved many of the best known results or find the optimum, when it is known. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

7. Variable Neighborhood Search for Non-deterministic Problems

Author

Cruz-Chávez, Marco Antonio, Martínez-Oropeza, Alina, del Carmen Peralta-Abarca, Jesús, Cruz-Rosales, Martín Heriberto, Martínez-Rangel, Martín, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Tanaka, Yuzuru, editor, Wahlster, Wolfgang, editor, Siekmann, Jörg, editor, Rutkowski, Leszek, editor, Korytkowski, Marcin, editor, Scherer, Rafał, editor, Tadeusiewicz, Ryszard, editor, Zadeh, Lotfi A., editor, and Zurada, Jacek M., editor

Published
2014
Full Text
View/download PDF

8. Search Space Analysis for the Combined Mathematical Model (Linear and Nonlinear) of the Water Distribution Network Design Problem

Author

Cruz-Chávez, Marco Antonio, Ávila-Melgar, Érika Yesenia, Cruz-Rosales, Martín Heriberlo, Martínez-Bahena, Beatriz, Flores-Sánchez, Guillermo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Tanaka, Yuzuru, editor, Wahlster, Wolfgang, editor, Siekmann, Jörg, editor, Rutkowski, Leszek, editor, Korytkowski, Marcin, editor, Scherer, Rafał, editor, Tadeusiewicz, Ryszard, editor, Zadeh, Lotfi A., editor, and Zurada, Jacek M., editor

Published
2014
Full Text
View/download PDF

10. A Local Search Algorithm for a SAT Representation of Scheduling Problems

Author

Cruz-Chávez, Marco Antonio, Rivera-López, Rafael, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gervasi, Osvaldo, editor, and Gavrilova, Marina L., editor

Published
2007
Full Text
View/download PDF

11. A New Algorithm That Obtains an Approximation of the Critical Path in the Job Shop Scheduling Problem

Author

Cruz-Chávez, Marco Antonio, Frausto-Solís, Juan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Gelbukh, Alexander, editor, and Reyes-Garcia, Carlos Alberto, editor

Published
2006
Full Text
View/download PDF

12. Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds

Author

Cruz-Chavez, Marco Antonio, Frausto-Solis, Juan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Rutkowski, Leszek, editor, Siekmann, Jörg H., editor, Tadeusiewicz, Ryszard, editor, and Zadeh, Lotfi A., editor

Published
2004
Full Text
View/download PDF

13. A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems

Author

Frausto-Solis, Juan, Cruz-Chavez, Marco Antonio, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Laganá, Antonio, editor, Gavrilova, Marina L., editor, Kumar, Vipin, editor, Mun, Youngsong, editor, Tan, C. J. Kenneth, editor, and Gervasi, Osvaldo, editor

Published
2004
Full Text
View/download PDF

24. A General Model for the Design of Efficient Sign-Coding Tools for Wavelet-Based Encoders

Author

Universitat Politècnica de València. Departamento de Informática de Sistemas y Computadores - Departament d'Informàtica de Sistemes i Computadors, European Regional Development Fund, Agencia Estatal de Investigación, López-Granado, Otoniel Mario, Martínez-Rach, Miguel Onofre, Martí-Campoy, Antonio, Cruz-Chávez, Marco Antonio, Pérez Malumbres, Manuel, Universitat Politècnica de València. Departamento de Informática de Sistemas y Computadores - Departament d'Informàtica de Sistemes i Computadors, European Regional Development Fund, Agencia Estatal de Investigación, López-Granado, Otoniel Mario, Martínez-Rach, Miguel Onofre, Martí-Campoy, Antonio, Cruz-Chávez, Marco Antonio, and Pérez Malumbres, Manuel

Abstract

[EN] Traditionally, it has been assumed that the compression of the sign of wavelet coefficients is not worth the effort because they form a zero-mean process. However, several image encoders such as JPEG 2000 include sign-coding capabilities. In this paper, we analyze the convenience of including sign-coding techniques into wavelet-based image encoders and propose a methodology that allows the design of sign-prediction tools for whatever kind of wavelet-based encoder. The proposed methodology is based on the use of metaheuristic algorithms to find the best sign prediction with the most appropriate context distribution that maximizes the resulting sign-compression rate of a particular wavelet encoder. Following our proposal, we have designed and implemented a sign-coding module for the LTW wavelet encoder, to evaluate the benefits of the sign-coding tool provided by our proposed methodology. The experimental results show that sign compression can save up to 18.91% of bit-rate when enabling sign-coding capabilities. Also, we have observed two general behaviors when coding the sign of wavelet coefficients: (a) the best results are provided from moderate to high compression rates; and (b) the sign redundancy may be better exploited when working with high-textured images.

Published
2020

36. Aplicación de la teoría de la complejidad en optimización combinatoria

Author

Cruz Chávez, Marco Antonio, Moreno Bernal, Pedro, Peralta Abarca, Jesús del Carmen, Cruz Chávez, Marco Antonio, Moreno Bernal, Pedro, and Peralta Abarca, Jesús del Carmen

Abstract

Existen problemas cuya solución computarizada puede tardar años en obtenerse, como el problema del ‘agente viajero’. Éste tiene aplicación real en empresas que necesitan reducir costos de transporte o el problema de la mochila donde debe maximizarse la carga de objetos en ésta, sin exceder el peso permitido. Este problema se aplica, por ejemplo, en empresas que requieren almacenar una gran cantidad de productos. Para todos los problemas existe al menos un algoritmo de solución. El proceso de los programas de solución de problemas y las dos variables para medir el rendimiento de éstos –memoria ocupada y tiempo de ejecución–, son analizadas en este artículo . Por otro lado, se proporciona una descripción de la teoría de la complejidad de acuerdo con la máquina de Turing y su impacto en la investigación computacional. Finalmente, se destaca el caso de la UAEM, donde se han diseñado y aplicado heurísticas computacionales, para obtener soluciones a problemas como el ruteo vehicular.

Published
2014

37. Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem.

Author

Cruz ‐ Chávez, Marco Antonio, Martínez ‐ Rangel, Martín G., and Cruz ‐ Rosales, Martín H.

Subjects
SIMULATED annealing, PRODUCTION scheduling, STANDARD deviations, STOCHASTIC convergence, MATHEMATICAL analysis
Abstract

This paper presents a simulated annealing algorithm accelerated by a partial scheduling mechanism and a cooling schedule mechanism that is a function of the standard deviation. This facilitates a rapid approach to good solutions in the flexible job shop scheduling problem (FJSSP). The results demonstrate that for benchmark instances of several sizes, simulated annealing that implements the proposed mechanism converges more quickly to good solutions than simulated annealing that does not implement the proposed mechanism. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

41. Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems.

Author

Cruz-Chávez, Marco Antonio

Subjects
*NEIGHBORHOODS, *JOB shops, *PRODUCTION scheduling, *FEASIBILITY studies, *PERMUTATIONS
Abstract

This paper presents a neighbourhood generation mechanism for the job shop scheduling problems (JSSPs). In order to obtain a feasible neighbour with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack time between the adjacent pair of operations that is permuted, then it is proven, through theory and experimentation, that the new neighbour (schedule) generated is feasible. It is demonstrated that the neighbourhood generation mechanism is very efficient and effective in a simulated annealing. [ABSTRACT FROM PUBLISHER]

Published
2015
Full Text
View/download PDF

42. General methodology for using Epanet as an optimization element in evolutionary algorithms in a grid computing environment for water distribution network design.

Author

Avila-Melgar, Erika Yesenia, Cruz-Chávez, Marco Antonio, and Martinez-Bahena, Beatriz

Subjects
EVOLUTIONARY algorithms, GRID computing, WATER distribution, ENERGY conservation, OPTIMAL designs (Statistics)
Abstract

In this paper, an evolutionary algorithm, called EA-WDND, is developed to optimize water distribution network design for real instances. The evolutionary algorithm uses the Epanet Solver which, while not an optimizer, helps to evaluate the operational constraints of mass conservation, energy conservation, pressure in nodes (nodal heads) of the network, and velocities of water in network pipes. Epanet is used by the EA-WDND to evaluate whether the looped network is operating properly. Consequently, the EA-WDND obtains feasible configurations of network design. The best configuration, which has the lowest cost and best performance according to defined constraints, is obtained by the EA-WDND. This configuration can be practically implemented in real life. In this paper, a methodology for using Epanet Solver with a parallel evolutionary algorithm is presented. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

44. A Local Search Algorithm for a SAT Representation of Scheduling Problems.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Gervasi, Osvaldo, Gavrilova, Marina L., Cruz-Chávez, Marco Antonio, and Rivera-López, Rafael

Abstract

This paper presents the application of a local search algorithm for a logical representation of the Job Shop Scheduling Problem (JSSP). This logical representation represents the JSSP transformed as a satisfiability problem (SAT). The proposed algorithm uses a local search in a wide neighborhood. This algorithm, called Walk Wide Search - SAT, is a variant of the WalkSAT algorithm. This search is possible because the included tabu list prevents an excessive number of repetitions of movements during the search process. This paper describes the algorithm and compares results of Walk Wide Search - SAT to WalkSAT. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

45. Using a Genetic Algorithm with a Mathematical Programming Solver to Optimize a Real Water Distribution System.

Author

Martínez-Bahena, Beatriz, Cruz-Chávez, Marco Antonio, Ávila-Melgar, Erika Yesenia, Cruz-Rosales, Martín H., and Rivera-Lopez, Rafael

Subjects
GENETIC algorithms, WATER distribution, HYDRAULICS, WATER pressure, ENERGY conservation
Abstract

This research proposes a genetic algorithm that provides a solution to the problem of deficient distribution of drinking water via the current hydraulic network in the neighborhood "Fraccionamiento Real Montecasino" (FRM), in Huitzilac, Morelos, Mexico. The proposed solution is the addition of new elements to the FRM network. The new elements include storage tanks, pipes, and pressure-reducing valves. To evaluate the constraint satisfaction model of mass and energy conservation, the hydraulic EPANET solver (HES) is used with an optimization model to minimize the total cost of changes in the network (new pipes, tanks, and valves). A genetic algorithm was used to evaluate the optimization model. The analysis of the results obtained by the genetic algorithm for the FRM network shows that adequate and balanced pressures were obtained by means of small modifications to the existing network, which entailed minimal costs. Simulations were performed for an extended period, which means that the pressure was obtained by simulation with HSE at one-hour intervals, during the algorithm execution, to verify adequate pressure at a specific point in the system, or to make corrections to ensure proper distribution, this with the aim of having a final optimized network design. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results