Skip to main content
Erschienen in: Cluster Computing 4/2017

13.07.2017

Evolutionary-based automatic clustering method for optimizing multilevel network

verfasst von: Feng Wen, Xingqiao Wang, Guo Zhang

Erschienen in: Cluster Computing | Ausgabe 4/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Route calculation is a problem in real life of every day. Multilevel road network is an effective way to speed up the optimal route calculation on large size road networks by separating the original road network into subnetworks and pre-computing new sections on the higher level network. The efficiency of the route calculation depend on how to separating the original road networks. In order to optimize the structure of multilevel networks, an evolutionary-based automatic clustering method, which can automatically search for a proper number as the number of clusters, is proposed to sperate the road network in this paper. Geographic based crossover and differential evolution based mutation are used to enhance the searching ability of the proposed method. Two objectives are considered during the evolutionary process. A practical evaluation is designed to select a proper solution from the Pareto solution set. The proposed algorithm is systematically studied in various sizes of road networks. Experimental results show that the multilevel networks constructed by the proposed approach are effective and efficient for route calculation.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1.1(1), 269–271 (1959)CrossRefMATH Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1.1(1), 269–271 (1959)CrossRefMATH
2.
Zurück zum Zitat Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 1.4(2), 100–107 (1968)CrossRef Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 1.4(2), 100–107 (1968)CrossRef
3.
Zurück zum Zitat Wen, F., Mabu, S., Hirasawa, K.: An efficient processing method for suboptimal route computation. IEEJ Trans. Electr. Electron. Eng. 6(S1), 50–56 (2011)CrossRef Wen, F., Mabu, S., Hirasawa, K.: An efficient processing method for suboptimal route computation. IEEJ Trans. Electr. Electron. Eng. 6(S1), 50–56 (2011)CrossRef
4.
Zurück zum Zitat Wen, F., Gen, M., Yu, X.: Multilayer traffic network optimized by multiobjective genetic clustering algorithm. IEICE Trans. Fundam. E92–A(8), 2107–2115 (2009)CrossRef Wen, F., Gen, M., Yu, X.: Multilayer traffic network optimized by multiobjective genetic clustering algorithm. IEICE Trans. Fundam. E92–A(8), 2107–2115 (2009)CrossRef
5.
Zurück zum Zitat Fu, L., Dun, D., Rilett, L.R.: Heuristic shortest path algorithms for transportation applications: state of the art. Comput. Oper. Res. 33(11), 3324–3343 (2006)CrossRefMATH Fu, L., Dun, D., Rilett, L.R.: Heuristic shortest path algorithms for transportation applications: state of the art. Comput. Oper. Res. 33(11), 3324–3343 (2006)CrossRefMATH
6.
Zurück zum Zitat Du, Y., Ning, H., Yang, Z., Cui, Y.: Ant colony algorithm for multilevel restricted searching area based on time dependent road network model. In: 2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS), pp. 714–717 (2015) Du, Y., Ning, H., Yang, Z., Cui, Y.: Ant colony algorithm for multilevel restricted searching area based on time dependent road network model. In: 2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS), pp. 714–717 (2015)
7.
Zurück zum Zitat Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical optimization of optimal path finding for transportation applications. In: Proceedings of ACM Conference on Information and Knowledge Management, pp. 261–268 (1996) Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical optimization of optimal path finding for transportation applications. In: Proceedings of ACM Conference on Information and Knowledge Management, pp. 261–268 (1996)
8.
Zurück zum Zitat Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng. 10(3), 409–432 (1998)CrossRef Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng. 10(3), 409–432 (1998)CrossRef
9.
Zurück zum Zitat Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029–1046 (2002)CrossRef Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029–1046 (2002)CrossRef
10.
Zurück zum Zitat Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. Lecture Notes in Computer Science, October, vol. 3669, pp. 568–579 (2005). doi:10.1007/11561071_51 Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. Lecture Notes in Computer Science, October, vol. 3669, pp. 568–579 (2005). doi:10.​1007/​11561071_​51
11.
Zurück zum Zitat Rajagopalan, R., Mehrotra, K., Mohan, C., Varshney, P.: Hierarchical path computation approach for large graphs. IEEE Trans. Aerosp. Electron. Syst. 44(2), 427–440 (2008)CrossRef Rajagopalan, R., Mehrotra, K., Mohan, C., Varshney, P.: Hierarchical path computation approach for large graphs. IEEE Trans. Aerosp. Electron. Syst. 44(2), 427–440 (2008)CrossRef
12.
Zurück zum Zitat Idwan, S., Etaiwi, W.: Computing breadth first search in large graph using hmetis partitioning. Eur. J. Sci. Res. 29(2), 215–221 (2009) Idwan, S., Etaiwi, W.: Computing breadth first search in large graph using hmetis partitioning. Eur. J. Sci. Res. 29(2), 215–221 (2009)
13.
Zurück zum Zitat Wen, F., Mabu, S., Hirasawa, K.: A genetic algorithm based clustering method for optimal route calculation on multilevel networks. SICE J. Control Meas. Syst. Integr. 4(1), 83–88 (2011) Wen, F., Mabu, S., Hirasawa, K.: A genetic algorithm based clustering method for optimal route calculation on multilevel networks. SICE J. Control Meas. Syst. Integr. 4(1), 83–88 (2011)
14.
Zurück zum Zitat Wang, J., Zheng, K., Wang, H., Zhou, X.: Cost-efficient spatial network partitioning for distance-based query processing. In: Proceedings of the 2014 IEEE 15th International Conference on Mobile Data Management, Washington, DC, USA, vol. 1, pp. 13–22 (2014) Wang, J., Zheng, K., Wang, H., Zhou, X.: Cost-efficient spatial network partitioning for distance-based query processing. In: Proceedings of the 2014 IEEE 15th International Conference on Mobile Data Management, Washington, DC, USA, vol. 1, pp. 13–22 (2014)
15.
Zurück zum Zitat Laszlo, M., Mukherjee, S.: A genetic algorithm that exchanges neighboring centers for k-means clustering. Pattern Recognit. Lett. 28(16), 2359–2366 (2007)CrossRef Laszlo, M., Mukherjee, S.: A genetic algorithm that exchanges neighboring centers for k-means clustering. Pattern Recognit. Lett. 28(16), 2359–2366 (2007)CrossRef
16.
Zurück zum Zitat Garai, G., Chaudhuri, B.B.: A novel genetic algorithm for automatic clustering. Pattern Recognit. Lett. 25(2), 173–187 (2004)CrossRef Garai, G., Chaudhuri, B.B.: A novel genetic algorithm for automatic clustering. Pattern Recognit. Lett. 25(2), 173–187 (2004)CrossRef
17.
18.
Zurück zum Zitat Gen, M., Lin, L.: Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. J. Intell. Manuf. 25(5), 849–866 (2014) Gen, M., Lin, L.: Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. J. Intell. Manuf. 25(5), 849–866 (2014)
19.
Zurück zum Zitat Yu, X., Gen, M.: Introduction to Evolutionary Algorithms. Springer (2010) Yu, X., Gen, M.: Introduction to Evolutionary Algorithms. Springer (2010)
20.
Zurück zum Zitat Storn, R., Price, K.: Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)CrossRefMATHMathSciNet Storn, R., Price, K.: Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)CrossRefMATHMathSciNet
21.
Zurück zum Zitat Price, K.V., Storn, R.M., Lampinen, J.A.: Differential evolution—a practical approach to global optimization. Nat. Comput. 2, 393–405 (2005)MATH Price, K.V., Storn, R.M., Lampinen, J.A.: Differential evolution—a practical approach to global optimization. Nat. Comput. 2, 393–405 (2005)MATH
22.
Zurück zum Zitat Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)CrossRef Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)CrossRef
23.
Zurück zum Zitat Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications. PhD Thesis, Swiss Federal Institute of Technology (ETH), Zurich (1999) Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications. PhD Thesis, Swiss Federal Institute of Technology (ETH), Zurich (1999)
Metadaten
Titel
Evolutionary-based automatic clustering method for optimizing multilevel network
verfasst von
Feng Wen
Xingqiao Wang
Guo Zhang
Publikationsdatum
13.07.2017
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe 4/2017
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-017-1030-1

Weitere Artikel der Ausgabe 4/2017

Cluster Computing 4/2017 Zur Ausgabe

Premium Partner