IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
R exam (B) given in Paris-Dauphine, Licence Mido, Jan. 11, 2013Christian Robert
This is one of two exams given to our students this year. They had two hours to solve three problems and had to return R codes as well as handwritten explanations.
Fuzzy clustering algorithm can not obtain good clustering effect when the sample characteristic is not
obvious and need to determine the number of clusters firstly. For thi0s reason, this paper proposes an
adaptive fuzzy kernel clustering algorithm. The algorithm firstly use the adaptive function of clustering
number to calculate the optimal clustering number, then the samples of input space is mapped to highdimensional
feature space using gaussian kernel and clustering in the feature space. The Matlab simulation
results confirmed that the algorithm's performance has greatly improvement than classical clustering algorithm and has faster convergence speed and more accurate clustering results
An Improved Adaptive Multi-Objective Particle Swarm Optimization for Disassem...IJRESJOURNAL
With the development of productivity and the fast growth of the economy, environmental pollution, resource utilization and low product recovery rate have emerged subsequently, so more and more attention has been paid to the recycling and reuse of products. However, since the complexity of disassembly line balancing problem (DLBP) increases with the number of parts in the product, finding the optimal balance is computationally intensive. In order to improve the computational ability of particle swarm optimization (PSO) algorithm in solving DLBP, this paper proposed an improved adaptive multi-objective particle swarm optimization (IAMOPSO) algorithm. Firstly, the evolution factor parameter is introduced to judge the state of evolution using the idea of fuzzy classification and then the feedback information from evolutionary environment is served in adjusting inertia weight, acceleration coefficients dynamically. Finally, a dimensional learning strategy based on information entropy is used in which each learning object is uncertain. The results from testing in using series of instances with different size verify the effect of proposed algorithm.
R exam (B) given in Paris-Dauphine, Licence Mido, Jan. 11, 2013Christian Robert
This is one of two exams given to our students this year. They had two hours to solve three problems and had to return R codes as well as handwritten explanations.
Fuzzy clustering algorithm can not obtain good clustering effect when the sample characteristic is not
obvious and need to determine the number of clusters firstly. For thi0s reason, this paper proposes an
adaptive fuzzy kernel clustering algorithm. The algorithm firstly use the adaptive function of clustering
number to calculate the optimal clustering number, then the samples of input space is mapped to highdimensional
feature space using gaussian kernel and clustering in the feature space. The Matlab simulation
results confirmed that the algorithm's performance has greatly improvement than classical clustering algorithm and has faster convergence speed and more accurate clustering results
An Improved Adaptive Multi-Objective Particle Swarm Optimization for Disassem...IJRESJOURNAL
With the development of productivity and the fast growth of the economy, environmental pollution, resource utilization and low product recovery rate have emerged subsequently, so more and more attention has been paid to the recycling and reuse of products. However, since the complexity of disassembly line balancing problem (DLBP) increases with the number of parts in the product, finding the optimal balance is computationally intensive. In order to improve the computational ability of particle swarm optimization (PSO) algorithm in solving DLBP, this paper proposed an improved adaptive multi-objective particle swarm optimization (IAMOPSO) algorithm. Firstly, the evolution factor parameter is introduced to judge the state of evolution using the idea of fuzzy classification and then the feedback information from evolutionary environment is served in adjusting inertia weight, acceleration coefficients dynamically. Finally, a dimensional learning strategy based on information entropy is used in which each learning object is uncertain. The results from testing in using series of instances with different size verify the effect of proposed algorithm.
Simple representations for learning: factorizations and similarities Gael Varoquaux
Real-life data seldom comes in the ideal form for statistical learning.
This talk focuses on high-dimensional problems for signals and
discrete entities: when dealing with many, correlated, signals or
entities, it is useful to extract representations that capture these
correlations.
Matrix factorization models provide simple but powerful representations. They are used for recommender systems across discrete entities such as users and products, or to learn good dictionaries to represent images. However they entail large computing costs on very high-dimensional data, databases with many products or high-resolution images. I will present an
algorithm to factorize huge matrices based on stochastic subsampling that gives up to 10-fold speed-ups [1].
With discrete entities, the explosion of dimensionality may be due to variations in how a smaller number of categories are represented. Such a problem of "dirty categories" is typical of uncurated data sources. I will discuss how encoding this data based on similarities recovers a useful category structure with no preprocessing. I will show how it interpolates between one-hot encoding and techniques used in character-level natural language processing.
[1] Stochastic subsampling for factorizing huge matrices, A Mensch, J Mairal, B Thirion, G Varoquaux, IEEE Transactions on Signal Processing 66 (1), 113-128
[2] Similarity encoding for learning with dirty categorical variables. P Cerda, G Varoquaux, B Kégl Machine Learning (2018): 1-18
Accelerating Random Forests in Scikit-LearnGilles Louppe
Random Forests are without contest one of the most robust, accurate and versatile tools for solving machine learning tasks. Implementing this algorithm properly and efficiently remains however a challenging task involving issues that are easily overlooked if not considered with care. In this talk, we present the Random Forests implementation developed within the Scikit-Learn machine learning library. In particular, we describe the iterative team efforts that led us to gradually improve our codebase and eventually make Scikit-Learn's Random Forests one of the most efficient implementations in the scientific ecosystem, across all libraries and programming languages. Algorithmic and technical optimizations that have made this possible include:
- An efficient formulation of the decision tree algorithm, tailored for Random Forests;
- Cythonization of the tree induction algorithm;
- CPU cache optimizations, through low-level organization of data into contiguous memory blocks;
- Efficient multi-threading through GIL-free routines;
- A dedicated sorting procedure, taking into account the properties of data;
- Shared pre-computations whenever critical.
Overall, we believe that lessons learned from this case study extend to a broad range of scientific applications and may be of interest to anybody doing data analysis in Python.
Many biological systems exhibit heterogeneiety on a population level. This heterogeneity can be captured by describing the temporal evolution of the probability of an individual in the population to be in a certain state as partial differential equation. To tune parameters of such a partial differential equation to experimental data, a partial differential equation constrained optimisation problem has to be solved. Hence, for biological systems with a large number of states, a high-dimensional partial differential equation has to be solved. This can easily render the optimisation problem intractable, As there are no well-established, efficient integration schemes for high dimensional partial differential equations available. In this talk we will present techniques to translate the partial differential equation constrained optimization problem into a hierarchical, ordinary differential equation constrained optimization problem given a certain set of assumptions. We will present these assumptionas as well as the derivation of the hierarchical, ordinary differential equation constrained optimisation problem. Moreover we will present numerical schemes for the computation of the respective objective function and its gradient. Eventually we will also present numerical schemes to solve the constrained optimisation problem and apply these techniques to small and large scale biological applications for which experimental data is available.
Decline of Real Power Loss and Preservation of Voltage Stability by using Chi...ijeei-iaes
In this paper, a new Chirping Algorithm (CA) is developed based on the chirping behaviour of crickets for solving the reactive power optimization problem. It is based on the chirping behaviour of crickets (insect) found almost everywhere around the world. The proposed Chirping Algorithm (CA) has been tested in standard IEEE 30, 57,118 bus test systems and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss and control variables are well within the limits.
Production and characterization of nano copper powder using electric explosio...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
No sql databases new millennium database for big data, big users, cloud compu...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Simple representations for learning: factorizations and similarities Gael Varoquaux
Real-life data seldom comes in the ideal form for statistical learning.
This talk focuses on high-dimensional problems for signals and
discrete entities: when dealing with many, correlated, signals or
entities, it is useful to extract representations that capture these
correlations.
Matrix factorization models provide simple but powerful representations. They are used for recommender systems across discrete entities such as users and products, or to learn good dictionaries to represent images. However they entail large computing costs on very high-dimensional data, databases with many products or high-resolution images. I will present an
algorithm to factorize huge matrices based on stochastic subsampling that gives up to 10-fold speed-ups [1].
With discrete entities, the explosion of dimensionality may be due to variations in how a smaller number of categories are represented. Such a problem of "dirty categories" is typical of uncurated data sources. I will discuss how encoding this data based on similarities recovers a useful category structure with no preprocessing. I will show how it interpolates between one-hot encoding and techniques used in character-level natural language processing.
[1] Stochastic subsampling for factorizing huge matrices, A Mensch, J Mairal, B Thirion, G Varoquaux, IEEE Transactions on Signal Processing 66 (1), 113-128
[2] Similarity encoding for learning with dirty categorical variables. P Cerda, G Varoquaux, B Kégl Machine Learning (2018): 1-18
Accelerating Random Forests in Scikit-LearnGilles Louppe
Random Forests are without contest one of the most robust, accurate and versatile tools for solving machine learning tasks. Implementing this algorithm properly and efficiently remains however a challenging task involving issues that are easily overlooked if not considered with care. In this talk, we present the Random Forests implementation developed within the Scikit-Learn machine learning library. In particular, we describe the iterative team efforts that led us to gradually improve our codebase and eventually make Scikit-Learn's Random Forests one of the most efficient implementations in the scientific ecosystem, across all libraries and programming languages. Algorithmic and technical optimizations that have made this possible include:
- An efficient formulation of the decision tree algorithm, tailored for Random Forests;
- Cythonization of the tree induction algorithm;
- CPU cache optimizations, through low-level organization of data into contiguous memory blocks;
- Efficient multi-threading through GIL-free routines;
- A dedicated sorting procedure, taking into account the properties of data;
- Shared pre-computations whenever critical.
Overall, we believe that lessons learned from this case study extend to a broad range of scientific applications and may be of interest to anybody doing data analysis in Python.
Many biological systems exhibit heterogeneiety on a population level. This heterogeneity can be captured by describing the temporal evolution of the probability of an individual in the population to be in a certain state as partial differential equation. To tune parameters of such a partial differential equation to experimental data, a partial differential equation constrained optimisation problem has to be solved. Hence, for biological systems with a large number of states, a high-dimensional partial differential equation has to be solved. This can easily render the optimisation problem intractable, As there are no well-established, efficient integration schemes for high dimensional partial differential equations available. In this talk we will present techniques to translate the partial differential equation constrained optimization problem into a hierarchical, ordinary differential equation constrained optimization problem given a certain set of assumptions. We will present these assumptionas as well as the derivation of the hierarchical, ordinary differential equation constrained optimisation problem. Moreover we will present numerical schemes for the computation of the respective objective function and its gradient. Eventually we will also present numerical schemes to solve the constrained optimisation problem and apply these techniques to small and large scale biological applications for which experimental data is available.
Decline of Real Power Loss and Preservation of Voltage Stability by using Chi...ijeei-iaes
In this paper, a new Chirping Algorithm (CA) is developed based on the chirping behaviour of crickets for solving the reactive power optimization problem. It is based on the chirping behaviour of crickets (insect) found almost everywhere around the world. The proposed Chirping Algorithm (CA) has been tested in standard IEEE 30, 57,118 bus test systems and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss and control variables are well within the limits.
Production and characterization of nano copper powder using electric explosio...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
No sql databases new millennium database for big data, big users, cloud compu...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Study on soundness of reinforced concrete structures by ndt approacheSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
The compensatation of unbalanced 3 phase currents in transmission systems on ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A review on managed aquifer recharge by check dams a case study near chennai,...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Study of characterization of (peo+kclo4) polymer electrolyte systemeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
BIN PACKING PROBLEM: TWO APPROXIMATION ALGORITHMSijfcstjournal
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its
NP-hard nature, several approximation algorithms have been presented. It is proved that the best
algorithm for the Bin Packing Problem has the approximation ratio 3/2 and the time orderO(n),
unlessP=NP. In this paper, first, a
-approximation algorithm is presented, then a modification to FFD
algorithm is proposed to decrease time order to linear. Finally, these suggested approximation algorithms
are compared with some other approximation algorithms. The experimental results show the suggested
algorithms perform efficiently.
In summary, the main goal of the research is presenting methods which not only enjoy the best theoretical
criteria, but also perform considerably efficient in practice.
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its
NP-hard nature, several approximation algorithms have been presented. It is proved that the best
algorithm for the Bin Packing Problem has the approximation ratio 3/2 and the time orderO(n),
unlessP=NP. In this paper, first, a
-approximation algorithm is presented, then a modification to FFD
algorithm is proposed to decrease time order to linear. Finally, these suggested approximation algorithms
are compared with some other approximation algorithms. The experimental results show the suggested
algorithms perform efficiently.
In summary, the main goal of the research is presenting methods which not only enjoy the best theoretical
criteria, but also perform considerably efficient in practice.
An optimal design of current conveyors using a hybrid-based metaheuristic alg...IJECEIAES
This paper focuses on the optimal sizing of a positive second-generation current conveyor (CCII+), employing a hybrid algorithm named DE-ACO, which is derived from the combination of differential evolution (DE) and ant colony optimization (ACO) algorithms. The basic idea of this hybridization is to apply the DE algorithm for the ACO algorithm’s initialization stage. Benchmark test functions were used to evaluate the proposed algorithm’s performance regarding the quality of the optimal solution, robustness, and computation time. Furthermore, the DE-ACO has been applied to optimize the CCII+ performances. SPICE simulation is utilized to validate the achieved results, and a comparison with the standard DE and ACO algorithms is reported. The results highlight that DE-ACO outperforms both ACO and DE.
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICcscpconf
African Buffalo Optimization (ABO) is one of the most recent swarms intelligence based metaheuristics. ABO algorithm is inspired by the buffalo’s behavior and lifestyle. Unfortunately, the standard ABO algorithm is proposed only for continuous optimization problems. In this paper, the authors propose two discrete binary ABO algorithms to deal with binary optimization problems. In the first version (called SBABO) they use the sigmoid function and probability model to generate binary solutions. In the second version (called LBABO) they use some logical operator to operate the binary solutions. Computational results on two knapsack problems (KP and MKP) instances show the effectiveness of the proposed algorithm and their ability to achieve good and promising solutions.
Optimal k-means clustering using artificial bee colony algorithm with variab...IJECEIAES
Clustering is a robust machine learning task that involves dividing data points into a set of groups with similar traits. One of the widely used methods in this regard is the k-means clustering algorithm due to its simplicity and effectiveness. However, this algorithm suffers from the problem of predicting the number and coordinates of the initial clustering centers. In this paper, a method based on the first artificial bee colony algorithm with variable-length individuals is proposed to overcome the limitations of the k-means algorithm. Therefore, the proposed technique will automatically predict the clusters number (the value of k) and determine the most suitable coordinates for the initial centers of clustering instead of manually presetting them. The results were encouraging compared with the traditional k-means algorithm on three real-life clustering datasets. The proposed algorithm outperforms the traditional k-means algorithm for all tested real-life datasets.
I am Charles B. I am an Algorithm Assignment Expert at programminghomeworkhelp.com. I hold a Ph.D. in Programming, Texas University, USA. I have been helping students with their homework for the past 6 years. I solve assignments related to Algorithms.
Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com.You can also call on +1 678 648 4277 for any assistance with Algorithm assignments.
A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTIONijsc
Two modern optimization methods including Particle Swarm Optimization and Differential Evolution are
compared on twelve constrained nonlinear test functions. Generally, the results show that Differential
Evolution is better than Particle Swarm Optimization in terms of high-quality solutions, running time and
robustness.
Discrete penguins search optimization algorithm to solve flow shop schedulin...IJECEIAES
Flow shop scheduling problem is one of the most classical NP-hard optimization problem. Which aims to find the best planning that minimizes the makespan (total completion time) of a set of tasks in a set of machines with certain constraints. In this paper, we propose a new nature inspired metaheuristic to solve the flow shop scheduling problem (FSSP), called penguins search optimization algorithm (PeSOA) based on collaborative hunting strategy of penguins.The operators and parameter values of PeSOA redefined to solve this problem. The performance of the penguins search optimization algorithm is tested on a set of benchmarks instances of FSSP from OR-Library, The results of the tests show that PeSOA is superior to some other metaheuristics algorithms, in terms of the quality of the solutions found and the execution time.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
Similar to A novel work for bin packing problem by ant colony optimization (20)
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
A novel work for bin packing problem by ant colony optimization
1. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 02 Special Issue: 02 | Dec-2013, Available @ http://www.ijret.org 71
A NOVEL WORK FOR BIN PACKING PROBLEM BY ANT COLONY
OPTIMIZATION
Nishant Kumar Singh1
, Susobhan Baidya2
1
Social Services and Amateur Researcher, Swarnim Foundation (NGO)
2
Assistant Professor, Heritage Institute of Technology (Kolkata)
Abstract
This paper presents Ant colony optimization metaheuristic solution for Bin packing problem (BPP). In the BPP, the aim is to combine
a set of items into bins of a certain capacity so as to minimize the total number of bins. The bin packing is a well-known NP-hard
combinatorial optimization problem. Only very little instances can be solved exactly, so for real-world problems we have to rely on
heuristic solution methods. We are proposing an ant based optimization which was introduced by Dorigo in 1992, which in the past
proved appropriate to solve many optimization problems. This ACO is inspired by the path-finding abilities of real ant colonies.It
combines an artificial pheromone trail with simple heuristic information to stochastically build new solutions. This paper explores the
ability of the ACO algorithm to balance between bins and objects in its decision making process. The solution quality and time to
solution make ACO competitive as an optimization technique for NP-hard problems in which various factors such as cost and length
are involved.[1][2]
Keywords: ACO, bin packing problem, NP- Problem
----------------------------------------------------------------------***--------------------------------------------------------------------
1. INTRODUCTION
Bin Packing Problem is the problem of packing objects of
different weight into a finite number of equal-sized bins in a
way that minimizes the number of bins used. Even though this
problem seems to be rather simple it is a NP-hard combinatorial
optimization problem, i.e., no procedure is able to solve each
problem instance in polynomial time. There are so many real
life application of Bin Packing Problem, such that Machine
scheduling, Recording of all of a composer's music, where the
length of the pieces to be recorded are the weights and the bin
capacity is the amount of time that can be stored on an audio
CD (about 80 minutes). Our algorithm is inspired by
Bioinspired Ant Colony Optimization which was designed by
scientist Dorigo and Gambardella (1997). We frame our
algorithm in light of Ant Colony Optimization and compared
the results with the work of Prof. Dr. Armin Scholl and Dr.
Robert Klein that was based on Hybrid solution procedure of
metaheuristic strategy tabu search and a branch and bound
procedure.
2. PROPOSED APPROACH
2.1 Mapping of Objects into a Weighted Graph
In order to implement ACO algorithm, Bin Packing Problem is
mapped into a non-directed asymmetric weighted graph. Graph
can be represented by G(v ,e) where v denotes set of vertices
and e denotes set of edges. Weight associated with an edge will
be the weight of the item to be selected. So if we are going from
vertex i to j then weight will be the weight of item j.
2.2 Solution Construction:
Every ant from the group of ants starts their journey with an
empty bin and set of the entire object to be placed in the bin.
Each ant pick objects one by one and place them in the bin until
none of the available object can fit into the current bin. Then
current bin is closed and a new bin is opened.
The trail of pheromone (i, j) represents the desire to have an i
object and a j object in the same bin. The probability so that ant
„k‟ chooses a j object as next object for the considered bin b, in
a partial solution s is [1]
= 0 otherwise
= 1 otherwise (1)
In this equation, Jk(s, b) is the set of items that qualify for
inclusion in the current bin b. They are the items that are still
left after partial solution s is formed, and are small enough to fit
in bin b; η(j) is the item size j; τb ( j) is the pheromone value for
an item size j in a bin b. It is the sum of all the pheromone
values between item size j and the item sizes i that are already in
bin b, divided by the number of items in b for normalization. If
b is empty, τb ( j) is set to 1; α and β are the parameter that
2. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 02 Special Issue: 02 | Dec-2013, Available @ http://www.ijret.org 72
define the relative importance of the heuristic information as
opposed to the pheromone value.
2.3 Updating of Pheromones
After all ants have constructed their tour, the pheromone trails
are updated. This is done by first lowering the pheromone
values on all arcs by a constant factor, and then adding
pheromone on the arcs the ant have crossed in their tours.
Pheromone evaporation is implemented by. [1]
…………… (2)
Where 0<ρ<=1 is the pheromone evaporation rate. The
parameter ρ is used to avoid unlimited accumulation of the
pheromone trails and it enables the algorithm to “forget” bad
decision previously taken .In fact if an arc is not chosen by the
ants, its associated pheromone values decrease exponentially in
the number of iterations. After evaporation, all ants deposit
pheromones on the arcs they have crossed in their tour [1]
…………… (3)
Where is the amount of pheromone ant k deposits on the
arcs it has visited. It is defined as follows:
Δτk
= f(sk
)
Where f(sk
) is the fitness function which was proposed by
Falkenauer and Delchambre in [3] and is given by:
(4)
Where:
N is the number of bins used by an ant;
Fi is total weight of placed objects in bin i;
C is the maximum capacity of the bin;
m is a parameter that defines the importance of the nominator.
(Note: m=2 has been suggested as the optimal value by
Falkenauer and Delchambre)
The Heuristics
1. Open an empty bin.
2. Add the heaviest item that still fits in the bin
3. Repeat step 2 until no item is left that is light enough to
fit in the bin.
4. Go back to step 1 until all items are placed
Pseudo Code
initialize pheromone matrix by a little value
repeat ANTBIN(K) for a finite number of iteration
procedure ANTBIN (k)
begin
i = 0
bin = 1
repeat
move an ant from object i
repeat
select any object j after
object i by probability
equation (1)
if size of bin exhausted
then bin ++
until all the object s are selected for
packing
until k no. ants finish individual tour.
repeat
update pheromone τij for each ant‟s tour by
equation (2) & (3)
until k number of updation over
end
3. EXPERIMENTAL RESULTS
In order to implement ACO over BPP, standard object instances
were considered and they were sourced from [6].
We compared our solution with the work of Dr. Armin Scholl,
Dr. Robert Klein. [5]. For all experiments, parameters were set
to the following values: m=2, τ0 = 0.023330(small value), α = 2,
β = 1. Values for α, β were derived from an experiment where
optimum results were compared for different values of α, β.
[Graph-1]
4. SAMPLE RESULT
For a considered problem instance [3] „N1C1W1_A‟ with 50
object of different weights in the range of [1, 100] and bin
capacity of 100, the number of maximum iteration was set to
100 but Ants were observed to be converging at optimal
solution i.e. 26 bins after 40 iterations.[Graph -2].
(ij
3. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 02 Special Issue: 02 | Dec-2013, Available @ http://www.ijret.org 73
Convergence to optimal solution accelerates with increasing
number of Ants as it leads to exploration of new solutions.
[Grpah-3]
Optimum Packing
Bin
No.
Objects Bin
No.
Objects Bin
No.
Objects
1 61,27,7 10 33,67 19 96
2 46, 42 11 24,74 20 99
3 49,33 12 21,72 21 91
4 28,40,28 13 23,44,25 22 96
5 40,51,3 14 67,30 23 92
6 88,11 15 62,22 24 99
7 87,10 16 76,20 25 92
8 52,17,14,7 17 30,69 26 85
9 29,56 18 86,13
5. CONCLUSIONS AND FUTURE WORK
From the above graphs we can conclude that the value of α=2
and β =1 is optimal for BPP problem. The solution converges to
its optimal point after 30 iterations and number of ants require
for every iteration is 50 which is exactly number of objects in
the BPP. Here in our algorithm we got optimal result 26 for the
above instance, which is very close to our desire result [5]. We
hope these tours can be encoded as superior genes for Genetic
Algorithm for further refinement of results.
REFERENCES
[1]. Frederick Ducatelle “Ant Colony Optimisation for Bin
Packing and Cutting Stock Problems”, 2001
[2]. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant System:
Optimization by a colony of cooperating agents,” IEEE
Transactions on Systems,Man, and Cybernetics – Part B, vol.
26, no. 1, pp. 29–41, 1996.
[3]. Emanuel Falkenauer and Alain Delchambre. A genetic
algorithm for bin packing and line balancing.In Proceedings of
the IEEE 1992 International Conference on Robotics and
Automation, Nice,France, May 1992.
[4]. M. Dorigo and T. St¨utzle, Ant Colony Optimization. MIT
Press, Cambridge, MA, 2004
[5]. Prof. Dr. Armin Scholl, Dr. Robert Klein,
“http://www.wiwi.uni-jena.de/Entscheidung/binpp/ “
[6].
http://www.wiwi.unijena.de/Entscheidung/binpp/bin1dat.htm