Future demand for managing a huge number of individually operating small and often volatile energy resources within the smart grid is preponderantly answered by involving decentralized orchestration methods for planning and scheduling. Many plaiming and scheduling problems are of a multi-objective nature. For the single-objective case - e.g. predictive scheduling with the goal of jointly resembling a wanted target schedule -fully decentralized algorithms with self-organizing agents exist. We extend this paradigm towards fully decentralized agent-based multi-objective scheduling for energy resources e.g. in virtual power plants for which special local constraint-handling techniques are needed. We integrate algorithmic elements from the well-known S-metric selection evolutionary multi-objective algorithm into a gossiping-based combinatorial optimization heuristic that works with agents for the single-objective case and derive a number of challenges that have to be solved for fully decentralized multi-objective optimization. We present a first solution approach based on the combinatorial optimization heuristics for agents and demonstrate viability and applicability in several simulation scenarios.
{"title":"Towards fully Decentralized Multi-Objective Energy Scheduling","authors":"Jörg Bremer, S. Lehnhoff","doi":"10.15439/2019F160","DOIUrl":"https://doi.org/10.15439/2019F160","url":null,"abstract":"Future demand for managing a huge number of individually operating small and often volatile energy resources within the smart grid is preponderantly answered by involving decentralized orchestration methods for planning and scheduling. Many plaiming and scheduling problems are of a multi-objective nature. For the single-objective case - e.g. predictive scheduling with the goal of jointly resembling a wanted target schedule -fully decentralized algorithms with self-organizing agents exist. We extend this paradigm towards fully decentralized agent-based multi-objective scheduling for energy resources e.g. in virtual power plants for which special local constraint-handling techniques are needed. We integrate algorithmic elements from the well-known S-metric selection evolutionary multi-objective algorithm into a gossiping-based combinatorial optimization heuristic that works with agents for the single-objective case and derive a number of challenges that have to be solved for fully decentralized multi-objective optimization. We present a first solution approach based on the combinatorial optimization heuristics for agents and demonstrate viability and applicability in several simulation scenarios.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116514521","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}
The Distance Geometry Problem (DGP) asks whether a simple weighted undirected graph can be realized in a given space (generally Euclidean) so that a given set of distance constraints (associated to the edges of the graph) is satisfied. The Discretizable DGP (DDGP) represents a subclass of instances where the search space can be reduced to a discrete domain having the structure of a tree. In the ideal case where all distances are precise, the tree is binary and one singleton, representing one possible position for a vertex of the graph, is associated to every tree node. When the distance information is however not precise, the uncertainty on the distance values implies that a three-dimensional region of the search space needs to be assigned to some nodes of the tree. By using a recently proposed coarse-grained representation for DDGP solutions, we extend in this work the branch-and-prune (BP) algorithm so that it can efficiently perform an exhaustive search of the search domain, even when the uncertainty on the distances is important. Instead of associating singletons to nodes, we consider a pair consisting of a box and of a most-likely position for the vertex in this box. Initial estimations of the vertex positions in every box can be subsequently refined by using local optimization. The aim of this paper is two-fold: (i) we propose a new simple method for the computation of the three-dimensional boxes to be associated to the nodes of the search tree; (ii) we introduce the resolution parameter ρ, with the aim of controling the similarity between pairs of solutions in the solution set. Some initial computational experiments show that our algorithm extension, differently from previously proposed variants of the BP algorithm, is actually able to terminate the enumeration of the solution set by providing solutions that dilrer from one another accordingly to the given resolution parameter.
{"title":"An Efficient Exhaustive Search for the Discretizable Distance Geometry Problem with Interval Data","authors":"A. Mucherino, Jung-Hsin Lin","doi":"10.15439/2019F62","DOIUrl":"https://doi.org/10.15439/2019F62","url":null,"abstract":"The Distance Geometry Problem (DGP) asks whether a simple weighted undirected graph can be realized in a given space (generally Euclidean) so that a given set of distance constraints (associated to the edges of the graph) is satisfied. The Discretizable DGP (DDGP) represents a subclass of instances where the search space can be reduced to a discrete domain having the structure of a tree. In the ideal case where all distances are precise, the tree is binary and one singleton, representing one possible position for a vertex of the graph, is associated to every tree node. When the distance information is however not precise, the uncertainty on the distance values implies that a three-dimensional region of the search space needs to be assigned to some nodes of the tree. By using a recently proposed coarse-grained representation for DDGP solutions, we extend in this work the branch-and-prune (BP) algorithm so that it can efficiently perform an exhaustive search of the search domain, even when the uncertainty on the distances is important. Instead of associating singletons to nodes, we consider a pair consisting of a box and of a most-likely position for the vertex in this box. Initial estimations of the vertex positions in every box can be subsequently refined by using local optimization. The aim of this paper is two-fold: (i) we propose a new simple method for the computation of the three-dimensional boxes to be associated to the nodes of the search tree; (ii) we introduce the resolution parameter ρ, with the aim of controling the similarity between pairs of solutions in the solution set. Some initial computational experiments show that our algorithm extension, differently from previously proposed variants of the BP algorithm, is actually able to terminate the enumeration of the solution set by providing solutions that dilrer from one another accordingly to the given resolution parameter.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"44 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116505380","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}
Most cloud providers use centralized servers to manage data. However, centralized servers still suffer the risks of single point of failure and data theft. We add a blockchain to the cloud service and propose a new architecture to manage data. Using blockchain as a connector to utilize the tamperproof, traceable, and data-sharing features of the blockchain to ensure that the transaction data are properly stored in each node. We use the stock simulation trading service to extend and divide the research design into two levels, namely, system and application services. First, we directly write the data into the blockchain. Second, we alternatively store the data in the cloud and then write it into the blockchain. Finally, the two versions are compared and analyzed to investigate their feasibility and performance. At the application service, we implement the smart contract for the existing stock transaction process to achieve real-time settlement.
{"title":"Using Blockchain to Access Cloud Services: A Case of Financial Service Application","authors":"Min-Han Tseng, S. Chang, Tzu-Yin Kuo","doi":"10.15439/2019F296","DOIUrl":"https://doi.org/10.15439/2019F296","url":null,"abstract":"Most cloud providers use centralized servers to manage data. However, centralized servers still suffer the risks of single point of failure and data theft. We add a blockchain to the cloud service and propose a new architecture to manage data. Using blockchain as a connector to utilize the tamperproof, traceable, and data-sharing features of the blockchain to ensure that the transaction data are properly stored in each node. We use the stock simulation trading service to extend and divide the research design into two levels, namely, system and application services. First, we directly write the data into the blockchain. Second, we alternatively store the data in the cloud and then write it into the blockchain. Finally, the two versions are compared and analyzed to investigate their feasibility and performance. At the application service, we implement the smart contract for the existing stock transaction process to achieve real-time settlement.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132671477","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}
A very important aspect of modern websites is their usability. Thanks to modern, and constantly developing technologies it is possible to create user-friendly services for each user. The usefulness of online services may be considered in terms of their functionality, clarity, and accessibility. It is particularly important that these criteria are met by public administration websites. The aim of this paper is to present the most common usability errors identified on the websites of public administration units as well as to indicate the links between particular types of problems and traditional heuristics of Jakob Nielsen. The survey was conducted by evaluating the websites of the Public Information Bulletin in Poland (BIP, which stands for “Biuletyn Informacji Publicznej”), which are supposed to provide universal access to public information by the citizens of the country. A heuristic method (based on J. Nielsen’s heuristics) was used to evaluate 60 websites. The errors obtained were grouped into 14 categories. Each of the error groups was assessed by an expert in terms of its importance for the overall assessment of the website’s usefulness. The analysis of relations between the identified categories of errors and heuristics of Jakob Nielsen indicates a need for specifying heuristics in the context of evaluating the usability and availability of public administration websites.
现代网站的一个非常重要的方面是可用性。由于现代和不断发展的技术，有可能为每个用户创建用户友好的服务。在线服务的有用性可以根据其功能、清晰度和可访问性来考虑。特别重要的是，公共行政网站必须符合这些标准。本文的目的是介绍公共行政单位网站上最常见的可用性错误，并指出特定类型的问题与Jakob Nielsen的传统启发式之间的联系。这项调查是通过评估波兰公共信息公报(BIP，即“Biuletyn Informacji Publicznej”)的网站进行的，这些网站本应为该国公民提供普遍获取公共信息的途径。采用启发式方法(基于J. Nielsen’s heuristics)对60个网站进行评价。得到的误差分为14类。每个错误组都由专家根据其对网站有用性的总体评估的重要性进行评估。对Jakob Nielsen的错误分类与启发式方法之间关系的分析表明，在评估公共行政网站的可用性和可用性的背景下，需要指定启发式方法。
{"title":"Identification of Heuristics for Assessing the Usability of Websites of Public Administration Units","authors":"Helena Dudycz, Lukasz Krawiec","doi":"10.15439/2019F307","DOIUrl":"https://doi.org/10.15439/2019F307","url":null,"abstract":"A very important aspect of modern websites is their usability. Thanks to modern, and constantly developing technologies it is possible to create user-friendly services for each user. The usefulness of online services may be considered in terms of their functionality, clarity, and accessibility. It is particularly important that these criteria are met by public administration websites. The aim of this paper is to present the most common usability errors identified on the websites of public administration units as well as to indicate the links between particular types of problems and traditional heuristics of Jakob Nielsen. The survey was conducted by evaluating the websites of the Public Information Bulletin in Poland (BIP, which stands for “Biuletyn Informacji Publicznej”), which are supposed to provide universal access to public information by the citizens of the country. A heuristic method (based on J. Nielsen’s heuristics) was used to evaluate 60 websites. The errors obtained were grouped into 14 categories. Each of the error groups was assessed by an expert in terms of its importance for the overall assessment of the website’s usefulness. The analysis of relations between the identified categories of errors and heuristics of Jakob Nielsen indicates a need for specifying heuristics in the context of evaluating the usability and availability of public administration websites.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132213700","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}
This paper presents an application of spline-wavelet transformation and bent-functions for the construction of robust codes. To improve the1 non-linear properties of presented robust codes, bent-functions were used. Bent-functions ensure maximum non-linearity of functions, increasing the probability of detecting an error in the data channel. In the work different designs of codes based on wavelet transform and bent-functions are developed. The difference of constructions consists of using different grids for wavelet transformation and using different bent-functions. The developed robust codes have higher characteristics compared to existing. These codes can be used for ensuring the security of transmitted information.
{"title":"Spline-Wavelet Bent Robust Codes","authors":"A. Levina, G. Ryaskin, I. Zikratov","doi":"10.15439/2019F134","DOIUrl":"https://doi.org/10.15439/2019F134","url":null,"abstract":"This paper presents an application of spline-wavelet transformation and bent-functions for the construction of robust codes. To improve the1 non-linear properties of presented robust codes, bent-functions were used. Bent-functions ensure maximum non-linearity of functions, increasing the probability of detecting an error in the data channel. In the work different designs of codes based on wavelet transform and bent-functions are developed. The difference of constructions consists of using different grids for wavelet transformation and using different bent-functions. The developed robust codes have higher characteristics compared to existing. These codes can be used for ensuring the security of transmitted information.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123182502","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}
Eugenio Martínez-Cámara, Nuria Rodríguez Barroso, A. R. Moya, José Alberto Fernández, Elena Romero, Francisco Herrera
The state of the art in Sentiment Analysis is defined by deep learning methods, and currently the research efforts are focused on improving the encoding of underlying contextual information in a sequence of text. However, those neural networks with a higher representation capacity are increasingly more complex, which means that they have more hyper-parameters that have to be defined by hand. We argue that the setting of hyper-parameters may be defined as an optimisation task, we thus claim that evolutionary algorithms may be used to the optimisation of the hyper-parameters of a deep learning method. We propose the use of the evolutionary algorithm SHADE for the optimisation of the configuration of a deep learning model for the task of sentiment analysis in Twitter. We evaluate our proposal in a corpus of Spanish tweets, and the results show that the hyper-parameters found by the evolutionary algorithm enhance the performance of the deep learning method.
{"title":"Deep Learning Hyper-parameter Tuning for Sentiment Analysis in Twitter based on Evolutionary Algorithms","authors":"Eugenio Martínez-Cámara, Nuria Rodríguez Barroso, A. R. Moya, José Alberto Fernández, Elena Romero, Francisco Herrera","doi":"10.15439/2019F183","DOIUrl":"https://doi.org/10.15439/2019F183","url":null,"abstract":"The state of the art in Sentiment Analysis is defined by deep learning methods, and currently the research efforts are focused on improving the encoding of underlying contextual information in a sequence of text. However, those neural networks with a higher representation capacity are increasingly more complex, which means that they have more hyper-parameters that have to be defined by hand. We argue that the setting of hyper-parameters may be defined as an optimisation task, we thus claim that evolutionary algorithms may be used to the optimisation of the hyper-parameters of a deep learning method. We propose the use of the evolutionary algorithm SHADE for the optimisation of the configuration of a deep learning model for the task of sentiment analysis in Twitter. We evaluate our proposal in a corpus of Spanish tweets, and the results show that the hyper-parameters found by the evolutionary algorithm enhance the performance of the deep learning method.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121874718","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}
The main aim of this research in progress is to develop an initial taxonomy of motivations underlying BPM (Business Process Management) adoption in organizations. This initial study is based on the analysis of 75 customer cases and success stories published on-line by BPM system vendors and BPM consulting companies. We used the mixed conceptual/empirical approach to taxonomy development basing the empirical analysis on descriptive data-coding canon. As the result of our research we present an initial taxonomy of the motivations for the adoption and use of BPM that consists of three dimensions: the organizational scope of a BPM initiative (enterprise-wide, process-focused or task oriented); presence (or not) of the information technology component; and, the importance of external versus internal drivers motivating a BPM initiative. Proposed initial taxonomy will be developed in further research and will serve to link the motivation to change with the expected benefits of BPM adoption.
{"title":"Motivations for BPM Adoption: Initial Taxonomy based on Online Success Stories","authors":"Renata Gabryelczyk, Aneta Biernikowicz","doi":"10.15439/2019F229","DOIUrl":"https://doi.org/10.15439/2019F229","url":null,"abstract":"The main aim of this research in progress is to develop an initial taxonomy of motivations underlying BPM (Business Process Management) adoption in organizations. This initial study is based on the analysis of 75 customer cases and success stories published on-line by BPM system vendors and BPM consulting companies. We used the mixed conceptual/empirical approach to taxonomy development basing the empirical analysis on descriptive data-coding canon. As the result of our research we present an initial taxonomy of the motivations for the adoption and use of BPM that consists of three dimensions: the organizational scope of a BPM initiative (enterprise-wide, process-focused or task oriented); presence (or not) of the information technology component; and, the importance of external versus internal drivers motivating a BPM initiative. Proposed initial taxonomy will be developed in further research and will serve to link the motivation to change with the expected benefits of BPM adoption.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123985839","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}
To extend the lifetime of wireless sensor networks, recent works suggest the use of relay nodes. This paper surveys and examines representative approaches dealing with relay nodes deployment. It also discusses their shortcomings and presents a comparative study. Additionally, this paper provides a set of remarks and recommendations to improve the usage of relay nodes in wireless sensor networks and highlights open issues that need further investigation.
{"title":"Using Relay Nodes in Wireless Sensor Networks: A Review","authors":"Mustapha Réda Senouci, Mostefa Zafer, M. Aissani","doi":"10.15439/2019F26","DOIUrl":"https://doi.org/10.15439/2019F26","url":null,"abstract":"To extend the lifetime of wireless sensor networks, recent works suggest the use of relay nodes. This paper surveys and examines representative approaches dealing with relay nodes deployment. It also discusses their shortcomings and presents a comparative study. Additionally, this paper provides a set of remarks and recommendations to improve the usage of relay nodes in wireless sensor networks and highlights open issues that need further investigation.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129255205","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}
Organisations worldwide are facing a market pressures which are forcing them to undertake digital transformation projects or initiatives. This research study set out to explore this in more depth, asking questions about the intention of South African (SA) retail organisations to adopt digital transformation and probing into the understanding and perception of digital transformation itself, as well as future intended use cases for available digital technologies. A case study approach was deemed to be an appropriate strategy given the paucity of existing academic research on the topic. Participants in the study had a good understanding of digital transformation and digital technologies, but perceptions were mixed. The most prominent digital transformation initiatives in the SA retail industry were the adoption of cloud technologies and data analytics. The factors identified in this study, using the Technology, Organisational, and Environmental (TOE) framework, can assist retailers in their decision-making process concerning digital transformation adoption.
{"title":"Factors Influencing the Intended Adoption of Digital Transformation: A South African Case Study","authors":"Jean-Paul Van Belle, R. Dyk","doi":"10.15439/2019F166","DOIUrl":"https://doi.org/10.15439/2019F166","url":null,"abstract":"Organisations worldwide are facing a market pressures which are forcing them to undertake digital transformation projects or initiatives. This research study set out to explore this in more depth, asking questions about the intention of South African (SA) retail organisations to adopt digital transformation and probing into the understanding and perception of digital transformation itself, as well as future intended use cases for available digital technologies. A case study approach was deemed to be an appropriate strategy given the paucity of existing academic research on the topic. Participants in the study had a good understanding of digital transformation and digital technologies, but perceptions were mixed. The most prominent digital transformation initiatives in the SA retail industry were the adoption of cloud technologies and data analytics. The factors identified in this study, using the Technology, Organisational, and Environmental (TOE) framework, can assist retailers in their decision-making process concerning digital transformation adoption.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"36 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131338921","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}
Optimization of the production process is important for every factory or organization. The better organization can be done by optimization of the workforce planing. The main goal is decreasing the assignment cost of the workers with the help of which, the work will be done. The problem is NP-hard, therefore it can be solved with algorithms coming from artificial intelligence. The problem is to select employers and to assign them to the jobs to be performed. The constraints of this problem are very strong and for the algorithms is difficult to find feasible solutions. We apply Ant Colony Optimization Algorithm to solve the problem.We investigate the algorithm performance according evaporation parameter. The aim is to find the best parameter setting.
{"title":"Ant Colony optimization Algorithm for Workforce Planning: Influence of the Evaporation Parameter","authors":"S. Fidanova, Gabriel Luque, O. Roeva, M. Ganzha","doi":"10.15439/2019F300","DOIUrl":"https://doi.org/10.15439/2019F300","url":null,"abstract":"Optimization of the production process is important for every factory or organization. The better organization can be done by optimization of the workforce planing. The main goal is decreasing the assignment cost of the workers with the help of which, the work will be done. The problem is NP-hard, therefore it can be solved with algorithms coming from artificial intelligence. The problem is to select employers and to assign them to the jobs to be performed. The constraints of this problem are very strong and for the algorithms is difficult to find feasible solutions. We apply Ant Colony Optimization Algorithm to solve the problem.We investigate the algorithm performance according evaporation parameter. The aim is to find the best parameter setting.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127282575","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
扫码关注我们
求助内容：
应助结果提醒方式：