Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075488
Zaid M. Jawad Kubba, Haider K. Hoomod
Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterises the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is applied to generate pseudo-random keys that produce more complexity for the proposed cipher algorithm. The goal of the proposed algorithm is to present a hybrid algorithm by enhancing the complexity of the current PRESENT algorithm while keeping the performance of computational operations as minimal. The proposed algorithm proved working efficiently with fast executed time, and the analysed result of the generated sequence keys passed the randomness of the NIST suite.
{"title":"A Hybrid Modified Lightweight Algorithm Combined of Two Cryptography Algorithms PRESENT and Salsa20 Using Chaotic System","authors":"Zaid M. Jawad Kubba, Haider K. Hoomod","doi":"10.1109/CAS47993.2019.9075488","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075488","url":null,"abstract":"Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterises the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is applied to generate pseudo-random keys that produce more complexity for the proposed cipher algorithm. The goal of the proposed algorithm is to present a hybrid algorithm by enhancing the complexity of the current PRESENT algorithm while keeping the performance of computational operations as minimal. The proposed algorithm proved working efficiently with fast executed time, and the analysed result of the generated sequence keys passed the randomness of the NIST suite.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116473825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075724
Ghassan Ahmed Mubarak, Emad I Abdul Kareem
Several studies and researches had been made to develop In-Door Surveillance module. Most of them had depended on traditional techniques tend to be more complicated. After revolutionary development in Artificial intelligence that simulates the human brain, many industrial companies has started to build more efficient and intelligent surveillance systems depending on artificial intelligence techniques. Thus, this research would deal with an Indoor surveillance module depending on non-traditional techniques, which is Multi-Connect Architecture Associative Memory (MMCA). The proposed module would process any given pre-processed image-stream and decide whether it is secured or non-secured case. This process had been done by training the proposed module with one selected secured image. The study found that accuracy values were between (74.6 – 97.2%). Accuracy was almost around 95% which is considered a promising results in real-time of execution.
{"title":"One Shoot In-Door Surveillance Module Based On MCA Associative Memory","authors":"Ghassan Ahmed Mubarak, Emad I Abdul Kareem","doi":"10.1109/CAS47993.2019.9075724","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075724","url":null,"abstract":"Several studies and researches had been made to develop In-Door Surveillance module. Most of them had depended on traditional techniques tend to be more complicated. After revolutionary development in Artificial intelligence that simulates the human brain, many industrial companies has started to build more efficient and intelligent surveillance systems depending on artificial intelligence techniques. Thus, this research would deal with an Indoor surveillance module depending on non-traditional techniques, which is Multi-Connect Architecture Associative Memory (MMCA). The proposed module would process any given pre-processed image-stream and decide whether it is secured or non-secured case. This process had been done by training the proposed module with one selected secured image. The study found that accuracy values were between (74.6 – 97.2%). Accuracy was almost around 95% which is considered a promising results in real-time of execution.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128297950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075739
A. Mustafa, Mohammed I. A al-Nouman, O. A. Awad
The cases of kidnapping and vehicle theft is increasing continuously. Therefore the need for mobile applications to track the vehicle in real-time become very important, so the user can track and monitor the vehicle using the mobile phone. This type of system sends large data to the server/cloud every day, which will increase the expenses every month for transmitting the data to this cloud/server. This paper introduced an embedded system that designed and implemented for vehicle tracking based on an android application, the main contribution of this paper is to reduce the data that sent from the embedded system in the vehicle to the cloud server via picking only necessary data for vehicle tracking from Global Position System GPS and decreasing the number of Hypertext Transfer Protocol HTTP request that transmitted to the cloud server by construing the transmission of information with the movement of vehicles. This system is divided into three parts: embedded system that is attached with the vehicle, cloud/server part which has the database of every single move every car did, and the monitoring part which is the main user interface so they can monitor the vehicle.
{"title":"A Smart real-time tracking system using GSM/GPRS technologies","authors":"A. Mustafa, Mohammed I. A al-Nouman, O. A. Awad","doi":"10.1109/CAS47993.2019.9075739","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075739","url":null,"abstract":"The cases of kidnapping and vehicle theft is increasing continuously. Therefore the need for mobile applications to track the vehicle in real-time become very important, so the user can track and monitor the vehicle using the mobile phone. This type of system sends large data to the server/cloud every day, which will increase the expenses every month for transmitting the data to this cloud/server. This paper introduced an embedded system that designed and implemented for vehicle tracking based on an android application, the main contribution of this paper is to reduce the data that sent from the embedded system in the vehicle to the cloud server via picking only necessary data for vehicle tracking from Global Position System GPS and decreasing the number of Hypertext Transfer Protocol HTTP request that transmitted to the cloud server by construing the transmission of information with the movement of vehicles. This system is divided into three parts: embedded system that is attached with the vehicle, cloud/server part which has the database of every single move every car did, and the monitoring part which is the main user interface so they can monitor the vehicle.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121709252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075835
Sairan Hamza Raheem, Hassan Kadum Mansor, B. A. Kalaf, A. N. Salman
In this study, we consider the system reliability of parallel stress-strength model as an important part of system reliability by assuming the stress and the strengths random variables follows the one parameter Inverse Rayleigh Distribution. Some estimation methods, namely; Maximum Likelihood, Moment method, and Uniformly Minimum Variance Unbiased estimator and three types of shrinkage estimation methods were considered for estimating the system reliability. As well as, Monte Carlo simulation was used to get a comparison among all the suggested methods depends on the statistical indicator Mean Squared Error.
{"title":"A Comparison for Some of the estimation methods of the Parallel Stress-Strength model In the case of Inverse Rayleigh Distribution","authors":"Sairan Hamza Raheem, Hassan Kadum Mansor, B. A. Kalaf, A. N. Salman","doi":"10.1109/CAS47993.2019.9075835","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075835","url":null,"abstract":"In this study, we consider the system reliability of parallel stress-strength model as an important part of system reliability by assuming the stress and the strengths random variables follows the one parameter Inverse Rayleigh Distribution. Some estimation methods, namely; Maximum Likelihood, Moment method, and Uniformly Minimum Variance Unbiased estimator and three types of shrinkage estimation methods were considered for estimating the system reliability. As well as, Monte Carlo simulation was used to get a comparison among all the suggested methods depends on the statistical indicator Mean Squared Error.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130047056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075615
E. H. Al-Rawdanee, Jamil A. Ali Al-Hawasy
This paper is concerned with studying the numerical solution for the discrete classical optimal control problem governing by a nonlinear hyperbolic boundary value problem. When the discrete classical control is given, the existence theorem for a unique discrete solution of the discrete weak form is proved. The existence theorem for the discrete classical optimal control and the necessary theorem “conditions” for optimality of the problem are proved under a suitable assumption. The discrete classical optimal control problem is solved by mixing the Galerkin finite element method for space variable with the implicitfinite difference method for the time variable to find the discrete state of discrete weak form (and the discrete adjoint solution of discrete adjoint weak form), while the Gradient Projection method or of the Gradient method or of the Frank Wolfe method are used to find the discrete classical optimal control. Inside these three methods the Armijo step option or the optimal step option are used to improve the (solution) discrete classical control. Finally, an illustrative example for the problem is given to show the accuracy and efficiency of the methods.
{"title":"Mixed Methods for Solving Classical Optimal Control Governing by Nonlinear Hyperbolic Boundary Value Problem","authors":"E. H. Al-Rawdanee, Jamil A. Ali Al-Hawasy","doi":"10.1109/CAS47993.2019.9075615","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075615","url":null,"abstract":"This paper is concerned with studying the numerical solution for the discrete classical optimal control problem governing by a nonlinear hyperbolic boundary value problem. When the discrete classical control is given, the existence theorem for a unique discrete solution of the discrete weak form is proved. The existence theorem for the discrete classical optimal control and the necessary theorem “conditions” for optimality of the problem are proved under a suitable assumption. The discrete classical optimal control problem is solved by mixing the Galerkin finite element method for space variable with the implicitfinite difference method for the time variable to find the discrete state of discrete weak form (and the discrete adjoint solution of discrete adjoint weak form), while the Gradient Projection method or of the Gradient method or of the Frank Wolfe method are used to find the discrete classical optimal control. Inside these three methods the Armijo step option or the optimal step option are used to improve the (solution) discrete classical control. Finally, an illustrative example for the problem is given to show the accuracy and efficiency of the methods.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"10 3 Suppl 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123666003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075761
A. M. Salman, N. A. Hussein, A. H. Hussain, S. A. Abbas
In this study, we present estimation scale parameter of Rayleigh distribution under data the control of type II by using methods Proposed Bayesian as only prior and Double priors with a new suggestion used three Prior by using distributions Exponential and Gamma and Chi-Square. An experimental study was conducted to compare these methods and to demonstrate the efficiency of the methods proposed in practice by relying on the generated observations from Rayleigh distribution. We compare these methods by using Mean square error (MSE). We did this study by using simulation with different values parameter $(theta)$ and different sample sizes $(mathrm{N}=10,25,50,100)$. It has been shown through computational results that the best way to estimate is the Bayes method proposed (BAY3).
{"title":"Three Prior and Double Prior Selection to Comparison Estimate Parameter Rayleigh Distribution under Data Type II Censoring","authors":"A. M. Salman, N. A. Hussein, A. H. Hussain, S. A. Abbas","doi":"10.1109/CAS47993.2019.9075761","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075761","url":null,"abstract":"In this study, we present estimation scale parameter of Rayleigh distribution under data the control of type II by using methods Proposed Bayesian as only prior and Double priors with a new suggestion used three Prior by using distributions Exponential and Gamma and Chi-Square. An experimental study was conducted to compare these methods and to demonstrate the efficiency of the methods proposed in practice by relying on the generated observations from Rayleigh distribution. We compare these methods by using Mean square error (MSE). We did this study by using simulation with different values parameter $(theta)$ and different sample sizes $(mathrm{N}=10,25,50,100)$. It has been shown through computational results that the best way to estimate is the Bayes method proposed (BAY3).","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114419568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075831
A. H. Mohammed, M. Jafer
There are so many modern technologies for the future, the most important one to look for is the web of things (with), this technology supposed to connect billions of devices with lead to a massive number of communication between the devices that will produce a huge amount of the information but come with that another type of challenge which is protecting this information from being at risk. We need to put in mind that this device is small in shape and uses low power so when we use numerous rounds to encrypt the data it is will be expensive also it will be very complicated, as you know when we use less complex calculations, we may put the integrity in risk. We propose an algorithm based on lightweight encryption named (LWAES). The first goal of the LWAES scheme is to Highest speed in the encryption and decryption. The Mix Columns stage is the most computational demanding stage in the AES design, and therefore it consumes most of the time needed for encryption and decryption. In the LWAES design, the Mix Columns stage is replaced by simple SHIFT operations. This operation takes the time from the beginning of reading the sensors to the moment they were retrieved to the user 1–8 seconds. In addition to that, the modified LWAES algorithm provides good security With speed in the encryption process and lightweight in the storage process.
{"title":"Secure web of things based on a lightweight Algorithm","authors":"A. H. Mohammed, M. Jafer","doi":"10.1109/CAS47993.2019.9075831","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075831","url":null,"abstract":"There are so many modern technologies for the future, the most important one to look for is the web of things (with), this technology supposed to connect billions of devices with lead to a massive number of communication between the devices that will produce a huge amount of the information but come with that another type of challenge which is protecting this information from being at risk. We need to put in mind that this device is small in shape and uses low power so when we use numerous rounds to encrypt the data it is will be expensive also it will be very complicated, as you know when we use less complex calculations, we may put the integrity in risk. We propose an algorithm based on lightweight encryption named (LWAES). The first goal of the LWAES scheme is to Highest speed in the encryption and decryption. The Mix Columns stage is the most computational demanding stage in the AES design, and therefore it consumes most of the time needed for encryption and decryption. In the LWAES design, the Mix Columns stage is replaced by simple SHIFT operations. This operation takes the time from the beginning of reading the sensors to the moment they were retrieved to the user 1–8 seconds. In addition to that, the modified LWAES algorithm provides good security With speed in the encryption process and lightweight in the storage process.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115597704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075730
Thekra Abbas, A. M. Mkelif, A. K. Abdulkareem
This paper describes an implementation of a web-based system using classification techniques for prediction of water pollution type and appropriate treatments depending on the water quality Index. The benefits of data mining lie in the extraction of new knowledge automatically from the raw data to progress decision making. (C4.5) The decision tree was used for classifying water quality into five classes using fourteen parameters according to the World Health Organization's requirements. These parameters are taken for each sample of water in each ten water stations that selected for the investigations. First two classes were suitable for drinking water while other classes were not, therefore two types of classification techniques ((c4.5) decision trees and artificial neural network, millstone machine learning technique) were suggested to produce a decision concerning the type of pollution and devise proposition for the treatment of pollution. The experiment was carried on a real database validated by (Iraqi Ministry of Environment) gathered from ten authenticated treatment stations. The results show that using C4.5 decision tree classifier found to be the better in terms of the execution time while using NNT algorithm gave slightly better results in terms of the accuracy and error percentages. Also, the work shows that the techniques of data mining have the prospect to fast predict of the water quality class, as long as the given data are a true representation of the scope of knowledge.
{"title":"Web-Based Management System of water pollution using Classification Techniques","authors":"Thekra Abbas, A. M. Mkelif, A. K. Abdulkareem","doi":"10.1109/CAS47993.2019.9075730","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075730","url":null,"abstract":"This paper describes an implementation of a web-based system using classification techniques for prediction of water pollution type and appropriate treatments depending on the water quality Index. The benefits of data mining lie in the extraction of new knowledge automatically from the raw data to progress decision making. (C4.5) The decision tree was used for classifying water quality into five classes using fourteen parameters according to the World Health Organization's requirements. These parameters are taken for each sample of water in each ten water stations that selected for the investigations. First two classes were suitable for drinking water while other classes were not, therefore two types of classification techniques ((c4.5) decision trees and artificial neural network, millstone machine learning technique) were suggested to produce a decision concerning the type of pollution and devise proposition for the treatment of pollution. The experiment was carried on a real database validated by (Iraqi Ministry of Environment) gathered from ten authenticated treatment stations. The results show that using C4.5 decision tree classifier found to be the better in terms of the execution time while using NNT algorithm gave slightly better results in terms of the accuracy and error percentages. Also, the work shows that the techniques of data mining have the prospect to fast predict of the water quality class, as long as the given data are a true representation of the scope of knowledge.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115392507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075827
Tariq A. Hassan, Duraid T. Salim, Jawad Kadem, Rehab I. Ajel
The demands for exchange secret information among many institutions simulate the rapid development of new strategies. Steganography is a well-known method for hiding data from not permitted access. One of the Steganographic techniques is to hide secret data in one of the file formats such as image, text, audio. In this paper, a steganography technique based on the energy of the audio signal that is used to hide a speech signal is presented. The objective is to examine the effect of the energy parameter in hiding the speech signal within an audio signal without being perceptible by the listener. A technique is to test the different level of energies and durations of both the source and the cover signal. Experimental results show that, in the case of cleaned signals, the technique performing well in the case when the duration of the cover signal is much longer than the duration of the source signal, i.e. the much rooms for the source signal to hide the better performance. Also, the results show that the additive noise can have a tremendous negative impact on system performance.
{"title":"Audio Covering Signal For Speech Signal Hiding","authors":"Tariq A. Hassan, Duraid T. Salim, Jawad Kadem, Rehab I. Ajel","doi":"10.1109/CAS47993.2019.9075827","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075827","url":null,"abstract":"The demands for exchange secret information among many institutions simulate the rapid development of new strategies. Steganography is a well-known method for hiding data from not permitted access. One of the Steganographic techniques is to hide secret data in one of the file formats such as image, text, audio. In this paper, a steganography technique based on the energy of the audio signal that is used to hide a speech signal is presented. The objective is to examine the effect of the energy parameter in hiding the speech signal within an audio signal without being perceptible by the listener. A technique is to test the different level of energies and durations of both the source and the cover signal. Experimental results show that, in the case of cleaned signals, the technique performing well in the case when the duration of the cover signal is much longer than the duration of the source signal, i.e. the much rooms for the source signal to hide the better performance. Also, the results show that the additive noise can have a tremendous negative impact on system performance.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128678960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075460
Doha Adel Abbass
In this research, we suggested the problem scheduling of n jobs on a single machine to decrease schedule multi-objective function; the sum cost of total completion time, the total number of late jobs, total tardiness and the maximum tardiness $(Sigma C_{i}+ Sigma U_{i}+Sigma T_{i}+T_{max})$, which is NP-hard problem. In this research, we proposed the branch and bound algorithm (BAB) to obtain the optimal solution. We used some local search methods (descent method (DM) and genetic algorithm (GA)) to obtain an optimal solution or a near-optimal solution. Also, we developed a simple algorithm (SPT-MA) to find a solution near the optimum solution. The (SPT-MA) algorithm proofs its good performance in solving the problem in a reasonable time.
{"title":"Using Branch and Bound and Local Search Methods to Solve Multi-objective Machine Scheduling Problem","authors":"Doha Adel Abbass","doi":"10.1109/CAS47993.2019.9075460","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075460","url":null,"abstract":"In this research, we suggested the problem scheduling of n jobs on a single machine to decrease schedule multi-objective function; the sum cost of total completion time, the total number of late jobs, total tardiness and the maximum tardiness $(Sigma C_{i}+ Sigma U_{i}+Sigma T_{i}+T_{max})$, which is NP-hard problem. In this research, we proposed the branch and bound algorithm (BAB) to obtain the optimal solution. We used some local search methods (descent method (DM) and genetic algorithm (GA)) to obtain an optimal solution or a near-optimal solution. Also, we developed a simple algorithm (SPT-MA) to find a solution near the optimum solution. The (SPT-MA) algorithm proofs its good performance in solving the problem in a reasonable time.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115029136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：