{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:48:04Z","timestamp":1742939284100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030242886"},{"type":"electronic","value":"9783030242893"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24289-3_13","type":"book-chapter","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T15:03:03Z","timestamp":1561734183000},"page":"152-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Effects in the Algorithm Performance from Problem Structure, Searching Behavior and Temperature: A Causal Study Case for Threshold Accepting and Bin-Packing"],"prefix":"10.1007","author":[{"given":"V.","family":"Landero","sequence":"first","affiliation":[]},{"given":"Joaqu\u00edn","family":"P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"L.","family":"Cruz","sequence":"additional","affiliation":[]},{"given":"Tania","family":"Turrubiates","sequence":"additional","affiliation":[]},{"given":"David","family":"R\u00edos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1021713901879","volume":"50","author":"C Soares","year":"2003","unstructured":"Soares, C., Pinto, J.: Ranking learning algorithms: using IBL and Meta-learning on accuracy and time results. J. Mach. Learn. 50(3), 251\u2013277 (2003)","journal-title":"J. Mach. Learn."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24838-5_31","volume-title":"Experimental and Efficient Algorithms","author":"J P\u00e9rez","year":"2004","unstructured":"P\u00e9rez, J., Pazos, R.A., Frausto, J., Rodr\u00edguez, G., Romero, D., Cruz, L.: A statistical approach for algorithm selection. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 417\u2013431. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24838-5_31"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"Learning and Intelligent Optimization","author":"K Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP difficulty by learning from evolved instances. In: Blum, C., Battiti, R. (eds.) LION 2010. LNCS, vol. 6073, pp. 266\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13800-3_29"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00170-012-4571-8","volume":"67","author":"R Vanchipura","year":"2013","unstructured":"Vanchipura, R., Sridharan, R.: Development and analysis of constructive heuristic algorithms for flow shop scheduling problems with sequence-dependent setup times. Int. J. Adv. Manuf. Technol. 67, 1337\u20131353 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s12293-009-0016-9","volume":"1","author":"MN Le","year":"2009","unstructured":"Le, M.N., Ong, Y.S., Jin, Y., Sendhoff, B.: Lamarckian memetic algorithms: local optimum and connectivity structure analysis. Memetic Comput. 1(3), 175\u2013190 (2009)","journal-title":"Memetic Comput."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ins.2013.05.015","volume":"246","author":"A Cayci","year":"2013","unstructured":"Cayci, A., Menasalvas, E., Saygin, Y., Eibe, S.: Self-configuring data mining for ubiquitous computing. Inf. Sci. 246, 83\u201399 (2013)","journal-title":"Inf. Sci."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TSMCB.2008.915539","volume":"38","author":"J Tavares","year":"2008","unstructured":"Tavares, J.: Multidimensional knapsack problem: a fitness landscape analysis. IEEE Trans. Syst. Man Cybern. Part B 38(3), 604\u2013616 (2008)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"5B","key":"13_CR8","first-page":"72","volume":"16","author":"J P\u00e9rez","year":"2007","unstructured":"P\u00e9rez, J., Cruz, L., Landero, V.: Explaining performance of the threshold accepting algorithm for the bin packing problem: a causal approach. Polish J. Environ. Stud. 16(5B), 72\u201376 (2007)","journal-title":"Polish J. Environ. Stud."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: AAAI, vol. 10, pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"13_CR10","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-33021-6_29","volume-title":"Recent Advances on Hybrid Intelligent Systems, Studies in Computational Intelligence","author":"M Quiroz","year":"2013","unstructured":"Quiroz, M., Cruz, L., Torrez, J., G\u00f3mez, C.: Improving the performance of heuristic algorithms based on exploratory data analysis. In: Castillo, O., Melin, P., Kacprzyk, J. (eds.) Recent Advances on Hybrid Intelligent Systems, Studies in Computational Intelligence. SCI, vol. 452, pp. 361\u2013375. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-33021-6_29"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"issue":"5","key":"13_CR12","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1057\/jors.2014.46","volume":"66","author":"J Ries","year":"2015","unstructured":"Ries, J., Beullens, P.: A semi-automated design of instance-based fuzzy parameter tuning for metaheuristics based on decision tree induction. J. Oper. Res. Soc. 66(5), 782\u2013793 (2015)","journal-title":"J. Oper. Res. Soc."},{"key":"13_CR13","unstructured":"Yong, X., Feng, D., Rongchun, Z.: Optimal selection of image segmentation algorithms based on performance prediction. In: Proceedings of the Pan-Sydney Area Workshop on Visual Information Processing, pp. 105\u2013108. Australian Computer Society, Inc. (2004)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Yuen, S., Zhang, X.: Multiobjective evolutionary algorithm portfolio: choosing suitable algorithm for multiobjective optimization problem. In: IEEE Congress on Evolutionary Computation (CEC), Beijing, China, pp. 1967\u20131973 (2014)","DOI":"10.1109\/CEC.2014.6900470"},{"key":"13_CR15","unstructured":"Wagner, M., Lindauer, M., Misir, M., et. al.: A case of study of algorithm selection for the travelling thief problem. J. Heuristics 1\u201326 (2017)"},{"issue":"5","key":"13_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/2594413.2594424","volume":"57","author":"K Leyton-Brown","year":"2014","unstructured":"Leyton-Brown, K., Hoos, H., Hutter, F., Xu, L.: Understanding the empirical hardness of NP-complete problems. Mag. Commun. ACM 57(5), 98\u2013107 (2014)","journal-title":"Mag. Commun. ACM"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-40970-2_10","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"N Mull","year":"2016","unstructured":"Mull, N., Fremont, D.J., Seshia, S.A.: On the hardness of SAT with community structure. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 141\u2013159. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_10"},{"key":"13_CR18","unstructured":"Cruz, L., G\u00f3mez, C., P\u00e9rez, J., Landero, V., Quiroz, M., Ochoa, A.: Algorithm Selection: From Meta-learning to Hyper-heuristics. INTECH Open Access Publisher (2012)"},{"issue":"7","key":"13_CR19","doi-asserted-by":"publisher","first-page":"5224","DOI":"10.1016\/j.eswa.2009.12.087","volume":"37","author":"R Pav\u00f3n","year":"2010","unstructured":"Pav\u00f3n, R., D\u00edaz, F., Laza, R., Luz\u00f3n, M.V.: Experimental evaluation of an automatic parameter setting system. Expert Syst. Appl. 37(7), 5224\u20135238 (2010)","journal-title":"Expert Syst. Appl."},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21434-9_3","volume-title":"Autonomous Search","author":"HH Hoos","year":"2011","unstructured":"Hoos, H.H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 37\u201371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_3"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.asoc.2014.01.032","volume":"18","author":"E Yeguas","year":"2014","unstructured":"Yeguas, E., Luz\u00f3n, M.V., Pav\u00f3n, R., Laza, R., Arroyo, G., D\u00edaz, F.: Automatic parameter tuning for evolutionary algorithms using a Bayesian case-based reasoning system. Appl. Soft Comput. 18, 185\u2013195 (2014)","journal-title":"Appl. Soft Comput."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Biedenkapp, A., Lindauer, M.T., Eggensperger, K., Hutter, F., Fawcett, C., Hoos, H.H.: Efficient parameter importance analysis via ablation with surrogates. In: AAAI, pp. 773\u2013779 (2017)","DOI":"10.1609\/aaai.v31i1.10657"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-54157-0_5","volume-title":"Evolutionary Multi-Criterion Optimization","author":"A Blot","year":"2017","unstructured":"Blot, A., Pernet, A., Jourdan, L., Kessaci-Marmion, M.-\u00c9., Hoos, H.H.: Automatically configuring multi-objective local search using multi-objective optimisation. In: Trautmann, H., et al. (eds.) EMO 2017. LNCS, vol. 10173, pp. 61\u201376. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54157-0_5"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-30549-1_28","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"H Guo","year":"2004","unstructured":"Guo, H., Hsu, W.H.: A learning-based algorithm selection meta-reasoner for the real-time MPE problem. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 307\u2013318. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30549-1_28"},{"key":"13_CR25","first-page":"475","volume-title":"Proceedings of the 16th Biennial European Conference on Artificial Intelligence","author":"A Guerri","year":"2004","unstructured":"Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: Burke, V.A. (ed.) Proceedings of the 16th Biennial European Conference on Artificial Intelligence, pp. 475\u2013479. IOS Press, Valencia (2004)"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-30217-9_6","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., Smyth, K., St\u00fctzle, T.: Search space features underlying the performance of stochastic local search algorithms for MAX-SAT. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 51\u201360. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_6"},{"key":"13_CR27","unstructured":"Konak, A.: Simulation optimization using tabu search: an empirical study. In: Kuhl, M.E., Steiger, N.M., Armstrong, F.B., Joines, J.A. (eds.) Proceedings of Winter simulation Conference, pp. 2686\u20132692 (2005)"},{"key":"13_CR28","unstructured":"Chevalier, R.: Balancing the effects of parameter settings on a genetic algorithm for multiple fault diagnosis. In: Artificial Intelligence. University of Georgia (2006)"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-02777-2_31","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Nikoli\u0107","year":"2009","unstructured":"Nikoli\u0107, M., Mari\u0107, F., Jani\u010di\u0107, P.: Instance-based selection of policies for SAT solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 326\u2013340. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_31"},{"issue":"1","key":"13_CR30","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2014.2302006","volume":"19","author":"M Munoz","year":"2015","unstructured":"Munoz, M., Kirley, M., Halgamuge, S.: Exploratory landscape analysis of continuous space optimization problems using information content. IEEE Trans. Evol. Comput. 19(1), 74\u201387 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3\u20134","key":"13_CR31","first-page":"295","volume":"47","author":"M Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Ann. Math. Artif. Intell. 47(3\u20134), 295\u2013328 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ins.2010.09.016","volume":"181","author":"E Montero","year":"2011","unstructured":"Montero, E., Riff, M.-C.: On-the-fly calibrating strategies for evolutionary algorithms. Inf. Sci. 181, 552\u2013566 (2011)","journal-title":"Inf. Sci."},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1007\/978-3-540-69731-2_102","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2008","author":"J P\u00e9rez","year":"2008","unstructured":"P\u00e9rez, J., et al.: An application of causality for representing and providing formal explanations about the behavior of the threshold accepting algorithm. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada, Jacek M. (eds.) ICAISC 2008. LNCS (LNAI), vol. 5097, pp. 1087\u20131098. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69731-2_102"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-540-68123-6_64","volume-title":"Foundations of Intelligent Systems","author":"J P\u00e9rez","year":"2008","unstructured":"P\u00e9rez, J., et al.: A causal approach for explaining why a heuristic algorithm outperforms another in solving an instance set of the bin packing problem. In: An, A., Matwin, S., Ra\u015b, Z.W., \u015al\u0119zak, D. (eds.) ISMIS 2008. LNCS (LNAI), vol. 4994, pp. 591\u2013598. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68123-6_64"},{"issue":"4C","key":"13_CR35","first-page":"25","volume":"17","author":"J P\u00e9rez","year":"2008","unstructured":"P\u00e9rez, J., Cruz, L., Pazos, R., Landero, V., P\u00e9rez, V.: Application of causal models for the selection and redesign of heuristic algorithms for solving the bin-packing problem. Polish J. Environ. Stud. 17(4C), 25\u201330 (2008). (ACS-AISBIS 2008)","journal-title":"Polish J. Environ. Stud."},{"key":"13_CR36","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1754.001.0001","volume-title":"Causation, Prediction, and Search","author":"P Spirtes","year":"2001","unstructured":"Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction, and Search, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"13_CR37","volume-title":"Bayesian Artificial Intelligence","author":"K Korb","year":"2004","unstructured":"Korb, K.: Bayesian Artificial Intelligence. Chapman and Hall, London (2004)"},{"key":"13_CR38","series-title":"Nonconvex Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-1-4757-5362-2_14","volume-title":"Handbook of Global Optimization","author":"CC McGeoch","year":"2002","unstructured":"McGeoch, C.C.: Experimental analysis of algorithms. In: Pardalos, P.M., Romeijn, H.E. (eds.) Handbook of Global Optimization. Nonconvex Optimization and Its Applications, vol. 62, pp. 489\u2013513. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4757-5362-2_14"},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-7091-7535-4_75","volume-title":"Artificial Neural Nets and Genetic Algorithms","author":"Sami Khuri","year":"1995","unstructured":"Khuri, S., Sch\u00fctz, M., Heitk\u00f6tter, J.: Evolutionary heuristics for the bin packing problem. In: Artificial Neural Nets and Genetic Algorithms, pp. 285\u2013288. Springer, Vienna (1995). https:\/\/doi.org\/10.1007\/978-3-7091-7535-4_75"},{"issue":"1","key":"13_CR40","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90(1), 161\u2013175 (1990)","journal-title":"J. Comput. Phys."},{"key":"13_CR41","unstructured":"Beasley, J.E.: OR-Library. Brunel University (2006). http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/binpackinfo.html"},{"key":"13_CR42","unstructured":"Scholl, A., Klein, R. (2003). http:\/\/www.wiwi.uni-jena.de\/Entscheidung\/binpp\/"},{"key":"13_CR43","unstructured":"Fayyad, U., Irani, K.: Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. IJCAI 1022\u20131029 (1993)"},{"key":"13_CR44","unstructured":"Merz, P., Freisleben, B., et al.: Fitness landscapes and memetic algorithm design. New Ideas Optim. 245\u2013260 (1999)"},{"key":"13_CR45","unstructured":"Hugin Expert. www.hugin.com"},{"key":"13_CR46","unstructured":"Norsys Corporation. www.norsys.com"},{"key":"13_CR47","unstructured":"Dataplot. www.itl.nist.gov\/div898\/software\/dataplot\/homepage.htm"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24289-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T09:43:40Z","timestamp":1663839820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24289-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242886","9783030242893"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24289-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}