{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:45:44Z","timestamp":1742975144636,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":48,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819980666"},{"type":"electronic","value":"9789819980673"}],"license":[{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-8067-3_4","type":"book-chapter","created":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T20:02:55Z","timestamp":1700078575000},"page":"40-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Evolutionary Computation for Berth Allocation Problems: A Survey"],"prefix":"10.1007","author":[{"given":"Xin-Xin","family":"Xu","sequence":"first","affiliation":[]},{"given":"Yi","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiang-Qian","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Zhi-Hui","family":"Zhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.ejor.2021.12.040","volume":"303","author":"F Rodrigues","year":"2022","unstructured":"Rodrigues, F., Agra, A.: Berth allocation and quay crane assignment\/scheduling problem under uncertainty: a survey. Eur. J. Oper. Res. 303(2), 501\u2013524 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/trsc.2021.1112","volume":"56","author":"B Martin-Iradi","year":"2022","unstructured":"Martin-Iradi, B., Pacino, D., Ropke, S.: The multiport berth allocation problem with speed optimization: exact methods and a cooperative game analysis. Transp. Sci. 56(4), 972\u2013999 (2022). https:\/\/doi.org\/10.1287\/trsc.2021.1112","journal-title":"Transp. Sci."},{"issue":"9","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.3390\/jmse10091294","volume":"10","author":"D Yin","year":"2022","unstructured":"Yin, D., Niu, Y., Yang, J., Yu, S.: Static and discrete berth allocation for large-scale marine-loading problem by using iterative variable grouping genetic algorithm. J. Marine Sci. Eng. 10(9), 1294 (2022)","journal-title":"J. Marine Sci. Eng."},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10462-021-10042-y","volume":"55","author":"ZH Zhan","year":"2022","unstructured":"Zhan, Z.H., Shi, L., Tan, K.C., Zhang, J.: A survey on evolutionary computation for complex continuous optimization. Artif. Intell. Rev. 55(1), 59\u2013110 (2022)","journal-title":"Artif. Intell. Rev."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TETCI.2020.3047410","volume":"6","author":"ZH Zhan","year":"2022","unstructured":"Zhan, Z.H., et al.: Matrix-based evolutionary computation. IEEE Trans. Emerg. Top. Comput. Intell. 6(2), 315\u2013328 (2022)","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MCI.2022.3155330","volume":"17","author":"ZG Chen","year":"2022","unstructured":"Chen, Z.G., Zhan, Z.H., Kwong, S., Zhang, J.: Evolutionary computation for intelligent transportation in smart cities: a survey. IEEE Comput. Intell. Mag. 17(2), 83\u2013102 (2022)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"J Holland","year":"1992","unstructured":"Holland, J.: Genetic algorithm. Sci. Am. 267(1), 66\u201383 (1992)","journal-title":"Sci. Am."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1109\/TCYB.2021.3102642","volume":"53","author":"S Liu","year":"2023","unstructured":"Liu, S., Chen, Z., Zhan, Z.H., Jeon, S., Kwong, S., Zhang, J.: Many-objective job shop scheduling: a multiple populations for multiple objectives-based genetic algorithm approach. IEEE Trans. Cybern. 53(3), 1460\u20131474 (2023)","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TEVC.2021.3051608","volume":"25","author":"SH Wu","year":"2021","unstructured":"Wu, S.H., Zhan, Z.H., Zhang, J.: SAFE: scale-adaptive fitness evaluation method for expensive optimization problems. IEEE Trans. Evol. Comput. 25(3), 478\u2013491 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/TEVC.2022.3210783","volume":"27","author":"Y Jiang","year":"2023","unstructured":"Jiang, Y., Zhan, Zi.-H., Tan, K.C., Zhang, Jun: A bi-objective knowledge transfer framework for evolutionary many-task optimization. IEEE Trans. Evol. Comput. 27(5), 1514\u20131528 (2023). https:\/\/doi.org\/10.1109\/TEVC.2022.3210783","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Chen, C., Zhan, Z.H., Li, Y., Zhang, J.: Adversarial differential evolution for multimodal optimization problems, In: Proceedings of IEEE Conference on Evolutionary Computation, pp. 1\u20138. (2022)","DOI":"10.1109\/CEC55065.2022.9870298"},{"issue":"11","key":"4_CR13","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1109\/TCYB.2019.2944873","volume":"50","author":"ZH Zhan","year":"2020","unstructured":"Zhan, Z.H., Wang, Z.J., Jin, H., Zhang, J.: Adaptive distributed differential evolution. IEEE Trans. Cybern. 50(11), 4633\u20134647 (2020)","journal-title":"IEEE Trans. Cybern."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Jiang, Y., Zhan, Z.H., Tan, K., Zhang, J.: Knowledge learning for evolutionary computation. IEEE Trans. Evol. Comput. (2023).https:\/\/doi.org\/10.1109\/TEVC.2023.3278132","DOI":"10.1109\/TEVC.2023.3278132"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1109\/TEVC.2021.3065659","volume":"25","author":"J Jian","year":"2021","unstructured":"Jian, J., Chen, Z., Zhan, Z.H., Zhang, J.: Region encoding helps evolutionary computation evolve faster: a new solution encoding scheme in particle swarm for large-scale optimization. IEEE Trans. Evol. Comput. 25(4), 779\u2013793 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TEVC.2018.2875430","volume":"23","author":"XF Liu","year":"2019","unstructured":"Liu, X.F., Zhan, Z.H., Gao, Y., Zhang, J., Kwong, S., Zhang, J.: Coevolutionary particle swarm optimization with bottleneck objective learning strategy for many-objective optimization. IEEE Trans. Evol. Comput. 23(4), 587\u2013602 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"7","key":"4_CR18","doi-asserted-by":"publisher","first-page":"4052","DOI":"10.1109\/TSMC.2023.3239953","volume":"53","author":"X-F Liu","year":"2023","unstructured":"Liu, X.-F., Fang, Y., Zhan, Z.-H., Zhang, J.: Strength learning particle swarm optimization for multiobjective multirobot task scheduling. IEEE Trans. Syst. Man Cybern. Syst. 53(7), 4052\u20134063 (2023). https:\/\/doi.org\/10.1109\/TSMC.2023.3239953","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1438","DOI":"10.1109\/TETCI.2022.3170520","volume":"6","author":"L Wu","year":"2022","unstructured":"Wu, L., Shi, L., Zhan, Z.H., Lai, K., Zhang, J.: A buffer-based ant colony system approach for dynamic cold chain logistics scheduling. IEEE Trans. Emerg. Top. Comput. Intell. 6(6), 1438\u20131452 (2022)","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"issue":"10","key":"4_CR21","doi-asserted-by":"publisher","first-page":"17491","DOI":"10.1109\/TITS.2022.3150471","volume":"23","author":"L Shi","year":"2022","unstructured":"Shi, L., Zhan, Z.H., Liang, D., Zhang, J.: Memory-based ant colony system approach for multi-source data associated dynamic electric vehicle dispatch optimization. IEEE Trans. Intell. Transp. Syst. 23(10), 17491\u201317505 (2022)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"2544","DOI":"10.1109\/TCYB.2021.3125362","volume":"53","author":"Y Jiang","year":"2023","unstructured":"Jiang, Y., Zhan, Z.H., Tan, K., Zhang, J.: Optimizing niche center for multimodal optimization problems. IEEE Trans. Cybern. 53(4), 2544\u20132557 (2023)","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11633-022-1317-4","volume":"19","author":"JY Li","year":"2022","unstructured":"Li, J.Y., Zhan, Z.H., Zhang, J.: Evolutionary computation for expensive optimization: a survey. Mach. Intell. Res. 19(1), 3\u201323 (2022)","journal-title":"Mach. Intell. Res."},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Jiang, Y., Zhan, Z.H., Tan, K., Zhang, J.: Block-level knowledge transfer for evolutionary multi-task optimization. IEEE Trans. Cybern. (2023). https:\/\/doi.org\/10.1109\/TCYB.2023.3273625","DOI":"10.1109\/TCYB.2023.3273625"},{"issue":"2","key":"4_CR25","first-page":"1209","volume":"135","author":"C Wang","year":"2022","unstructured":"Wang, C., et al.: A scheme library-based ant colony optimization with 2-opt local search for dynamic traveling salesman problem. Comput. Model. Eng. Sci. 135(2), 1209\u20131228 (2022)","journal-title":"Comput. Model. Eng. Sci."},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.neucom.2022.01.099","volume":"483","author":"ZH Zhan","year":"2022","unstructured":"Zhan, Z.H., Li, J.Y., Zhang, J.: Evolutionary deep learning: a survey. Neurocomputing 483, 42\u201358 (2022)","journal-title":"Neurocomputing"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00170-012-4186-0","volume":"65","author":"J Karafa","year":"2013","unstructured":"Karafa, J., Golias, M., Ivey, S., Saharidis, G., Leonardos, N.: The berth allocation problem with stochastic vessel handling times. Int. J. Adv. Manuf. Technol. 65, 473\u2013484 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10479-008-0493-0","volume":"180","author":"C Cheong","year":"2010","unstructured":"Cheong, C., Tan, K., Liu, D., Lin, C.: Multi-objective and prioritized berth allocation in container ports. Ann. Oper. Res. 180(1), 63\u2013103 (2010)","journal-title":"Ann. Oper. Res."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Boeh, R., Hanne, T., Dornberger, R.: A comparison of linear rank and tournament for parent selection in a genetic algorithm solving a dynamic travelling salesman problem, In: Proceedings of International Conference on Soft Computing and Machine Intelligence, pp. 97\u2013102. (2022)","DOI":"10.1109\/ISCMI56532.2022.10068458"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Yang, Q., Gao, X., Lu, Z.: A ranking weight based roulette wheel selection method for comprehensive learning particle swarm optimization, In: Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, pp. 1\u20137 (2022)","DOI":"10.1109\/SMC53654.2022.9945242"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Chen, J.C., Cao, M., Zhan, Z.H., Liu, D., Zhang, J.: A new and efficient genetic algorithm with promotion selection operator. In: Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, pp. 1532\u20131537 (2020)","DOI":"10.1109\/SMC42975.2020.9283258"},{"issue":"2","key":"4_CR32","first-page":"115","volume":"9","author":"R Agrawal","year":"1995","unstructured":"Agrawal, R., Deb, K., Agrawal, R.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115\u2013148 (1995)","journal-title":"Complex Syst."},{"issue":"4","key":"4_CR33","first-page":"30","volume":"26","author":"K Deb","year":"1996","unstructured":"Deb, K., Goyal, M.: A combined genetic adaptive search (GeneAS) for engineering design. Comput. Sci. Inform. 26(4), 30\u201345 (1996)","journal-title":"Comput. Sci. Inform."},{"key":"4_CR34","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3294307","author":"JY Li","year":"2023","unstructured":"Li, J.Y., Zhan, Z.H., Li, Y., Zhang, J.: Multiple tasks for multiple objectives: a new multiobjective optimization method via multitask optimization. IEEE Trans. Evol. Comput. (2023). https:\/\/doi.org\/10.1109\/TEVC.2023.3294307","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR35","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3212058","author":"QT Yang","year":"2022","unstructured":"Yang, Q.T., Zhan, Z.H., Kwong, S., Zhang, J.: Multiple populations for multiple objectives framework with bias sorting for many-objective optimization. IEEE Trans. Evol. Comput. (2022). https:\/\/doi.org\/10.1109\/TEVC.2022.3212058","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR36","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3232776","author":"ZH Zhan","year":"2022","unstructured":"Zhan, Z.H., Li, J.Y., Kwong, S., Zhang, J.: Learning-aid evolution for optimization. IEEE Trans. Evol. Comput. (2022). https:\/\/doi.org\/10.1109\/TEVC.2022.3232776","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"4_CR37","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/s00773-010-0095-9","volume":"15","author":"S Ganji","year":"2010","unstructured":"Ganji, S., Babazadeh, A., Arabshahi, N.: Analysis of the continuous berth allocation problem in container ports using a genetic algorithm. J. Mar. Sci. Technol. 15(4), 408\u2013416 (2010)","journal-title":"J. Mar. Sci. Technol."},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Chen, L., Huang, Y.: A dynamic continuous berth allocation method based on genetic algorithm. In: Proceedings of IEEE International Conference on Control Science and Systems Engineering, pp. 770\u2013773 (2017)","DOI":"10.1109\/CCSSE.2017.8088038"},{"issue":"3","key":"4_CR39","doi-asserted-by":"publisher","first-page":"032071","DOI":"10.1088\/1757-899X\/782\/3\/032071","volume":"782","author":"S Li","year":"2020","unstructured":"Li, S., Li, G., Zhu, Y.: Research on continuous berth allocation problem based on genetic-harmony search algorithm. IOP Conf. Ser. Mater. Sci. Eng. 782(3), 032071 (2020)","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"issue":"3","key":"4_CR40","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.32604\/csse.2022.029230","volume":"43","author":"X Hu","year":"2022","unstructured":"Hu, X., Ji, S., Hua, H., Zhou, B., Hu, G.: An improved genetic algorithm for berth scheduling at bulk terminal. Comput. Syst. Sci. Eng. 43(3), 1285\u20131296 (2022)","journal-title":"Comput. Syst. Sci. Eng."},{"issue":"1","key":"4_CR41","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TITS.2022.3213834","volume":"24","author":"B Ji","year":"2023","unstructured":"Ji, B., Huang, H., Yu, S.: An enhanced NSGA-II for solving berth allocation and quay crane assignment problem with stochastic arrival times. IEEE Trans. Intell. Transp. Syst. 24(1), 459\u2013473 (2023)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"9","key":"4_CR42","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.3390\/jmse10091232","volume":"10","author":"N Tengecha","year":"2022","unstructured":"Tengecha, N., Zhang, X.: An efficient algorithm for the berth and quay crane assignments considering operator performance in container terminal using particle swarm model. J. Marine Sci. Eng. 10(9), 1232 (2022)","journal-title":"J. Marine Sci. Eng."},{"key":"4_CR43","doi-asserted-by":"publisher","first-page":"101722","DOI":"10.1016\/j.aei.2022.101722","volume":"54","author":"S Zhu","year":"2022","unstructured":"Zhu, S., Tan, Z., Yang, Z., Cai, L.: Quay crane and yard truck dual-cycle scheduling with mixed storage strategy. Adv. Eng. Inform. 54, 101722 (2022)","journal-title":"Adv. Eng. Inform."},{"issue":"4","key":"4_CR44","doi-asserted-by":"publisher","first-page":"807","DOI":"10.3390\/jmse11040807","volume":"11","author":"Y Yang","year":"2023","unstructured":"Yang, Y., Yu, H., Zhu, X.: Study of the master bay plan problem based on a twin 40-foot quay crane operation. J. Marine Sci. Eng. 11(4), 807 (2023)","journal-title":"J. Marine Sci. Eng."},{"issue":"11","key":"4_CR45","doi-asserted-by":"publisher","first-page":"21675","DOI":"10.1109\/TITS.2022.3172719","volume":"23","author":"R Wang","year":"2022","unstructured":"Wang, R., et al.: An adaptive ant colony system based on variable range receding horizon control for berth allocation problem. IEEE Trans. Intell. Transp. Syst. 23(11), 21675\u201321686 (2022)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"4_CR46","doi-asserted-by":"crossref","unstructured":"Li, B., Jiang, X.: A Joint operational scheme of berths and yards at container terminals with computational logistics and computational intelligence, In: Proceedings of IEEE Int. Conference on Computer Supported Cooperative Work in Design, pp. 1095\u20131101 (2022)","DOI":"10.1109\/CSCWD54268.2022.9776278"},{"issue":"4","key":"4_CR47","doi-asserted-by":"publisher","first-page":"2664","DOI":"10.1109\/TSG.2022.3161647","volume":"13","author":"X Sun","year":"2022","unstructured":"Sun, X., Qiu, J., Tao, Y., Yi, Y., Zhao, J.: Distributed optimal voltage control and berth allocation of all-electric ships in seaport microgrids. IEEE Trans. Smart Grid 13(4), 2664\u20132674 (2022)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"11","key":"4_CR48","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.3390\/jmse10111757","volume":"10","author":"X Jiang","year":"2022","unstructured":"Jiang, X., Zhong, M., Shi, J., Li, W., Sui, Y., Dou, Y.: Overall scheduling model for vessels scheduling and berth allocation for ports with restricted channels that considers carbon emissions. J. Marine Sci. Eng. 10(11), 1757 (2022)","journal-title":"J. Marine Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8067-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T01:55:16Z","timestamp":1730512516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8067-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,16]]},"ISBN":["9789819980666","9789819980673"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8067-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,16]]},"assertion":[{"value":"16 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1274","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"650","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.14","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.46","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}