CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

K-Means Clustering and Firefly Algorithm for Shortest Route Solution based on Crime Hotspots

by Nurlela Pandiangan, Rahmat Gerowo, Vicensius Gunawan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 180 - Number 52
Year of Publication: 2018
Authors: Nurlela Pandiangan, Rahmat Gerowo, Vicensius Gunawan
10.5120/ijca2018917361

Nurlela Pandiangan, Rahmat Gerowo, Vicensius Gunawan . K-Means Clustering and Firefly Algorithm for Shortest Route Solution based on Crime Hotspots. International Journal of Computer Applications. 180, 52 ( Jun 2018), 19-24. DOI=10.5120/ijca2018917361

@article{ 10.5120/ijca2018917361,
author = { Nurlela Pandiangan, Rahmat Gerowo, Vicensius Gunawan },
title = { K-Means Clustering and Firefly Algorithm for Shortest Route Solution based on Crime Hotspots },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2018 },
volume = { 180 },
number = { 52 },
month = { Jun },
year = { 2018 },
issn = { 0975-8887 },
pages = { 19-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume180/number52/29593-2018917361/ },
doi = { 10.5120/ijca2018917361 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:04:18.627960+05:30
%A Nurlela Pandiangan
%A Rahmat Gerowo
%A Vicensius Gunawan
%T K-Means Clustering and Firefly Algorithm for Shortest Route Solution based on Crime Hotspots
%J International Journal of Computer Applications
%@ 0975-8887
%V 180
%N 52
%P 19-24
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Routing problem becomes a problem that is often discussed. Minimize the time, vehicle, or shipping costs become the main focus. In this study, Firefly Algorithm (FA) to forming the optimal route for police patrol problems. The patrol route becomes important to be optimally formed to be effective in cracking down on crime and maintaining security. By adopting a multi-agent police patrol, this study uses two steps: the grouping of Hotspots of Criminal Case using the K-Means Algorithm to limit the Police Agent's patrol and Firefly Algorithm patrol areas as an algorithm to establish an optimal route. As a result, users still get optimal route results even with different parameter values. Based on the convergence result, the three scenarios with parameter values are bigger than other scenarios, are Alpha value: 0.3, Beta: 1,5, and Gamma: 0.45 are superior to make optimal route on two clusters A4 and A5 with total time the average execution is less that is 558862.4 microseconds.

References
  1. N. Ali, M. A. Othman, M. H. Misran, M. K. Nor, and H. A. Sulaiman, “Firefly Algorithm with Attractiveness Matrix Enhancement for Shortest Route Alternative Solution,” no. 14ct, pp. 177–180, 2015.
  2. J. C. Ferreira, M. T. Arns Steiner, and M. Siqueira Guersola, “A Vehicle Routing Problem Solved Through Some Metaheuristics Procedures: A Case Study,” IEEE Lat. Am. Trans., vol. 15, no. 5, pp. 943–949, 2017.
  3. O. Dib, M. A. Manier, and A. Caminada, “A Hybrid Metaheuristic for Routing in Road Networks,” IEEE Conf. Intell. Transp. Syst. Proceedings, ITSC, vol. 2015–Octob, pp. 765–770, 2015.
  4. X.-S. Yang and M. Karamanoglu, 1 - Swarm Intelligence and Bio-Inspired Computation: An Overview BT - Swarm Intelligence and Bio-Inspired Computation. 2013.
  5. I. Strumberger, “Enhanced Firefly Algorithm for Constrained Numerical Optimization,” pp. 2120–2127, 2017.
  6. A. Tjahjono, D. O. Anggriawan, A. K. Faizin, A. Priyadi, M. Pujiantara, and M. H. Purnomo, “Adaptive modified firefly algorithm for optimal coordination of overcurrent relays,” pp. 2575–2585, 2017.
  7. M. Gao, L. Li, X. Sun, L. Yin, H. Li, and D. Luo, “Optik Firefly algorithm ( FA ) based particle filter method for visual tracking,” vol. 126, pp. 1705–1711, 2015.
  8. R. J. Kuo and P. S. Li, “Taiwanese export trade forecasting using firefly algorithm based K-means algorithm and SVR with wavelet transform,” Comput. Ind. Eng., vol. 99, pp. 153–161, 2016.
  9. T. Hassanzadeh and M. R. Meybodi, “A new hybrid approach for data clustering using firefly algorithm and K-means,” 16th CSI Int. Symp. Artif. Intell. Signal Process. (AISP 2012), no. Aisp, pp. 007–011, 2012.
  10. L. Lei, “The GIS-based Research on Criminal Cases Hotspots Identifying,” Procedia Environ. Sci., vol. 12, no. Icese 2011, pp. 957–963, 2012.
  11. H. Chen, T. Cheng, and S. Wise, “Developing an online cooperative police patrol routing strategy,” Comput. Environ. Urban Syst., vol. 62, pp. 19–29, 2017.
  12. M. Camacho-Collados, F. Liberatore, and J. M. Angulo, “A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector,” Eur. J. Oper. Res., vol. 246, no. 2, pp. 674–684, 2015.
  13. L. Zhiwei, Y. Xiang, and D. Yao, “A partitioning-based task allocation strategy for Police Multi-Agents,” pp. 2124–2128, 2014.
  14. R. Goel and R. Maini, “SC,” J. Comput. Sci., 2017.
  15. S. Kapil and M. Chawla, “Performance Evaluation ofK-means Clustering Algorithm with Various Distance Metrics,” pp. 4–7, 2016.
  16. Z. Jalali, “Development of slope mass rating system using K-means and fuzzy c-means clustering algorithms,” Int. J. Min. Sci. Technol., vol. 26, no. 6, pp. 959–966, 2016.
  17. T. Tada, K. Hitomi, Y. Wu, S. Y. Kim, H. Yamazaki, and K. Ishii, “K-mean clustering algorithm for processing signals from compound semiconductor detectors,” Nucl. Instruments Methods Phys. Res. Sect. A Accel. Spectrometers, Detect. Assoc. Equip., vol. 659, no. 1, pp. 242–246, 2011.
  18. B. Felipe, “Ac ce pt us cr t,” 2015.
Index Terms

Computer Science
Information Sciences

Keywords

Firefly Algorithm K-Means Clustering.

Powered by PhDFocusTM