{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T20:00:12Z","timestamp":1725998412304},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030016401"},{"type":"electronic","value":"9783030016418"}],"license":[{"start":{"date-parts":[[2018,11,4]],"date-time":"2018-11-04T00:00:00Z","timestamp":1541289600000},"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-01641-8_2","type":"book-chapter","created":{"date-parts":[[2018,11,3]],"date-time":"2018-11-03T10:22:57Z","timestamp":1541240577000},"page":"13-30","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Evolutionary Computation for Multicomponent Problems: Opportunities and Future Directions"],"prefix":"10.1007","author":[{"given":"Mohammad Reza","family":"Bonyadi","sequence":"first","affiliation":[]},{"given":"Zbigniew","family":"Michalewicz","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,4]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-30687-7_6","volume-title":"Advances in Computational Intelligence","author":"Zbigniew Michalewicz","year":"2012","unstructured":"Michalewicz, Z. (2012). Quo vadis, evolutionary computation? In J. Liu, C. Alippi, B. Bouchon-Meunier, G. Greenwood, & H. Abbass (Eds.), Advances in Computational Intelligence. Lecture Notes in Computer Science (vol. 7311, pp. 98\u2013121). Berlin, Heidelberg: Springer."},{"key":"2_CR2","first-page":"1","volume-title":"Nature-Inspired Algorithms for Optimisation","author":"Thomas Weise","year":"2009","unstructured":"Weise, T., Zapf, M., Chiong, R., & Nebro, A. (2009). Why is optimization difficult? In R. Chiong (Ed.), Nature-inspired algorithms for optimisation. Studies in Computational Intelligence (vol. 193, pp. 1\u201350). Berlin, Heidelberg: Springer."},{"key":"2_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to solve it: Modern heuristics","author":"Z Michalewicz","year":"2004","unstructured":"Michalewicz, Z., & Fogel, D. B. (2004). How to solve it: Modern heuristics. Berlin: Springer."},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin, Y., & Branke, J. (2005). Evolutionary optimization in uncertain environments\u2013A survey. IEEE Transactions on Evolutionary Computation, 9(3), 303\u2013317.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"6","key":"2_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TEVC.2011.2180533","volume":"16","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T. T., & Yao, X. (2012). Continuous dynamic constrained optimization\u2013The challenges. IEEE Transactions on Evolutionary Computation, 16(6), 769\u2013786.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z. (2012). The emperor is naked: Evolutionary algorithms for real-world applications. ACM Ubiquity, pp. 1\u201313.","DOI":"10.1145\/2390009.2399411"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1057\/jors.1979.22","volume":"30","author":"RL Ackoff","year":"1979","unstructured":"Ackoff, R. L. (1979). The future of operational research is past. Journal of the Operational Research Society, 30(2), 93\u2013104.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ejor.2004.10.001","volume":"172","author":"S Wang","year":"2006","unstructured":"Wang, S., & Sarker, B. R. (2006). Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy. European Journal of Operations Research, 172(1), 179\u2013200.","journal-title":"European Journal of Operations Research"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/ori.2013.1","volume":"26","author":"J Stolk","year":"2013","unstructured":"Stolk, J., Mann, I., Mohais, A., & Michalewicz, Z. (2013). Combining vehicle routing and packing for optimal delivery schedules of water tanks. OR Insight, 26(3), 167\u2013190.","journal-title":"OR Insight"},{"key":"2_CR10","unstructured":"Michalewicz, M., Michalewicz, Z., & Spitty, R. (2010). Optimising the wine supply chain. In Proceedings of the Fourteen Australian Wine Industry Technical Conference (14 AWITC), Adelaide, Australia. Citeseer."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.\u00a0R., Michalewicz, Z., & Wagner, M. (2014). Beyond the edge of feasibility: Analysis of bottlenecks. In Simulated Evolution and Learning, pp. 431\u2013442. Springer Int. Publishing Switzerland.","DOI":"10.1007\/978-3-319-13563-2_37"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BFb0027170","volume-title":"Evolutionary computing","author":"D Whitley","year":"1997","unstructured":"Whitley, D., Rana, S., & Heckendorn, R. (1997). Island model genetic algorithms and linearly separable problems. In D. Corne & J. Shapiro (Eds.), Evolutionary computing (Vol. 1305, pp. 109\u2013125). Lecture Notes in Computer Science Berlin, Heidelberg: Springer."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Bonyadi, M., Michalewicz, Z., & Barone, L. (2013). The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. In Congress on Evolutionary Computation, pp. 1037\u20131044.","DOI":"10.1109\/CEC.2013.6557681"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.\u00a0R., Michalewicz, Z., Przybylek, M.\u00a0R., & Wierzbicki, A. (2014). Socially inspired algorithms for the travelling thief problem. In Genetic and Evolutionary Computation, pp. 421\u2013428. ACM.","DOI":"10.1145\/2576768.2598367"},{"key":"2_CR15","unstructured":"Mei, Y., Li, X., & Yao, X. (2014). On investigation of interdependence between subproblems of the travelling thief problem. Soft Computing, pp. 1\u201316."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Bonyadi, M.\u00a0R., Wagner, M., Michalewicz, Z., & Neumann, F. (2014). A comprehensive benchmark set and heuristics for the traveling thief problem. In Genetic and Evolutionary Computation, pp. 477\u2013484. ACM.","DOI":"10.1145\/2576768.2598249"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10732-017-9328-y","volume":"24","author":"M Wagner","year":"2018","unstructured":"Wagner, M., Lindauer, M., M\u0131s\u0131r, M., Nallaperuma, S., & Hutter, F. (2018). A case study of algorithm selection for the traveling thief problem. Journal of Heuristics, 24(3), 295\u2013320.","journal-title":"Journal of Heuristics"},{"key":"2_CR18","first-page":"273","volume-title":"Lecture Notes in Computer Science","author":"Markus Wagner","year":"2016","unstructured":"Wagner, M., (2016). Stealing items more efficiently with ants: A swarm intelligence approach to the travelling thief problem. In M. Dorigo, M. Birattari, X. Li, M. L\u00f3pez-Ib\u00e1\u00f1ez, K. Ohkura, C. Pinciroli, & T. St\u00fctzle (Eds.), Swarm Intelligence: 10th International Conference, ANTS 2016, Brussels, Belgium, September 7\u20139, 2016, Proceedings (pp. 273\u2013281). Cham: Springer International Publishing. ISBN: 978-3-319-44427-7. https:\/\/doi.org\/10.1007\/978-3-319-44427-7_25 ."},{"issue":"1-2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10710-017-9308-x","volume":"19","author":"Mohamed El Yafrani","year":"2017","unstructured":"El Yafrani, M., Martins, M., Wagner, M., Ahiod, B., Delgado, M., & L\u00fcders, R. (2017). A hyperheuristic approach based on low-level heuristics for the travelling thief problem. Genetic Programming and Evolvable Machines. ISSN: 1573-7632. https:\/\/doi.org\/10.1007\/s10710-017-9308-x .","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"2_CR20","unstructured":"El Yafrani, M., & Ahiod, B. (2016). Population-based vs. single-solution heuristics for the travelling thief problem. In Proceedings of the Genetic and Evolutionary Computation Conference 2016, GECCO\u2019 16, Denver, Colorado, USA (pp. 317\u2013324). New York, NY, USA: ACM. ISBN: 978-1-4503-4206-3. http:\/\/doi.acm.org\/10.1145\/2908812.2908847 ."},{"key":"2_CR21","unstructured":"Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L., & Wu, J. (2017). A fully polynomial time approximation scheme for packing while traveling. CoRR. arXiv: 1702.05217 ."},{"key":"2_CR22","first-page":"110","volume-title":"Lecture Notes in Computer Science","author":"Junhua Wu","year":"2017","unstructured":"Wu, J., Wagner, M., Polyakovskiy, S., & Neumann, F. (2017). Exact approaches for the travelling thief problem. In Proceedings of the 11th International Conference on Simulated Evolution and Learning (SEAL) (p. 12). Shenzhen, China: Springer (Accepted for publication)."},{"issue":"5","key":"2_CR23","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s10766-009-0107-8","volume":"37","author":"MR Bonyadi","year":"2009","unstructured":"Bonyadi, M. R., & Moghaddam, M. E. (2009). A bipartite genetic algorithm for multi-processor task scheduling. International Journal of Parallel Programming, 37(5), 462\u2013487.","journal-title":"International Journal of Parallel Programming"},{"issue":"5","key":"2_CR24","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TEVC.2013.2283916","volume":"18","author":"J Xiong","year":"2014","unstructured":"Xiong, J., Liu, J., Chen, Y., & Abbass, H. (2014). A knowledge-based evolutionary multiobjective approach for stochastic extended resource investment project scheduling problems. IEEE Transactions on Evolutionary Computation, 18(5), 742\u2013763.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10766-011-0179-0","volume":"40","author":"ME Moghaddam","year":"2012","unstructured":"Moghaddam, M. E., & Bonyadi, M. R. (2012). An immune-based genetic algorithm with reduced search space coding for multiprocessor task scheduling problem. International Journal of Parallel Programming, 40(2), 225\u2013257.","journal-title":"International Journal of Parallel Programming"},{"key":"2_CR26","first-page":"110","volume-title":"Lecture Notes in Computer Science","author":"Kalyanmoy Deb","year":"2009","unstructured":"Deb, K. & Sinha, A. (2009). Solving bilevel multi-objective optimization problems using evolutionary algorithms. In EMO, pp. 110\u2013124."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Legillon, F., Liefooghe, A., & Talbi, E.-G. (2012). Cobra: A cooperative coevolutionary algorithm for bi-level optimization. In IEEE Congress on Evolutionary Computation, pp. 1\u20138.","DOI":"10.1109\/CEC.2012.6256620"},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1162\/EVCO_a_00015","volume":"18","author":"K Deb","year":"2010","unstructured":"Deb, K., & Sinha, A. (2010). An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm. Evolutionary Computation, 18(3), 403\u2013449.","journal-title":"Evolutionary Computation"},{"key":"2_CR29","first-page":"249","volume-title":"Solving from Nature","author":"MA Potter","year":"1994","unstructured":"Potter, M. A., & De Jong, K. A. (1994). A cooperative coevolutionary approach to function optimization. In Parallel Problem (Ed.), Solving from Nature (pp. 249\u2013257). London, UK, UK: Springer."},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1108\/17563781211282231","volume":"5","author":"Maksud Ibrahimov","year":"2012","unstructured":"Ibrahimov, M., Mohais, A., Schellenberg, S., & Michalewicz, Z. (2012). Evolutionary approaches for supply chain optimisation. Part I: Single and two component supply chains. International Journal of Intelligent Computing and Cybernetics, 5(4), 444\u2013472.","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1108\/17563781211282240","volume":"5","author":"Maksud Ibrahimov","year":"2012","unstructured":"Ibrahimov, M., Mohais, A., Schellenberg, S., & Michalewicz, Z. (2012). Evolutionary approaches for supply chain optimisation. Part II: Multi silo supply chains. International Journal of Intelligent Computing and Cybernetics, 5(4), 473\u2013499.","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"key":"2_CR32","doi-asserted-by":"publisher","DOI":"10.1142\/7438","volume-title":"Theory of randomized search heuristics: Foundations and recent developments","author":"A Auger","year":"2011","unstructured":"Auger, A., Auger, A., & Doerr, B. (2011). Theory of randomized search heuristics: Foundations and recent developments. River Edge, NJ, USA: World Scientific Publishing Co., Inc."},{"key":"2_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired computation in combinatorial optimization: Algorithms and their computational complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., & Witt, C. (2010). Bioinspired computation in combinatorial optimization: Algorithms and their computational complexity (1st ed.). New York, NY, USA: Springer, New York Inc.","edition":"1"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., & Lewis, R. (2014). Towards objective measures of algorithm performance across instance space. Computers & Operations Research, 45, 12\u201324.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2_CR35","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10472-013-9341-2","volume":"69","author":"O Mersmann","year":"2013","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., & Neumann, F. (2013). A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Annals of Mathematics and Artificial Intelligence, 69(2), 151\u2013182.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2_CR36","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F., Bischl, B., Mersmann, O., & Trautmann, H. (2013). A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem. In Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII, FOGA XII\u201913 (pp. 147\u2013160). Adelaide, Australia, New York, NY, USA: ACM. ISBN: 978-1-4503-1990-4. http:\/\/doi.acm.org\/10.1145\/2460239.2460253 ."},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"on Learning and Intelligent Optimization, LION\u201910","author":"K Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., & Lim, X. Y. (2010). Understanding tsp difficulty by learning from evolved instances. In International Conference (Ed.), on Learning and Intelligent Optimization, LION\u201910 (pp. 266\u2013280). Berlin, Heidelberg: Springer."},{"key":"2_CR38","volume-title":"Knapsack problems: Algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. New York, NY, USA: Wiley Inc."}],"container-title":["Management and Industrial Engineering","Optimization in Industry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01641-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T14:48:41Z","timestamp":1572533321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01641-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,4]]},"ISBN":["9783030016401","9783030016418"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01641-8_2","relation":{},"ISSN":["2365-0532","2365-0540"],"issn-type":[{"type":"print","value":"2365-0532"},{"type":"electronic","value":"2365-0540"}],"subject":[],"published":{"date-parts":[[2018,11,4]]}}}