Juan Frausto Solís | Instituto Tecnológico de Ciudad Madero (original) (raw)
Papers by Juan Frausto Solís
The Chaotic Multiquenching Annealing algorithm (CMQA) is proposed. CMQA is a new algorithm, which... more The Chaotic Multiquenching Annealing algorithm (CMQA) is proposed. CMQA is a new algorithm, which is applied to protein folding problem (PFP). This algorithm is divided into three phases: (i) multiquenching phase (MQP), (ii) annealing phase (AP), and (iii) dynamical equilibrium phase (DEP). MQP enforces several stages of quick quenching processes that include chaotic functions. The chaotic functions can increase the exploration potential of solutions space of PFP. AP phase implements a simulated annealing algorithm (SA) with an exponential cooling function. MQP and AP are delimited by different ranges of temperatures; MQP is applied for a range of temperatures which goes from extremely high values to very high values; AP searches for solutions in a range of temperatures from high values to extremely low values. DEP phase finds the equilibrium in a dynamic way by applying least squares method. CMQA is tested with several instances of PFP.
Software Engineering Research and Practice, 2004
Journal of Intelligent and Fuzzy Systems, 2010
The only metric that had existed so far to determine the best algorithm for solving an general As... more The only metric that had existed so far to determine the best algorithm for solving an general Asymmetric Traveling Salesman Problem (ATSP) instance is based on the number of cities; nevertheless, it is not sufficiently adequate for discriminating the best algorithm for solving an ATSP instance, thus the necessity for devising a new metric through the use of data-mining techniques. In this paper we propose:(1) the use of a genetic distance metric for improving the selection of the algorithms that best solve a given instance of the ATSP and ...
Lecture Notes in Computer Science, 2009
In this paper, the application of Wolfe’s method in Support Vector Machines learning stage is pre... more In this paper, the application of Wolfe’s method in Support Vector Machines learning stage is presented. This stage is usually performed by solving a quadratic programming problem and a common approach for solving it, is breaking down that problem in smaller subproblems easier to solve and manage. In this manner, instead of dividing the problem, the application of Wolfe’s method
Lecture Notes in Computer Science, 2000
Page 1. O. Cairo, LE Sucar, and FJ Cantu (Eds.): MICAI 2000, LNAI 1793, pp. 6374, 2000. © Spring... more Page 1. O. Cairo, LE Sucar, and FJ Cantu (Eds.): MICAI 2000, LNAI 1793, pp. 6374, 2000. © Springer-Verlag Berlin Heidelberg 2000 A Methodology to Parallel the Temperature Cycle in Simulated Annealing Héctor Sanvicente Sánchez1 and Juan Frausto Solís2 ...
Lecture Notes in Computer Science, 2002
Page 1. CA Coello Coello et al. (Eds.): MICAI 2002, LNAI 2313, pp. 8997, 2002. © Springer-Verlag... more Page 1. CA Coello Coello et al. (Eds.): MICAI 2002, LNAI 2313, pp. 8997, 2002. © Springer-Verlag Berlin Heidelberg 2002 MPSA: A Methodology to Parallelize Simulated Annealing and Its Application to the Traveling Salesman Problem ...
Lecture Notes in Computer Science, 2000
Page 1. Cooperative Simulated Annealing for Path Planning in Multi-robot Systems Gildardo Sánchez... more Page 1. Cooperative Simulated Annealing for Path Planning in Multi-robot Systems Gildardo Sánchez-Ante, Fernando Ramos, and Juan Frausto Department of Computer Science ITESM Campus Morelos Av. Paseo de la Reforma 182-A Cuernavaca, Morelos, 62589 MEXICO ...
Lecture Notes in Computer Science, 2008
Course Timetabling Problem (CTP) is a well known NP hard problem. Many classical randomized algor... more Course Timetabling Problem (CTP) is a well known NP hard problem. Many classical randomized algorithms (as Genetic Algorithms, Simulated Annealing and Tabu Search) have been devised for this problem. For the previous PATAT benchmark, many of these old algorithms were able to find not only feasible solutions but even the optimal one. However, new harder CTP instances have recently proposed, which to obtain a feasible solution is a very hard challenge, and the previous algorithms do not perform well with these instances. Therefore, new algorithms for CTP should be devised. In this paper a new Simulating Annealing (SA) algorithm for CTP is presented. The algorithm shows a good performance not only with the old CTP instances but also with the new ones. This new SA implementation is able to find a feasible solution in instances where no other algorithm in the literature has been reported a success.
International Journal of Software Engineering and Knowledge Engineering, 2002
Cooperative Information Systems (CIS) become relevant to integrate different kinds of systems so ... more Cooperative Information Systems (CIS) become relevant to integrate different kinds of systems so as to work collaboratively for a common goal. CIS are considered by nature as dynamic systems, and one of the most difficult problems related to the dynamic of the system is how to model and control simultaneously multiple interactions among agents in a friendly way. Consequently, expressiveness becomes a problem related to the representation so far, the similar systems cope neither with the problem of expressiveness nor with multiple interactions in a satisfactory way. We propose in this paper, an integrated methodology based on Coloured Petri Nets (CPN) in order to model the interaction mechanism in a CIS and reduce the associated complexity in the representation of the dynamic of the system. This methodology provides us great advantages in the representation and reasoning for the interaction mechanism modeled in CIS. The methodology integrates mainly: a) the action basic loop in order to represent the system interactions and to model organization conversations, b) the CPN in the interaction design and system simulation, c) the communicative acts of FIPA (Foundation for Intelligent Physical Agents), including in the Agent Communication Language Specification.
Lecture Notes in Computer Science, 2005
Page 1. FF Ramos et al. (Eds.): ISSADS 2005, LNCS 3563, pp. 182193, 2005. © Springer-Verlag Berl... more Page 1. FF Ramos et al. (Eds.): ISSADS 2005, LNCS 3563, pp. 182193, 2005. © Springer-Verlag Berlin Heidelberg 2005 Modeling Multiple Interactions Using Coloured Petri Nets: A Case Study Francisco Camargo-Santacruz1 ...
Lecture Notes in Computer Science, 2005
Abstract. The Support Vector Machine (SVM) is a well known method used for classification, regres... more Abstract. The Support Vector Machine (SVM) is a well known method used for classification, regression and density estimation. Training a SVM consists in solving a Quadratic Programming (QP) problem. The QP problem is very resource consuming (computational time and ...
Lecture Notes in Computer Science, 2004
An algorithm of simulated annealing for the job shop scheduling problem is presented. The propose... more An algorithm of simulated annealing for the job shop scheduling problem is presented. The proposed algorithm restarts with a new value every time the previous algorithm finishes. To begin the process of annealing, the starting point is a randomly generated schedule with the condition that the initial value of the makespan of the schedule does not surpass a previously established upper bound. The experimental results show the importance of using upper bounds in simulated annealing in order to more quickly approach good solutions.
Lecture Notes in Computer Science, 2004
This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfia... more This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not a new issue, presented here is a new codification that needs fewer clauses in the SAT formula for JSSP instances than those used in previous works. The codification proposed, which has been named the Reduced Sat Formula (RSF), uses the value of the latest starting time of each operation in a JSSP instance to evaluate RSF. The latest starting time is obtained using a procedure that finds the critical path in a graph. This work presents experimental results and analytical arguments showing that the new representation improves efficiency in finding a starting solution for JSSP instances.
Lecture Notes in Computer Science, 2007
In this paper a Simulated Annealing algorithm (SA) for solving the Protein Folding Problem (PFP) ... more In this paper a Simulated Annealing algorithm (SA) for solving the Protein Folding Problem (PFP) is presented. This algorithm has two phases: quenching and annealing. The first phase is applied at very high temperatures and the annealing phase is applied at high and low temperatures. The temperature during the quenching phase is decreased by an exponential function. We run through an efficient analytical method to tune the algorithm parameters. This method allows the change of the temperature in accordance with solution quality, which can save large amounts of execution time for PFP.
Lecture Notes in Computer Science, 2004
This paper deals with heuristic algorithm selection, which can be stated as follows: given a set ... more This paper deals with heuristic algorithm selection, which can be stated as follows: given a set of solved instances of a NP-hard problem, for a new instance to predict which algorithm solves it better. For this problem, there are two main selection approaches. The first one consists of developing functions to relate performance to problem size. In the second more characteristics are incorporated, however they are not defined formally, neither systematically. In contrast, we propose a methodology to model algorithm performance predictors that incorporate critical characteristics. The relationship among performance and characteristics is learned from historical data using machine learning techniques. To validate our approach we carried out experiments using an extensive test set. In particular, for the classical bin packing problem, we developed predictors that incorporate the interrelation among five critical characteristics and the performance of seven heuristic algorithms. We obtained an accuracy of 81% in the selection of the best algorithm.
Lecture Notes in Computer Science, 2004
In this paper, a new mechanism for automatically obtaining some control parameter values for Gene... more In this paper, a new mechanism for automatically obtaining some control parameter values for Genetic Algorithms is presented, which is independent of problem domain and size. This approach differs from the traditional methods which require knowing first the problem domain, and then knowing how to select the parameter values for solving specific problem instances. The proposed method is based on a sample of problem instances, whose solution permits to characterize the problem and to obtain the parameter values. To test ...
Lecture Notes in Computer Science, 2008
The problem of algorithm selection for solving NP problems arises with the appearance of a variet... more The problem of algorithm selection for solving NP problems arises with the appearance of a variety of heuristic algorithms. The first works claimed the supremacy of some algorithm for a given problem. Subsequent works revealed the supremacy of algorithms only applied to a subset of instances. However, it was not explained why an algorithm solved better a subset of instances. In this respect, this work approaches the problem of explaining through causal model the interrelations between instances characteristics and the inner workings of ...
Lecture Notes in Computer Science, 2005
In this paper we deal with the solution of very large instances of the design distribution proble... more In this paper we deal with the solution of very large instances of the design distribution problem for distributed databases. Traditionally the capacity for solving large scale instances of NP-hard problems has been limited by the available computing resources and the efficiency of the solution algorithms. In contrast, in this paper we present a new solution approach that permits to solve larger instances using the same resources. This approach consists of the application of a systematic method for transforming an instance A into a ...
Lecture Notes in Computer Science, 2003
Abstract In this paper we address the problem of replication, allocation and mobility of large da... more Abstract In this paper we address the problem of replication, allocation and mobility of large data-objects in network environments that may be exposed to significant changes in users' location, usage and access patterns. In these circumstances, if the design is not adapted to the new changes, the system can undergo a severe degradation in data access costs and response time. In order to solve this problem, we propose a formal model to generate a new data-object allocation and replication. The model uses current state information of the ...
Lecture Notes in Computer Science, 2004
This paper deals with heuristic algorithm characterization, which is applied to the solution of a... more This paper deals with heuristic algorithm characterization, which is applied to the solution of an NP-hard problem, in order to select the best algorithm for solving a given problem instance. The traditional approach for selecting algorithms compares their performance using an instance set, and concludes that one outperforms the other. Another common approach consists of developing mathematical models to relate performance to problem size. Recent approaches try to incorporate more characteristics. However, they do not ...
The Chaotic Multiquenching Annealing algorithm (CMQA) is proposed. CMQA is a new algorithm, which... more The Chaotic Multiquenching Annealing algorithm (CMQA) is proposed. CMQA is a new algorithm, which is applied to protein folding problem (PFP). This algorithm is divided into three phases: (i) multiquenching phase (MQP), (ii) annealing phase (AP), and (iii) dynamical equilibrium phase (DEP). MQP enforces several stages of quick quenching processes that include chaotic functions. The chaotic functions can increase the exploration potential of solutions space of PFP. AP phase implements a simulated annealing algorithm (SA) with an exponential cooling function. MQP and AP are delimited by different ranges of temperatures; MQP is applied for a range of temperatures which goes from extremely high values to very high values; AP searches for solutions in a range of temperatures from high values to extremely low values. DEP phase finds the equilibrium in a dynamic way by applying least squares method. CMQA is tested with several instances of PFP.
Software Engineering Research and Practice, 2004
Journal of Intelligent and Fuzzy Systems, 2010
The only metric that had existed so far to determine the best algorithm for solving an general As... more The only metric that had existed so far to determine the best algorithm for solving an general Asymmetric Traveling Salesman Problem (ATSP) instance is based on the number of cities; nevertheless, it is not sufficiently adequate for discriminating the best algorithm for solving an ATSP instance, thus the necessity for devising a new metric through the use of data-mining techniques. In this paper we propose:(1) the use of a genetic distance metric for improving the selection of the algorithms that best solve a given instance of the ATSP and ...
Lecture Notes in Computer Science, 2009
In this paper, the application of Wolfe’s method in Support Vector Machines learning stage is pre... more In this paper, the application of Wolfe’s method in Support Vector Machines learning stage is presented. This stage is usually performed by solving a quadratic programming problem and a common approach for solving it, is breaking down that problem in smaller subproblems easier to solve and manage. In this manner, instead of dividing the problem, the application of Wolfe’s method
Lecture Notes in Computer Science, 2000
Page 1. O. Cairo, LE Sucar, and FJ Cantu (Eds.): MICAI 2000, LNAI 1793, pp. 6374, 2000. © Spring... more Page 1. O. Cairo, LE Sucar, and FJ Cantu (Eds.): MICAI 2000, LNAI 1793, pp. 6374, 2000. © Springer-Verlag Berlin Heidelberg 2000 A Methodology to Parallel the Temperature Cycle in Simulated Annealing Héctor Sanvicente Sánchez1 and Juan Frausto Solís2 ...
Lecture Notes in Computer Science, 2002
Page 1. CA Coello Coello et al. (Eds.): MICAI 2002, LNAI 2313, pp. 8997, 2002. © Springer-Verlag... more Page 1. CA Coello Coello et al. (Eds.): MICAI 2002, LNAI 2313, pp. 8997, 2002. © Springer-Verlag Berlin Heidelberg 2002 MPSA: A Methodology to Parallelize Simulated Annealing and Its Application to the Traveling Salesman Problem ...
Lecture Notes in Computer Science, 2000
Page 1. Cooperative Simulated Annealing for Path Planning in Multi-robot Systems Gildardo Sánchez... more Page 1. Cooperative Simulated Annealing for Path Planning in Multi-robot Systems Gildardo Sánchez-Ante, Fernando Ramos, and Juan Frausto Department of Computer Science ITESM Campus Morelos Av. Paseo de la Reforma 182-A Cuernavaca, Morelos, 62589 MEXICO ...
Lecture Notes in Computer Science, 2008
Course Timetabling Problem (CTP) is a well known NP hard problem. Many classical randomized algor... more Course Timetabling Problem (CTP) is a well known NP hard problem. Many classical randomized algorithms (as Genetic Algorithms, Simulated Annealing and Tabu Search) have been devised for this problem. For the previous PATAT benchmark, many of these old algorithms were able to find not only feasible solutions but even the optimal one. However, new harder CTP instances have recently proposed, which to obtain a feasible solution is a very hard challenge, and the previous algorithms do not perform well with these instances. Therefore, new algorithms for CTP should be devised. In this paper a new Simulating Annealing (SA) algorithm for CTP is presented. The algorithm shows a good performance not only with the old CTP instances but also with the new ones. This new SA implementation is able to find a feasible solution in instances where no other algorithm in the literature has been reported a success.
International Journal of Software Engineering and Knowledge Engineering, 2002
Cooperative Information Systems (CIS) become relevant to integrate different kinds of systems so ... more Cooperative Information Systems (CIS) become relevant to integrate different kinds of systems so as to work collaboratively for a common goal. CIS are considered by nature as dynamic systems, and one of the most difficult problems related to the dynamic of the system is how to model and control simultaneously multiple interactions among agents in a friendly way. Consequently, expressiveness becomes a problem related to the representation so far, the similar systems cope neither with the problem of expressiveness nor with multiple interactions in a satisfactory way. We propose in this paper, an integrated methodology based on Coloured Petri Nets (CPN) in order to model the interaction mechanism in a CIS and reduce the associated complexity in the representation of the dynamic of the system. This methodology provides us great advantages in the representation and reasoning for the interaction mechanism modeled in CIS. The methodology integrates mainly: a) the action basic loop in order to represent the system interactions and to model organization conversations, b) the CPN in the interaction design and system simulation, c) the communicative acts of FIPA (Foundation for Intelligent Physical Agents), including in the Agent Communication Language Specification.
Lecture Notes in Computer Science, 2005
Page 1. FF Ramos et al. (Eds.): ISSADS 2005, LNCS 3563, pp. 182193, 2005. © Springer-Verlag Berl... more Page 1. FF Ramos et al. (Eds.): ISSADS 2005, LNCS 3563, pp. 182193, 2005. © Springer-Verlag Berlin Heidelberg 2005 Modeling Multiple Interactions Using Coloured Petri Nets: A Case Study Francisco Camargo-Santacruz1 ...
Lecture Notes in Computer Science, 2005
Abstract. The Support Vector Machine (SVM) is a well known method used for classification, regres... more Abstract. The Support Vector Machine (SVM) is a well known method used for classification, regression and density estimation. Training a SVM consists in solving a Quadratic Programming (QP) problem. The QP problem is very resource consuming (computational time and ...
Lecture Notes in Computer Science, 2004
An algorithm of simulated annealing for the job shop scheduling problem is presented. The propose... more An algorithm of simulated annealing for the job shop scheduling problem is presented. The proposed algorithm restarts with a new value every time the previous algorithm finishes. To begin the process of annealing, the starting point is a randomly generated schedule with the condition that the initial value of the makespan of the schedule does not surpass a previously established upper bound. The experimental results show the importance of using upper bounds in simulated annealing in order to more quickly approach good solutions.
Lecture Notes in Computer Science, 2004
This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfia... more This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not a new issue, presented here is a new codification that needs fewer clauses in the SAT formula for JSSP instances than those used in previous works. The codification proposed, which has been named the Reduced Sat Formula (RSF), uses the value of the latest starting time of each operation in a JSSP instance to evaluate RSF. The latest starting time is obtained using a procedure that finds the critical path in a graph. This work presents experimental results and analytical arguments showing that the new representation improves efficiency in finding a starting solution for JSSP instances.
Lecture Notes in Computer Science, 2007
In this paper a Simulated Annealing algorithm (SA) for solving the Protein Folding Problem (PFP) ... more In this paper a Simulated Annealing algorithm (SA) for solving the Protein Folding Problem (PFP) is presented. This algorithm has two phases: quenching and annealing. The first phase is applied at very high temperatures and the annealing phase is applied at high and low temperatures. The temperature during the quenching phase is decreased by an exponential function. We run through an efficient analytical method to tune the algorithm parameters. This method allows the change of the temperature in accordance with solution quality, which can save large amounts of execution time for PFP.
Lecture Notes in Computer Science, 2004
This paper deals with heuristic algorithm selection, which can be stated as follows: given a set ... more This paper deals with heuristic algorithm selection, which can be stated as follows: given a set of solved instances of a NP-hard problem, for a new instance to predict which algorithm solves it better. For this problem, there are two main selection approaches. The first one consists of developing functions to relate performance to problem size. In the second more characteristics are incorporated, however they are not defined formally, neither systematically. In contrast, we propose a methodology to model algorithm performance predictors that incorporate critical characteristics. The relationship among performance and characteristics is learned from historical data using machine learning techniques. To validate our approach we carried out experiments using an extensive test set. In particular, for the classical bin packing problem, we developed predictors that incorporate the interrelation among five critical characteristics and the performance of seven heuristic algorithms. We obtained an accuracy of 81% in the selection of the best algorithm.
Lecture Notes in Computer Science, 2004
In this paper, a new mechanism for automatically obtaining some control parameter values for Gene... more In this paper, a new mechanism for automatically obtaining some control parameter values for Genetic Algorithms is presented, which is independent of problem domain and size. This approach differs from the traditional methods which require knowing first the problem domain, and then knowing how to select the parameter values for solving specific problem instances. The proposed method is based on a sample of problem instances, whose solution permits to characterize the problem and to obtain the parameter values. To test ...
Lecture Notes in Computer Science, 2008
The problem of algorithm selection for solving NP problems arises with the appearance of a variet... more The problem of algorithm selection for solving NP problems arises with the appearance of a variety of heuristic algorithms. The first works claimed the supremacy of some algorithm for a given problem. Subsequent works revealed the supremacy of algorithms only applied to a subset of instances. However, it was not explained why an algorithm solved better a subset of instances. In this respect, this work approaches the problem of explaining through causal model the interrelations between instances characteristics and the inner workings of ...
Lecture Notes in Computer Science, 2005
In this paper we deal with the solution of very large instances of the design distribution proble... more In this paper we deal with the solution of very large instances of the design distribution problem for distributed databases. Traditionally the capacity for solving large scale instances of NP-hard problems has been limited by the available computing resources and the efficiency of the solution algorithms. In contrast, in this paper we present a new solution approach that permits to solve larger instances using the same resources. This approach consists of the application of a systematic method for transforming an instance A into a ...
Lecture Notes in Computer Science, 2003
Abstract In this paper we address the problem of replication, allocation and mobility of large da... more Abstract In this paper we address the problem of replication, allocation and mobility of large data-objects in network environments that may be exposed to significant changes in users' location, usage and access patterns. In these circumstances, if the design is not adapted to the new changes, the system can undergo a severe degradation in data access costs and response time. In order to solve this problem, we propose a formal model to generate a new data-object allocation and replication. The model uses current state information of the ...
Lecture Notes in Computer Science, 2004
This paper deals with heuristic algorithm characterization, which is applied to the solution of a... more This paper deals with heuristic algorithm characterization, which is applied to the solution of an NP-hard problem, in order to select the best algorithm for solving a given problem instance. The traditional approach for selecting algorithms compares their performance using an instance set, and concludes that one outperforms the other. Another common approach consists of developing mathematical models to relate performance to problem size. Recent approaches try to incorporate more characteristics. However, they do not ...