{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:24:20Z","timestamp":1742970260208,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319187808"},{"type":"electronic","value":"9783319187815"}],"license":[{"start":{"date-parts":[[2015,6,28]],"date-time":"2015-06-28T00:00:00Z","timestamp":1435449600000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-18781-5_1","type":"book-chapter","created":{"date-parts":[[2015,6,27]],"date-time":"2015-06-27T18:07:44Z","timestamp":1435428464000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Evolutionary Computation for Real-World Problems"],"prefix":"10.1007","author":[{"given":"Mohammad Reza","family":"Bonyadi","sequence":"first","affiliation":[]},{"given":"Zbigniew","family":"Michalewicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,28]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1057\/jors.1979.22","volume":"30","author":"Russell L. Ackoff","year":"1979","unstructured":"Ackoff RL (1979) The future of operational research is past. J Oper Res Soc 53(3):93\u2013104. ISSN 0160\u20135682","journal-title":"Journal of the Operational Research Society"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Auger A, Doerr B (2011) Theory of randomized search heuristics: foundations and recent developments, vol 1. World Scientific. ISBN 9814282669","DOI":"10.1142\/9789814282673_0001"},{"issue":"3","key":"1_CR3","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"Dimitris Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501. ISSN 0036\u20131445","journal-title":"SIAM Review"},{"key":"1_CR4","first-page":"205","volume-title":"Infosys Science Foundation Series","author":"Mohammad Reza Bonyadi","year":"2014","unstructured":"Bonyadi MR, Michalewicz Z (2014) Locating potentially disjoint feasible regions of a search space with a particle swarm optimizer, book section to appear. Springer, New York"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bonyadi MR, Michalewicz Z (2014) On the edge of feasibility: a case study of the particle swarm optimizer. In: Congress on evolutionary computation, IEEE, pp 3059\u20133066","DOI":"10.1109\/CEC.2014.6900343"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bonyadi MR, Li X, Michalewicz Z (2013) A hybrid particle swarm with velocity mutation for constraint optimization problems. In: Genetic and evolutionary computation conference, ACM, pp 1\u20138. doi:10.1145\/2463372.2463378","DOI":"10.1145\/2463372.2463378"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bonyadi MR, 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, IEEE","DOI":"10.1109\/CEC.2013.6557681"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.swevo.2014.06.001","volume":"18","author":"Mohammad Reza Bonyadi","year":"2014","unstructured":"Bonyadi MR, Li X, Michalewicz Z (2014) A hybrid particle swarm with a time-adaptive topology for constrained optimization. Swarm Evol Comput 18:22\u201337. doi:10.1016\/j.swevo.2014.06.001","journal-title":"Swarm and Evolutionary Computation"},{"key":"1_CR9","unstructured":"Bonyadi MR, Michalewicz Z, Neumann F, Wagner M (2014) Evolutionary computation for multi-component problems: opportunities and future directions. Frontiers in Robotics and AI, Computational Intelligence, under review, 2014"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Bonyadi MR, Michalewicz Z, Przybyek MR, Wierzbicki A (2014) Socially inspired algorithms for the travelling thief problem. In: Genetic and evolutionary computation conference (GECCO), ACM","DOI":"10.1145\/2576768.2598367"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Bonyadi MR, Michalewicz Z, Wagner M (2014) Beyond the edge of feasibility: analysis of bottlenecks. In: International conference on simulated evolution and learning (SEAL), volume To appear, Springer","DOI":"10.1007\/978-3-319-13563-2_37"},{"issue":"1","key":"1_CR12","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1287\/mnsc.4.1.38","volume":"4","author":"A. Charnes","year":"1957","unstructured":"Charnes A, Cooper WW (1957) Management models and industrial applications of linear programming. Manag Sci 4(1):38\u201391. ISSN 0025\u20131909","journal-title":"Management Science"},{"key":"1_CR13","unstructured":"Chatterjee A, Mukherjee S (2006) Unified concept of bottleneck. Report, Indian Institute of Management Ahmedabad, Research and Publication Department"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF00939892","volume":"74","author":"S Cho","year":"1992","unstructured":"Cho S, Kim S (1992) Average shadow prices in mathematical programming. J Optim Theory Appl 74(1):57\u201374","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"1_CR15","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/0377-2217(94)00003-U","volume":"85","author":"Alejandro Crema","year":"1995","unstructured":"Crema A (1995) Average shadow price in a mixed integer linear programming problem. Eur J Oper Res 85(3):625\u2013635. ISSN 0377\u20132217","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1_CR16","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1057\/jors.1975.179","volume":"26","author":"A. M. Frieze","year":"1975","unstructured":"Frieze A (1975) Bottleneck linear programming. Oper Res Q 26(4):871\u2013874","journal-title":"Journal of the Operational Research Society"},{"key":"1_CR17","volume-title":"Theory of constraints","author":"EM Goldratt","year":"1990","unstructured":"Goldratt EM (1990) Theory of constraints. North River, Croton-on-Hudson"},{"key":"1_CR18","unstructured":"Goldratt EM, Cox J (1993) The goal: a process of ongoing improvement. Gower, Aldershot"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Heywood MI, Lichodzijewski P (2010) Symbiogenesis as a mechanism for building complex adaptive systems: a review. In: Applications of evolutionary computation, Springer, pp 51\u201360","DOI":"10.1007\/978-3-642-12239-2_6"},{"issue":"1-3","key":"1_CR20","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0167-2789(90)90076-2","volume":"42","author":"W.Daniel Hillis","year":"1990","unstructured":"Hillis WD (1990) Co-evolving parasites improve simulated evolution as an optimization procedure. Phys D: Nonlinear Phenom 42(1):228\u2013234. ISSN 0167\u20132789","journal-title":"Physica D: Nonlinear Phenomena"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/ori.2013.1","volume":"26","author":"Jacob Stolk","year":"2013","unstructured":"Jacob Stolk AMZM, Mann I (2013) Combining vehicle routing and packing for optimal delivery schedules of water tanks. OR Insight 26(3):167190. doi:10.1057\/ori.2013.1","journal-title":"OR Insight"},{"issue":"3","key":"1_CR22","doi-asserted-by":"crossref","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-a survey. IEEE Trans Evol Comput 9(3):303\u2013317. ISSN 1089\u2013778X","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1_CR23","unstructured":"Keane A (1994) Genetic algoritm digest. ftp:\/\/ftp.cse.msu.edu\/pub\/GA\/gadigest\/v8n16.txt"},{"issue":"1","key":"1_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/249154","volume":"5","author":"Peter G. W. Keen","year":"1981","unstructured":"Keen PG (1981) Value analysis: justifying decision support systems. MIS Q 5:1\u201315. ISSN 0276\u20137783","journal-title":"MIS Quarterly"},{"issue":"3","key":"1_CR25","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0377-2217(88)90195-6","volume":"37","author":"Sehun Kim","year":"1988","unstructured":"Kim S, Cho S-C (1988) A shadow price in integer programming for management decision. Eur J Oper Res 37(3):328\u2013335. ISSN 0377\u20132217","journal-title":"European Journal of Operational Research"},{"key":"1_CR26","unstructured":"Koopmans TC (1977) Concepts of optimality and their uses. Am Econ Rev 67:261\u2013274. ISSN 0002\u20138282"},{"key":"1_CR27","first-page":"581","volume":"15","author":"HC Lau","year":"2002","unstructured":"Lau HC, Song Y (2002) Combining two heuristics to solve a supply chain optimization problem. Eur Conf Artif Intell 15:581\u2013585","journal-title":"Eur Conf Artif Intell"},{"issue":"2","key":"1_CR28","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/TEVC.2008.926731","volume":"13","author":"G. Leguizamon","year":"2009","unstructured":"Leguizamon G, Coello CAC (2009) Boundary search for constrained numerical optimization problems with an algorithm inspired by the ant colony metaphor. IEEE Trans Evol Comput 13(2):350\u2013368. ISSN 1089\u2013778X","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Li X, Bonyadi MR, Michalewicz Z, Barone L (2013) Solving a real-world wheat blending problem using a hybrid evolutionary algorithm. In: Congress on evolutionary computation, IEEE, pp 2665\u20132671. ISBN 1479904538","DOI":"10.1109\/CEC.2013.6557891"},{"issue":"6","key":"1_CR30","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1080\/00207549208942967","volume":"30","author":"RICHARD LUEBBE","year":"1992","unstructured":"Luebbe R, Finch B (1992) Theory of constraints and linear programming: a comparison. Int J Prod Res 30(6):1471\u20131478. ISSN 0020\u20137543","journal-title":"International Journal of Production Research"},{"issue":"4","key":"1_CR31","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1108\/17563781211282231","volume":"5","author":"Maksud Ibrahimov","year":"2012","unstructured":"Maksud Ibrahimov SSZM, Mohais A (2012) Evolutionary approaches for supply chain optimisation part 1. Int J Intell Comput Cybern 5(4):444\u2013472","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Maksud Ibrahimov SSZM, Mohais A (2012) Evolutionary approaches for supply chain optimisation part 2. Int J Intell Comput Cybern 5(4):473\u2013499","DOI":"10.1108\/17563781211282240"},{"key":"1_CR33","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. Wiley, Chichester"},{"key":"1_CR34","doi-asserted-by":"crossref","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. Ann Math Artif Intell 1\u201332. ISSN 1012\u20132443","DOI":"10.1007\/s10472-013-9341-2"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Michalewicz Z (1992) Genetic algorithms + data structures = evolution programs. Springer. ISBN 3540606769","DOI":"10.1007\/978-3-662-02830-8"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Michalewicz Z (2012) Quo vadis, evolutionary computation? Adv Comput Intell 98\u2013121","DOI":"10.1007\/978-3-642-30687-7_6"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Michalewicz Z (2012) Ubiquity symposium: evolutionary computation and the processes of life: the emperor is naked: evolutionary algorithms for real-world applications. Ubiquity, 2012(November):3","DOI":"10.1145\/2390009.2399411"},{"key":"1_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It: Modern Heuristics","author":"Zbigniew Michalewicz","year":"2004","unstructured":"Michalewicz Z, Fogel D (2004) How to solve it: modern heuristics. Springer, New York. ISBN 3540224947"},{"issue":"1","key":"1_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Zbigniew Michalewicz","year":"1996","unstructured":"Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1\u201332. ISSN 1063\u20136560","journal-title":"Evolutionary Computation"},{"key":"1_CR40","unstructured":"Michalewicz Z, Nazhiyath G, Michalewicz M (1996) A note on usefulness of geometrical crossover for numerical optimization problems. In: Fifth annual conference on evolutionary programming, Citeseer, p 305312"},{"key":"1_CR41","doi-asserted-by":"crossref","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, ACM, pp 147\u2013160. ISBN 1450319904","DOI":"10.1145\/2460239.2460253"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Neumann F, Witt C (2012) Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. In: Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference companion, ACM, pp 1035\u20131058. ISBN 1450311784","DOI":"10.1145\/2330784.2330928"},{"issue":"6","key":"1_CR43","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TEVC.2011.2180533","volume":"16","author":"Trung Thanh Nguyen","year":"2012","unstructured":"Nguyen T, Yao X (2012) Continuous dynamic constrained optimisation-the challenges. IEEE Trans Evol Comput 16(6):769\u2013786. ISSN 1089\u2013778X","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1_CR44","doi-asserted-by":"publisher","unstructured":"Polyakovskiy S, Bonyadi MR, Wagner M, Michalewicz Z, Neumann F (2014) A comprehensive benchmark set and heuristics for the travelling thief problem. In: Genetic and evolutionary computation conference (GECCO), ACM. ISBN 978-1-4503-2662-9\/14\/07. doi:10.1145\/2576768.2598249","DOI":"10.1145\/2576768.2598249"},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Potter M, De Jong K (1994) A cooperative coevolutionary approach to function optimization. In: Parallel problem solving from nature, Springer, Berlin Heidelberg, pp 249\u2013257. doi:10.1007\/3-540-58484-6269","DOI":"10.1007\/3-540-58484-6269"},{"issue":"4","key":"1_CR46","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1108\/01443579810199720","volume":"18","author":"Shams\u2010ur Rahman","year":"1998","unstructured":"Rahman S-U (1998) Theory of constraints: a review of the philosophy and its applications. Int J Oper Prod Manage 18(4):336\u2013355. ISSN 0144\u20133577","journal-title":"International Journal of Operations & Production Management"},{"key":"1_CR47","unstructured":"Rosin CD, Belew RK (1995) Methods for competitive co-evolution: finding opponents worth beating. In: ICGA, pp 373\u2013381"},{"issue":"3","key":"1_CR48","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"T.P. Runarsson","year":"2000","unstructured":"Runarsson T, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284\u2013294. ISSN 1089\u2013778X","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1_CR49","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-61723-X_989","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"Marc Schoenauer","year":"1996","unstructured":"Schoenauer M, Michalewicz Z (1996) Evolutionary computation at the edge of feasibility. In: Parallel problem solving from nature PPSN IV, pp 245\u2013254"},{"key":"1_CR50","unstructured":"Schoenauer M, Michalewicz Z (1997) Boundary operators for constrained parameter optimization problems. In: ICGA, pp 322\u201332"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Smith-Miles K, van Hemert J, Lim XY (2010) Understanding TSP difficulty by learning from evolved instances, Springer, pp 266\u2013280. ISBN 3642137997","DOI":"10.1007\/978-3-642-13800-3_29"},{"key":"1_CR52","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"Kate Smith-Miles","year":"2014","unstructured":"Smith-Miles K, Baatar D, Wreford B, Lewis R (2014) Towards objective measures of algorithm performance across instance space. Comput Oper Res 45:12\u201324. ISSN 0305\u20130548","journal-title":"Computers & Operations Research"},{"key":"1_CR53","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? Nature-inspired algorithms for optimisation, pp 1\u201350"},{"issue":"2","key":"1_CR54","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/00221680209499862","volume":"40","author":"Zheng Y. Wu","year":"2002","unstructured":"Wu ZY, Simpson AR (2002) A self-adaptive boundary search genetic algorithm and its application to water distribution systems. J Hydraul Res 40(2):191\u2013203. ISSN 0022\u20131686","journal-title":"Journal of Hydraulic Research"}],"container-title":["Studies in Computational Intelligence","Challenges in Computational Statistics and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18781-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T20:42:15Z","timestamp":1674247335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18781-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,28]]},"ISBN":["9783319187808","9783319187815"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18781-5_1","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2015,6,28]]},"assertion":[{"value":"28 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}