Pub Date : 2023-01-01DOI: 10.1504/ijcsm.2023.130420
Ibrahim Fares, Aboul Ella Hassanien, Rizk M. Rizk Allah, Roushdy Mohamed Farouk, Hassan Mostafa Abo donia
{"title":"Solving capacitated vehicle routing problem with route optimisation based on equilibrium optimiser algorithm","authors":"Ibrahim Fares, Aboul Ella Hassanien, Rizk M. Rizk Allah, Roushdy Mohamed Farouk, Hassan Mostafa Abo donia","doi":"10.1504/ijcsm.2023.130420","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.130420","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135637421","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 : 2023-01-01DOI: 10.1504/ijcsm.2023.130691
Hongwei Liu, Zihao Zhang
Highway project has the characteristics of large investment scale and high investment risk. Aiming at the problem of investment risk management, this paper takes 15 highway investment projects in recent ten years as the research object, and establishes an investment risk index system including 12 first-class indexes and 30 second-class indexes. The hierarchical weight model of highway engineering investment risk assessment is proposed. The intelligent evaluation of highway engineering investment risk by extreme learning machine and broad learning system algorithm is discussed. The comparative experimental results show that the improved intelligent evaluation model can evaluate and predict the investment risk of highway engineering projects more effectively. The R-square value of the improved intelligent evaluation model is increased by 0.35, and the accuracy is greatly improved. It can provide decision support for highway engineering project investment risk management.
{"title":"Learning-assisted intelligent risk assessment of highway project investment","authors":"Hongwei Liu, Zihao Zhang","doi":"10.1504/ijcsm.2023.130691","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.130691","url":null,"abstract":"Highway project has the characteristics of large investment scale and high investment risk. Aiming at the problem of investment risk management, this paper takes 15 highway investment projects in recent ten years as the research object, and establishes an investment risk index system including 12 first-class indexes and 30 second-class indexes. The hierarchical weight model of highway engineering investment risk assessment is proposed. The intelligent evaluation of highway engineering investment risk by extreme learning machine and broad learning system algorithm is discussed. The comparative experimental results show that the improved intelligent evaluation model can evaluate and predict the investment risk of highway engineering projects more effectively. The R-square value of the improved intelligent evaluation model is increased by 0.35, and the accuracy is greatly improved. It can provide decision support for highway engineering project investment risk management.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135636831","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 : 2023-01-01DOI: 10.1504/ijcsm.2023.10059181
Qi Cao, Wensheng Yang
{"title":"Dynamics of a delayed stage structure predator-prey model with predator-dependent prey refuge","authors":"Qi Cao, Wensheng Yang","doi":"10.1504/ijcsm.2023.10059181","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10059181","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135496539","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 : 2023-01-01DOI: 10.1504/ijcsm.2023.10057828
Guofang Liu, Lixiang Shi
{"title":"Research on the construction of personalized recommendation system based on LFM algorithm and tag data","authors":"Guofang Liu, Lixiang Shi","doi":"10.1504/ijcsm.2023.10057828","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10057828","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"1 1","pages":"350-364"},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66728171","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 : 2023-01-01DOI: 10.1504/ijcsm.2023.133631
A.C. Mahasinghe, K.K.W.H. Erandi, S.S.N. Perera
Prevailing dengue-control strategies in many developing countries yield only limited benefits due to non-optimality of those strategies. In this paper, we demonstrate how the same strategies could be altered using the same amount of resources in order to yield more fruitful results. Accordingly, we develop a binary integer programming model, aimed at minimising the total number of susceptible individuals with high-risk of being infected with dengue, by identifying the most influential dengue-infected individuals who could undergo an epidemiological isolation, subject to the conditions imposed by the topological properties of the epidemiological network and budgetary constraints. Further, we analyse the proposed epidemiological isolation to examine its adequacy in a real-world implementation.
{"title":"An integer programming model for controlling dengue transmission","authors":"A.C. Mahasinghe, K.K.W.H. Erandi, S.S.N. Perera","doi":"10.1504/ijcsm.2023.133631","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.133631","url":null,"abstract":"Prevailing dengue-control strategies in many developing countries yield only limited benefits due to non-optimality of those strategies. In this paper, we demonstrate how the same strategies could be altered using the same amount of resources in order to yield more fruitful results. Accordingly, we develop a binary integer programming model, aimed at minimising the total number of susceptible individuals with high-risk of being infected with dengue, by identifying the most influential dengue-infected individuals who could undergo an epidemiological isolation, subject to the conditions imposed by the topological properties of the epidemiological network and budgetary constraints. Further, we analyse the proposed epidemiological isolation to examine its adequacy in a real-world implementation.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135799472","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 : 2023-01-01DOI: 10.1504/ijcsm.2023.10056283
Miao Zhang
{"title":"Research on bilingual text similarity detection and analysis based on improved fragment merging algorithm","authors":"Miao Zhang","doi":"10.1504/ijcsm.2023.10056283","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10056283","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"18 1","pages":"189-202"},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66728018","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 : 2023-01-01DOI: 10.1504/ijcsm.2023.134568
Mingze Ma, Wenjun Wang, Xin Li
The artificial bee colony (ABC) has shown great potential among many swarm intelligence optimisation algorithms (SIOAs). However, ABC still shows deficiencies in some aspects. The weak exploitation ability makes the original ABC hard to achieve promising results when dealing with complex optimisation problems. The roulette selection method may not work at the late search stage. To make up for these deficiencies, a modified multi-population ABC with the nearest neighbourhood partition (namely NNPMABC) is proposed in this paper. Firstly, a novel partition method is used to divide the swarm into several subgroups. Then, three improved search strategies and a new selection method based on the nearest neighbour partition are designed. In addition, a new search strategy is constructed for the scout bee stage. To prove the effectiveness of NNPMABC, 22 benchmark problems are tested. Results show NNPMABC performs the best among six ABCs.
{"title":"Multi-population artificial bee colony algorithm based on the nearest neighbour partition","authors":"Mingze Ma, Wenjun Wang, Xin Li","doi":"10.1504/ijcsm.2023.134568","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.134568","url":null,"abstract":"The artificial bee colony (ABC) has shown great potential among many swarm intelligence optimisation algorithms (SIOAs). However, ABC still shows deficiencies in some aspects. The weak exploitation ability makes the original ABC hard to achieve promising results when dealing with complex optimisation problems. The roulette selection method may not work at the late search stage. To make up for these deficiencies, a modified multi-population ABC with the nearest neighbourhood partition (namely NNPMABC) is proposed in this paper. Firstly, a novel partition method is used to divide the swarm into several subgroups. Then, three improved search strategies and a new selection method based on the nearest neighbour partition are designed. In addition, a new search strategy is constructed for the scout bee stage. To prove the effectiveness of NNPMABC, 22 benchmark problems are tested. Results show NNPMABC performs the best among six ABCs.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135262346","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
扫码关注我们
求助内容：
应助结果提醒方式：