Pub Date : 2019-04-29DOI: 10.7287/peerj.preprints.27692v1
B. Almonacid
The problem of cell formation is an NP-Hard problem, which consists of organising a group of machines and pieces in several cells. The machines are arranged in a fixed way inside the cells, and each machine has some manufacturing operation that applies in different pieces or parts. The idea of the problem is to be able to minimise the movements made by the pieces to reach the machines in the cells. For this problem, a data set has been organised using three manufacturing cells. Through the data set an experiment has been carried out that focuses on obtaining the best solution using a global search solution within 6 days for each instance. The experimental results have been able to obtain the general optimum value for a set of test instances.
{"title":"Resolve the cell formation problem in a set of three manufacturing cells","authors":"B. Almonacid","doi":"10.7287/peerj.preprints.27692v1","DOIUrl":"https://doi.org/10.7287/peerj.preprints.27692v1","url":null,"abstract":"The problem of cell formation is an NP-Hard problem, which consists of organising a group of machines and pieces in several cells. The machines are arranged in a fixed way inside the cells, and each machine has some manufacturing operation that applies in different pieces or parts. The idea of the problem is to be able to minimise the movements made by the pieces to reach the machines in the cells. For this problem, a data set has been organised using three manufacturing cells. Through the data set an experiment has been carried out that focuses on obtaining the best solution using a global search solution within 6 days for each instance. The experimental results have been able to obtain the general optimum value for a set of test instances.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"59 1","pages":"e27692"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75828934","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-04-24DOI: 10.7287/peerj.preprints.27678v1
B. Almonacid
In this article a preliminary experiment is carried out in which a set of elements and procedures are described to be able to solve problems of continuous domains integrated in the Andean Condor Algorithm. The Andean Condor Algorithm is a metaheuristic algorithm of swarm intelligence inspired by the movement pattern of the Andean condor when searching for its food. An experiment focused on solving the problem of the function 1st De Jong's (f(x_1 cdots x_n) = sum_{i=1}^n x_i^2,~ -100 leq x_i leq 100). According to the results obtained, solutions have been obtained close to the overall optimum value of the problem.
{"title":"Preliminary experiments with the Andean Condor Algorithm to solve problems of Continuous Domains","authors":"B. Almonacid","doi":"10.7287/peerj.preprints.27678v1","DOIUrl":"https://doi.org/10.7287/peerj.preprints.27678v1","url":null,"abstract":"In this article a preliminary experiment is carried out in which a set of elements and procedures are described to be able to solve problems of continuous domains integrated in the Andean Condor Algorithm. The Andean Condor Algorithm is a metaheuristic algorithm of swarm intelligence inspired by the movement pattern of the Andean condor when searching for its food. An experiment focused on solving the problem of the function 1st De Jong's (f(x_1 cdots x_n) = sum_{i=1}^n x_i^2,~ -100 leq x_i leq 100). According to the results obtained, solutions have been obtained close to the overall optimum value of the problem.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"180 1","pages":"e27678"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86708823","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-04-16DOI: 10.7287/peerj.preprints.27656v1
M. El-Dosuky
Programmers’ lack of familiarity with what is available in packages may prompt them to reinvent the wheel. This is generally the case in any programming language, but it is a matter of madness with a language described as difficult even by professionals supporting it such as R. In R Cookbook, says: “But R can be frustrating. It’s not obvious how to accomplish many tasks, even simple ones.” IPOMOEA is a code that has been written to mitigate this problem. It helps R language developers determine how to perform a specific task, by automating the search in R site for all packages that are likely to contribute to the task implementation. After that, IPOMOEA determines a partial set of results to be the intended package using multi-objective evolutionary algorithm NSGA-II . Not only does it specify the intended package, but also it helps orient programmers and manage packages. Keywords:
{"title":"IPOMOEA: Intended package orientation using multi-objective evolutionary algorithm in R","authors":"M. El-Dosuky","doi":"10.7287/peerj.preprints.27656v1","DOIUrl":"https://doi.org/10.7287/peerj.preprints.27656v1","url":null,"abstract":"Programmers’ lack of familiarity with what is available in packages may prompt them to reinvent the wheel. This is generally the case in any programming language, but it is a matter of madness with a language described as difficult even by professionals supporting it such as R. In R Cookbook, says: “But R can be frustrating. It’s not obvious how to accomplish many tasks, even simple ones.” IPOMOEA is a code that has been written to mitigate this problem. It helps R language developers determine how to perform a specific task, by automating the search in R site for all packages that are likely to contribute to the task implementation. After that, IPOMOEA determines a partial set of results to be the intended package using multi-objective evolutionary algorithm NSGA-II . Not only does it specify the intended package, but also it helps orient programmers and manage packages. Keywords:","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"1 1","pages":"e27656"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90306114","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-04-13DOI: 10.7287/PEERJ.PREPRINTS.27651V11
S. Banerjee
Epidemics may both contribute to and arise as a result of conflict. The effects of conflict on infectious diseases are complex and there have been confounding observations of both increase and decrease in disease outbreaks during and after conflicts. However there is no unified mathematical model that explains all these counter-intuitive observations. There is an urgent need for a quantitative framework for modelling conflicts and epidemics. We introduce a set of mathematical models to understand the role of conflicts in epidemics. Our mathematical framework has the potential to explain the counterintuitive observations and the complex role of human conflicts in epidemics. Our work suggests that aid and peacekeeping organizations should take an integrated approach that combines public health measures, socio-economic development, and peacekeeping in the conflict zone. Our approach exemplifies the role of non-linear thinking in complex systems like human societies. We view our work as a step towards a quantitative model of disease spread in conflicts.
{"title":"Towards a quantitative model of epidemics during conflicts","authors":"S. Banerjee","doi":"10.7287/PEERJ.PREPRINTS.27651V11","DOIUrl":"https://doi.org/10.7287/PEERJ.PREPRINTS.27651V11","url":null,"abstract":"Epidemics may both contribute to and arise as a result of conflict. The effects of conflict on infectious diseases are complex and there have been confounding observations of both increase and decrease in disease outbreaks during and after conflicts. However there is no unified mathematical model that explains all these counter-intuitive observations. There is an urgent need for a quantitative framework for modelling conflicts and epidemics. We introduce a set of mathematical models to understand the role of conflicts in epidemics. Our mathematical framework has the potential to explain the counterintuitive observations and the complex role of human conflicts in epidemics. Our work suggests that aid and peacekeeping organizations should take an integrated approach that combines public health measures, socio-economic development, and peacekeeping in the conflict zone. Our approach exemplifies the role of non-linear thinking in complex systems like human societies. We view our work as a step towards a quantitative model of disease spread in conflicts.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"10 1","pages":"e27651"},"PeriodicalIF":0.0,"publicationDate":"2019-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84956644","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-04-12DOI: 10.7287/PEERJ.PREPRINTS.3150V3
S. Banerjee
The immune system is a distributed decentralized system that functions without any centralized control. The immune system has millions of cells that function somewhat independently and can detect and respond to pathogens with considerable speed and efficiency. Lymph nodes are physical anatomical structures that allow the immune system to rapidly detect pathogens and mobilize cells to respond to it. Lymph nodes function as: 1) information processing centers, and 2) a distributed detection and response network. We introduce biologically inspired computing that uses lymph nodes as inspiration. We outline applications to diverse domains like mobile robots, distributed computing clusters, peer-to-peer networks and online social networks. We argue that lymph node inspired computing systems provide powerful metaphors for distributed computing and complement existing artificial immune systems. We view our work as a first step towards holistic simulations of the immune system that would capture all the complexities and the power of a complex adaptive system like the immune system. Ultimately this would lead to holistic immune system inspired computing that captures all the complexities and power of the immune system in human-engineered complex systems.
{"title":"Lymph node inspired computing: immune system inspired architectures for human-engineered complex systems","authors":"S. Banerjee","doi":"10.7287/PEERJ.PREPRINTS.3150V3","DOIUrl":"https://doi.org/10.7287/PEERJ.PREPRINTS.3150V3","url":null,"abstract":"The immune system is a distributed decentralized system that functions without any centralized control. The immune system has millions of cells that function somewhat independently and can detect and respond to pathogens with considerable speed and efficiency. Lymph nodes are physical anatomical structures that allow the immune system to rapidly detect pathogens and mobilize cells to respond to it. Lymph nodes function as: 1) information processing centers, and 2) a distributed detection and response network. We introduce biologically inspired computing that uses lymph nodes as inspiration. We outline applications to diverse domains like mobile robots, distributed computing clusters, peer-to-peer networks and online social networks. We argue that lymph node inspired computing systems provide powerful metaphors for distributed computing and complement existing artificial immune systems. We view our work as a first step towards holistic simulations of the immune system that would capture all the complexities and the power of a complex adaptive system like the immune system. Ultimately this would lead to holistic immune system inspired computing that captures all the complexities and power of the immune system in human-engineered complex systems.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"151 1","pages":"e3150"},"PeriodicalIF":0.0,"publicationDate":"2019-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86171768","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-04-01DOI: 10.7287/PEERJ.PREPRINTS.27624V1
Ali Malik, B. Aziz, A. Al-Haj, M. Adda
In recent years, the emerging paradigm of software-defined networking has become a hot and thriving topic that grabbed the attention of industry sector as well as the academic research community. The decoupling between the network control and data planes means that software-defined networking architecture is programmable, adjustable and dynamically re-configurable. As a result, a large number of leading companies across the world have latterly launched software-defined solutions in their data centers and it is expected that most of the service providers will do so in the near future due to the new opportunities enabled by software-defined architectures. Nonetheless, each emerging technology is accompanied by new issues and concerns, and fault tolerance and recovery is one such issue that faces software-defined networking. Although there have been numerous studies that have discussed this issue, gaps still exist and need to be highlighted. In this paper, we start by tracing the evolution of networking systems from the mid 1990's until the emergence of programmable networks and software-defined networking, and then define a taxonomy for software-defined networking dependability by means of fault tolerance of data plane to cover all aspects, challenges and factors that need to be considered in future solutions. We discuss in a detailed manner current state-of-the-art literature in this area. Finally, we analyse the current gaps in current research and propose possible directions for future work.
{"title":"Software-defined networks: A walkthrough guide from occurrence To data plane fault tolerance","authors":"Ali Malik, B. Aziz, A. Al-Haj, M. Adda","doi":"10.7287/PEERJ.PREPRINTS.27624V1","DOIUrl":"https://doi.org/10.7287/PEERJ.PREPRINTS.27624V1","url":null,"abstract":"In recent years, the emerging paradigm of software-defined networking has become a hot and thriving topic that grabbed the attention of industry sector as well as the academic research community. The decoupling between the network control and data planes means that software-defined networking architecture is programmable, adjustable and dynamically re-configurable. As a result, a large number of leading companies across the world have latterly launched software-defined solutions in their data centers and it is expected that most of the service providers will do so in the near future due to the new opportunities enabled by software-defined architectures. Nonetheless, each emerging technology is accompanied by new issues and concerns, and fault tolerance and recovery is one such issue that faces software-defined networking. Although there have been numerous studies that have discussed this issue, gaps still exist and need to be highlighted. In this paper, we start by tracing the evolution of networking systems from the mid 1990's until the emergence of programmable networks and software-defined networking, and then define a taxonomy for software-defined networking dependability by means of fault tolerance of data plane to cover all aspects, challenges and factors that need to be considered in future solutions. We discuss in a detailed manner current state-of-the-art literature in this area. Finally, we analyse the current gaps in current research and propose possible directions for future work.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"77 1","pages":"e27624"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82682732","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-03-27DOI: 10.7287/peerj.preprints.27615v1
Daniel Liu
Previous algorithms for solving the approximate string matching with Hamming distance problem with wildcard ("don't care") characters have been shown to take (O(|Sigma| N log M)) time, where (N) is the length of the text, (M) is the length of the pattern, and (|Sigma|) is the size of the alphabet. They make use of the Fast Fourier Transform for efficiently calculating convolutions. We describe a novel approach of the problem, which makes use of special encoding schemes that depend on ((|Sigma| - 1))-simplexes in ((|Sigma| - 1))-dimensional space.
先前用于解决带有通配符(“不关心”)字符的近似字符串匹配与汉明距离问题的算法已被证明需要(O(|Sigma| N log M))时间，其中(N)是文本的长度，(M)是模式的长度，(|Sigma|)是字母表的大小。他们利用快速傅里叶变换来有效地计算卷积。我们描述了一种解决该问题的新方法，该方法利用了在((|Sigma| - 1))维空间中依赖于((|Sigma| - 1)) -simplexes的特殊编码方案。
{"title":"Approximate string searching with fast fourier transforms and simplexes","authors":"Daniel Liu","doi":"10.7287/peerj.preprints.27615v1","DOIUrl":"https://doi.org/10.7287/peerj.preprints.27615v1","url":null,"abstract":"Previous algorithms for solving the approximate string matching with Hamming distance problem with wildcard (\"don't care\") characters have been shown to take (O(|Sigma| N log M)) time, where (N) is the length of the text, (M) is the length of the pattern, and (|Sigma|) is the size of the alphabet. They make use of the Fast Fourier Transform for efficiently calculating convolutions. We describe a novel approach of the problem, which makes use of special encoding schemes that depend on ((|Sigma| - 1))-simplexes in ((|Sigma| - 1))-dimensional space.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"9 1","pages":"e27615"},"PeriodicalIF":0.0,"publicationDate":"2019-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76805438","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-03-22DOI: 10.7287/peerj.preprints.27610v1
Bruno Cartaxo, G. Pinto, F. Kamei, D. Ribeiro, F. Silva, S. Soares
Context: One of the goals of Evidence-Based Software Engineering is to leverage evidence from research to practice. However, some studies suggest this goal has not being fully accomplished. Objective: This paper proposes a strategy to assess how systematic reviews cover practitioners' issues in software engineering. Method: We selected 24 systematic reviews identified by a comprehensive tertiary study. Using search strings of the selected systematic reviews, we queried most relevant practitioners' issues on five active Stack Exchange communities, a professional and high-quality Question & Answer platform. After examining more than 1,800 issues, we investigated how findings of the selected systematic reviews could help to solve (i.e. cover) practitioners' issues. Results: After excluding false positives and duplicates, a total of 424 issues were considered related to the selected systematic reviews. This number corresponds to 1.75% of the 26,687 most relevant issues on the five Stack Exchange communities. Among these 424 issues, systematic reviews can successfully cover 14.1% (60) of them. Based on a qualitative analysis, we identified 45 recurrent issues spread in many software engineering areas. The most demanded topic is related to agile software development, with 15 recurrent issues identified and 127 practitioners' issues as a whole. Conclusions: An overall coverage rate of 14.1% reveals a good opportunity for conducting systematic reviews in software engineering to fill the gap of not covered issues. We also observed practitioners explicitly demanding for scientific empirical evidence, rich in context and oriented to specific target audiences. Finally, we also provided guidelines for researchers who want to conduct systematic reviews more connected with software engineering practice.
{"title":"How systematic reviews cover practitioners' issues: A study on Stack Exchange communities","authors":"Bruno Cartaxo, G. Pinto, F. Kamei, D. Ribeiro, F. Silva, S. Soares","doi":"10.7287/peerj.preprints.27610v1","DOIUrl":"https://doi.org/10.7287/peerj.preprints.27610v1","url":null,"abstract":"Context: One of the goals of Evidence-Based Software Engineering is to leverage evidence from research to practice. However, some studies suggest this goal has not being fully accomplished.\u0000 Objective: This paper proposes a strategy to assess how systematic reviews cover practitioners' issues in software engineering.\u0000 Method: We selected 24 systematic reviews identified by a comprehensive tertiary study. Using search strings of the selected systematic reviews, we queried most relevant practitioners' issues on five active Stack Exchange communities, a professional and high-quality Question & Answer platform. After examining more than 1,800 issues, we investigated how findings of the selected systematic reviews could help to solve (i.e. cover) practitioners' issues.\u0000 Results: After excluding false positives and duplicates, a total of 424 issues were considered related to the selected systematic reviews. This number corresponds to 1.75% of the 26,687 most relevant issues on the five Stack Exchange communities. Among these 424 issues, systematic reviews can successfully cover 14.1% (60) of them. Based on a qualitative analysis, we identified 45 recurrent issues spread in many software engineering areas. The most demanded topic is related to agile software development, with 15 recurrent issues identified and 127 practitioners' issues as a whole.\u0000 Conclusions: An overall coverage rate of 14.1% reveals a good opportunity for conducting systematic reviews in software engineering to fill the gap of not covered issues. We also observed practitioners explicitly demanding for scientific empirical evidence, rich in context and oriented to specific target audiences. Finally, we also provided guidelines for researchers who want to conduct systematic reviews more connected with software engineering practice.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"79 1","pages":"e27610"},"PeriodicalIF":0.0,"publicationDate":"2019-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84973768","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-03-22DOI: 10.7287/peerj.preprints.27609v1
K. Rehman, Anaa Yasin, Tariq Mahmood, Muhammad Azeem, Saqib Ali
In search engine optimization individual website pages are optimized through precise keywords, while the websites are optimized using back link watch. The existing literature has no proper guideline for keywords selection and back link generation. In this research, we proposed a model for making back link watch generation and the selection of keywords through precise research analysis. The information on webpages consist of specific keywords while the website traffic is monitored through referrals. we concluded that during the development of Page Content, and architecture, if selected keywords are used in Title, Headings and Meta Tag then the page result is higher in search results. Moreover, for the back-link generation use a shorter volume of URL that monitor the complete traffic of a site can be placed on trusted location which increase the ranks of a site. Proposed model has been validated by comparing quantitative data of website rank taken before and after implementation of framework. Results revealed that overall increase gained in site rank by applying the proposed model was 40%.
{"title":"SEO: A unique approach to enhance the site rank by implementing Efficient Keywords Scheme","authors":"K. Rehman, Anaa Yasin, Tariq Mahmood, Muhammad Azeem, Saqib Ali","doi":"10.7287/peerj.preprints.27609v1","DOIUrl":"https://doi.org/10.7287/peerj.preprints.27609v1","url":null,"abstract":"In search engine optimization individual website pages are optimized through precise keywords, while the websites are optimized using back link watch. The existing literature has no proper guideline for keywords selection and back link generation. In this research, we proposed a model for making back link watch generation and the selection of keywords through precise research analysis. The information on webpages consist of specific keywords while the website traffic is monitored through referrals. we concluded that during the development of Page Content, and architecture, if selected keywords are used in Title, Headings and Meta Tag then the page result is higher in search results. Moreover, for the back-link generation use a shorter volume of URL that monitor the complete traffic of a site can be placed on trusted location which increase the ranks of a site. Proposed model has been validated by comparing quantitative data of website rank taken before and after implementation of framework. Results revealed that overall increase gained in site rank by applying the proposed model was 40%.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"58 1","pages":"e27609"},"PeriodicalIF":0.0,"publicationDate":"2019-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80628973","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-03-03DOI: 10.7287/peerj.preprints.27562v1
Fei Lin, Yang Yang, Shihua Wang, Yudi Xu, Hong Ma
Unreasonable public bicycle dispatching area division seriously affects the operational efficiency of the public bicycle system. To solve this problem, this paper innovatively proposes an improved community discovery algorithm based on multi-objective optimization (CDoMO). The data set is preprocessed into a lease/return relationship, thereby it calculated a similarity matrix, and the community discovery algorithm Fast Unfolding is executed on the matrix to obtain a scheduling scheme. For the results obtained by the algorithm, the workload indicators (scheduled distance, number of sites, and number of scheduling bicycles) should be adjusted to maximize the overall benefits, and the entire process is continuously optimized by a multi-objective optimization algorithm NSGA2. The experimental results show that compared with the clustering algorithm and the community discovery algorithm, the method can shorten the estimated scheduling distance by 20%-50%, and can effectively balance the scheduling workload of each area. The method can provide theoretical support for the public bicycle dispatching department, and improve the efficiency of public bicycle dispatching system.
{"title":"Research on urban public bicycle dispatching optimization method","authors":"Fei Lin, Yang Yang, Shihua Wang, Yudi Xu, Hong Ma","doi":"10.7287/peerj.preprints.27562v1","DOIUrl":"https://doi.org/10.7287/peerj.preprints.27562v1","url":null,"abstract":"Unreasonable public bicycle dispatching area division seriously affects the operational efficiency of the public bicycle system. To solve this problem, this paper innovatively proposes an improved community discovery algorithm based on multi-objective optimization (CDoMO). The data set is preprocessed into a lease/return relationship, thereby it calculated a similarity matrix, and the community discovery algorithm Fast Unfolding is executed on the matrix to obtain a scheduling scheme. For the results obtained by the algorithm, the workload indicators (scheduled distance, number of sites, and number of scheduling bicycles) should be adjusted to maximize the overall benefits, and the entire process is continuously optimized by a multi-objective optimization algorithm NSGA2. The experimental results show that compared with the clustering algorithm and the community discovery algorithm, the method can shorten the estimated scheduling distance by 20%-50%, and can effectively balance the scheduling workload of each area. The method can provide theoretical support for the public bicycle dispatching department, and improve the efficiency of public bicycle dispatching system.","PeriodicalId":93040,"journal":{"name":"PeerJ preprints","volume":"35 1","pages":"e27562"},"PeriodicalIF":0.0,"publicationDate":"2019-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89932377","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
扫码关注我们
求助内容：
应助结果提醒方式：