{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:43:23Z","timestamp":1761896603708},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T00:00:00Z","timestamp":1499904000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10586-017-1030-1","type":"journal-article","created":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T03:48:47Z","timestamp":1499917727000},"page":"3161-3172","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Evolutionary-based automatic clustering method for optimizing multilevel network"],"prefix":"10.1007","volume":"20","author":[{"given":"Feng","family":"Wen","sequence":"first","affiliation":[]},{"given":"Xingqiao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guo","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,13]]},"reference":[{"issue":"1","key":"1030_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1.1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1.1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"1030_CR2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"1.4","author":"PE Hart","year":"1968","unstructured":"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\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"S1","key":"1030_CR3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/tee.20620","volume":"6","author":"F Wen","year":"2011","unstructured":"Wen, F., Mabu, S., Hirasawa, K.: An efficient processing method for suboptimal route computation. IEEJ Trans. Electr. Electron. Eng. 6(S1), 50\u201356 (2011)","journal-title":"IEEJ Trans. Electr. Electron. Eng."},{"issue":"8","key":"1030_CR4","doi-asserted-by":"crossref","first-page":"2107","DOI":"10.1587\/transfun.E92.A.2107","volume":"E92\u2013A","author":"F Wen","year":"2009","unstructured":"Wen, F., Gen, M., Yu, X.: Multilayer traffic network optimized by multiobjective genetic clustering algorithm. IEICE Trans. Fundam. E92\u2013A(8), 2107\u20132115 (2009)","journal-title":"IEICE Trans. Fundam."},{"issue":"11","key":"1030_CR5","doi-asserted-by":"crossref","first-page":"3324","DOI":"10.1016\/j.cor.2005.03.027","volume":"33","author":"L Fu","year":"2006","unstructured":"Fu, L., Dun, D., Rilett, L.R.: Heuristic shortest path algorithms for transportation applications: state of the art. Comput. Oper. Res. 33(11), 3324\u20133343 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1030_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013717 (2015)","DOI":"10.1109\/ICSESS.2015.7339157"},{"key":"1030_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013268 (1996)","DOI":"10.1145\/238355.238550"},{"issue":"3","key":"1030_CR8","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/69.687976","volume":"10","author":"N Jing","year":"1998","unstructured":"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\u2013432 (1998)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"1030_CR9","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S Jung","year":"2002","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029\u20131046 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1030_CR10","doi-asserted-by":"publisher","unstructured":"Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. Lecture Notes in Computer Science, October, vol. 3669, pp. 568\u2013579 (2005). doi:\n                        10.1007\/11561071_51","DOI":"10.1007\/11561071_51"},{"issue":"2","key":"1030_CR11","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TAES.2008.4560197","volume":"44","author":"R Rajagopalan","year":"2008","unstructured":"Rajagopalan, R., Mehrotra, K., Mohan, C., Varshney, P.: Hierarchical path computation approach for large graphs. IEEE Trans. Aerosp. Electron. Syst. 44(2), 427\u2013440 (2008)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"issue":"2","key":"1030_CR12","first-page":"215","volume":"29","author":"S Idwan","year":"2009","unstructured":"Idwan, S., Etaiwi, W.: Computing breadth first search in large graph using hmetis partitioning. Eur. J. Sci. Res. 29(2), 215\u2013221 (2009)","journal-title":"Eur. J. Sci. Res."},{"key":"1030_CR13","doi-asserted-by":"crossref","unstructured":"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\u201388 (2011)","DOI":"10.9746\/jcmsi.4.83"},{"key":"1030_CR14","doi-asserted-by":"crossref","unstructured":"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\u201322 (2014)","DOI":"10.1109\/MDM.2014.8"},{"issue":"16","key":"1030_CR15","doi-asserted-by":"crossref","first-page":"2359","DOI":"10.1016\/j.patrec.2007.08.006","volume":"28","author":"M Laszlo","year":"2007","unstructured":"Laszlo, M., Mukherjee, S.: A genetic algorithm that exchanges neighboring centers for k-means clustering. Pattern Recognit. Lett. 28(16), 2359\u20132366 (2007)","journal-title":"Pattern Recognit. Lett."},{"issue":"2","key":"1030_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.patrec.2003.09.012","volume":"25","author":"G Garai","year":"2004","unstructured":"Garai, G., Chaudhuri, B.B.: A novel genetic algorithm for automatic clustering. Pattern Recognit. Lett. 25(2), 173\u2013187 (2004)","journal-title":"Pattern Recognit. Lett."},{"issue":"2","key":"1030_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230140206","volume":"14","author":"S Pallottino","year":"1984","unstructured":"Pallottino, S.: Shortest-path methods: complexity, interrelations and new propositions. Networks 14(2), 257\u2013267 (1984)","journal-title":"Networks"},{"key":"1030_CR18","doi-asserted-by":"crossref","unstructured":"Gen, M., Lin, L.: Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. J. Intell. Manuf. 25(5), 849\u2013866 (2014)","DOI":"10.1007\/s10845-013-0804-4"},{"key":"1030_CR19","doi-asserted-by":"crossref","unstructured":"Yu, X., Gen, M.: Introduction to Evolutionary Algorithms. Springer (2010)","DOI":"10.1007\/978-1-84996-129-5"},{"issue":"4","key":"1030_CR20","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Glob. Optim."},{"key":"1030_CR21","first-page":"393","volume":"2","author":"KV Price","year":"2005","unstructured":"Price, K.V., Storn, R.M., Lampinen, J.A.: Differential evolution\u2014a practical approach to global optimization. Nat. Comput. 2, 393\u2013405 (2005)","journal-title":"Nat. Comput."},{"issue":"2","key":"1030_CR22","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1030_CR23","unstructured":"Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications. PhD Thesis, Swiss Federal Institute of Technology (ETH), Zurich (1999)"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-017-1030-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-017-1030-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-017-1030-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T09:18:43Z","timestamp":1510046323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-017-1030-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,13]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["1030"],"URL":"https:\/\/doi.org\/10.1007\/s10586-017-1030-1","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,13]]}}}