{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T20:40:02Z","timestamp":1747255202547,"version":"3.40.5"},"publisher-location":"New Delhi","reference-count":35,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132222194"},{"type":"electronic","value":"9788132222200"}],"license":[{"start":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T00:00:00Z","timestamp":1419379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T00:00:00Z","timestamp":1419379200000},"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":[[2015]]},"DOI":"10.1007\/978-81-322-2220-0_33","type":"book-chapter","created":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T08:00:18Z","timestamp":1419321618000},"page":"413-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Differential Evolution Approach for Solving Integer Programming Problems"],"prefix":"10.1007","author":[{"given":"Hira","family":"Zaheer","sequence":"first","affiliation":[]},{"given":"Millie","family":"Pant","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,24]]},"reference":[{"key":"33_CR1","unstructured":"Storn, K.: Price, differential evolution\u2014a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, International Computer Science Institute, Berkeley, CA (1995)"},{"key":"33_CR2","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\u2014a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341\u2013354 (1997)","journal-title":"J. Global Optim."},{"issue":"4","key":"33_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0016-0032(94)90004-3","volume":"331","author":"SJ Wu","year":"1994","unstructured":"Wu, S.J., Chow, P.T.: Genetic algorithms for solving mixed-discrete optimization problems. J. Franklin Inst. 331(4), 381\u2013401 (1994)","journal-title":"J. Franklin Inst."},{"issue":"20","key":"33_CR4","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1016\/S0045-7949(03)00253-0","volume":"81","author":"VB Gantovnik","year":"2003","unstructured":"Gantovnik, V.B., Anderson-Cook, C.M., G\u00fcrdal, Z., Watson, L.T.: A genetic algorithm with memory for mixed discrete\u2013continuous design optimization. Comput. Struct. 81(20), 2003\u20132009 (2003)","journal-title":"Comput. Struct."},{"issue":"6","key":"33_CR5","doi-asserted-by":"publisher","first-page":"3069","DOI":"10.1016\/j.eswa.2013.10.038","volume":"41","author":"SC Wang","year":"2014","unstructured":"Wang, S.C., Yeh, M.F.: A modified particle swarm optimization for aggregate production planning. Expert Syst. Appl. 41(6), 3069\u20133077 (2014)","journal-title":"Expert Syst. Appl."},{"key":"33_CR6","unstructured":"Rein, P., Allen Silver, E.: Decision Systems for Inventory Management and Production Planning. Wiley, New York (1979)"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s11750-012-0253-9","volume":"22","author":"FR Herrera Juan","year":"2014","unstructured":"Herrera Juan, F.R., et al.: Pareto optimality and robustness in bi-blending problems. Top 22(1), 254\u2013273 (2014)","journal-title":"Top"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.cor.2013.10.003","volume":"43","author":"Lopes Rui Borges et al","year":"2014","unstructured":"Lopes Rui Borges et al: Location-arc routing problem: heuristic approaches and test instances. Comput. Oper. Res. 43, 309\u2013317 (2014)","journal-title":"Comput. Oper. Res."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Wisittipanich, W., Kachitvichyanukul, V.: A pareto-archived differential evolution algorithm for multi-objective flexible job shop scheduling problems. In: Logistics Operations, Supply Chain Management and Sustainability, pp. 325\u2013339. Springer International Publishing, Switzerland (2014)","DOI":"10.1007\/978-3-319-07287-6_23"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, J., Li, X.: Research and design of flexible job shop scheduling system. In: Proceedings of the 2012 International Conference on Cybernetics and Informatics. Springer, New York (2014)","DOI":"10.1007\/978-1-4614-3872-4_165"},{"key":"33_CR11","unstructured":"Sivasankaran, P., Shahabudeen, P.: Literature review of assembly line balancing problems. In: The International Journal of Advanced Manufacturing Technology, pp. 1\u201330 (2014)"},{"key":"33_CR12","unstructured":"Soumis, F.: Airline crew scheduling: models, algorithms, and data sets. In: Kasirzadeh, A., Saddoune, M. (2014)"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cor.2013.11.003","volume":"44","author":"Barrena Eva","year":"2014","unstructured":"Eva, Barrena, et al.: Exact formulations and algorithm for the train timetabling problem with dynamic demand. Comput. Oper. Res. 44, 66\u201374 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"33_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2014.03.046","volume":"238","author":"Jorge A Soria-Alcaraz","year":"2014","unstructured":"Soria-Alcaraz, Jorge A., et al.: Effective learning hyper-heuristics for the course timetabling problem. Eur. J. Oper. Res. 238(1), 77\u201386 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Chen, K., Ross, S.M.: An adaptive stochastic knapsack problem. Eur. J. Oper. Res. 239, 625\u2013635 (2014)","DOI":"10.1016\/j.ejor.2014.06.027"},{"key":"33_CR16","unstructured":"Christofides, N.:\u00a0Worst-case analysis of a new heuristic for the travelling salesman problem. No. RR-388. Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group (1976)"},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"John E Beasley","year":"1996","unstructured":"Beasley, John E., Chu, Paul C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"33_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"Harald Dyckhoff","year":"1990","unstructured":"Dyckhoff, Harald: A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2), 145\u2013159 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"33_CR19","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Yvan Dumas","year":"1991","unstructured":"Dumas, Yvan, Desrosiers, Jacques, Soumis, Francois: The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1), 7\u201322 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"33_CR20","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0924-0136(98)00079-X","volume":"84","author":"WH Yang","year":"1998","unstructured":"Yang, W.H., Tarng, Y.S.: Design optimization of cutting parameters for turning operations based on the Taguchi method. J. Mater. Process. Technol. 84(1), 122\u2013129 (1998)","journal-title":"J. Mater. Process. Technol."},{"issue":"3","key":"33_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/785411.785416","volume":"8","author":"Kuchcinski Krzysztof","year":"2003","unstructured":"Krzysztof, Kuchcinski: Constraints-driven scheduling and resource assignment. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 8(3), 355\u2013383 (2003)","journal-title":"ACM Trans. Des. Autom. Electron. Syst. (TODAES)"},{"issue":"3","key":"33_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0925-5273(98)00079-6","volume":"55","author":"M Beamon Benita","year":"1998","unstructured":"Beamon Benita, M.: Supply chain design and analysis: models and methods. Int. J. Prod. Econ. 55(3), 281\u2013294 (1998)","journal-title":"Int. J. Prod. Econ."},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Norkin, V.I., Pflug, G.C., Ruszczy\u0144ski, A.: A branch and bound method for stochastic global optimization. Math. Program 83(1\u20133), 425\u2013450 (1998)","DOI":"10.1007\/BF02680569"},{"issue":"4","key":"33_CR24","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0016-0032(94)90004-3","volume":"331","author":"SJ Wu","year":"1994","unstructured":"Wu, S.J., Chow, P.T.: Genetic algorithms for solving mixed-discrete optimization problems. J. Franklin Inst. 331(4), 381\u2013401 (1994)","journal-title":"J. Franklin Inst."},{"issue":"20","key":"33_CR25","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1016\/S0045-7949(03)00253-0","volume":"81","author":"VB Gantovnik","year":"2003","unstructured":"Gantovnik, V.B., Anderson-Cook, C.M., G\u00fcrdal, Z., Watson, L.T.: A genetic algorithm with memory for mixed discrete\u2013continuous design optimization. Comput. Struct. 81(20), 2003\u20132009 (2003)","journal-title":"Comput. Struct."},{"issue":"4","key":"33_CR26","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(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. Proc. IEEE Int. Conf. Neural Netw. 4(2) 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"33_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"3","key":"33_CR29","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"Karaboga Dervis","year":"2007","unstructured":"Dervis, Karaboga, Basturk, Bahriye: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Global Optim."},{"key":"33_CR30","doi-asserted-by":"crossref","unstructured":"Gao, J., Hong L., Yong-Chang J.: Modified differential evolution for the integer programming problems. In: International Conference on Artificial Intelligence and Computational Intelligence, AICI\u201909, vol. 1 (2009)","DOI":"10.1109\/AICI.2009.307"},{"key":"33_CR31","doi-asserted-by":"publisher","first-page":"4707","DOI":"10.1016\/j.ces.2006.03.004","volume":"61","author":"R Angira","year":"2006","unstructured":"Angira, R., Babu, B.V.: Optimization of process synthesis and design problems: a modified differential evolution approach. Chem. Eng. Sci. 61, 4707\u20134721 (2006)","journal-title":"Chem. Eng. Sci."},{"key":"33_CR32","doi-asserted-by":"publisher","first-page":"7126","DOI":"10.1021\/ie070007q","volume":"46","author":"M Srinivas","year":"2007","unstructured":"Srinivas, M., Rangaiah, G.P.: Differential evolution with tabu list for solving nonlinear and mixed-integer nonlinear programming problems. Ind. Eng. Chem. Res. 46, 7126\u20137135 (2007)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"1","key":"33_CR33","first-page":"140","volume":"6","author":"Deng Changshou","year":"2011","unstructured":"Changshou, Deng, et al.: Structure-encoding differential evolution for integer programming. J. Softw. 6(1), 140\u2013147 (2011)","journal-title":"J. Softw."},{"key":"33_CR34","doi-asserted-by":"crossref","unstructured":"Li, H., Zhang, L.: A discrete hybrid differential evolution algorithm for solving integer programming problems. Eng. Optim. ISSN, 1029\u20130273 (2013)","DOI":"10.1080\/0305215X.2013.836637"},{"key":"33_CR35","doi-asserted-by":"publisher","unstructured":"Tantawy, S.F.: A new procedure for solving integer linear programming problems. Arab. J. Sci. Eng. (2014). doi: 10.1007\/s13369-014-1079-6","DOI":"10.1007\/s13369-014-1079-6"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of Fourth International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-2220-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T20:01:19Z","timestamp":1747252879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-2220-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,24]]},"ISBN":["9788132222194","9788132222200"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-2220-0_33","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014,12,24]]},"assertion":[{"value":"24 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}