{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:45:37Z","timestamp":1740181537216,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T00:00:00Z","timestamp":1645660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T00:00:00Z","timestamp":1645660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s42979-022-01062-8","type":"journal-article","created":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T13:02:31Z","timestamp":1645707751000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mixing Grain to Improve Profitability in Winter Wheat Using Evolutionary Algorithms"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8726-8226","authenticated-orcid":false,"given":"Md Asaduzzaman","family":"Noor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John W.","family":"Sheppard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Yaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"issue":"1","key":"1062_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.advengsoft.2003.09.001","volume":"35","author":"DB Adams","year":"2004","unstructured":"Adams DB, Watson LT, G\u00fcrdal Z, Anderson-Cook CM. Genetic algorithm optimization and blending of composite laminates by locally reducing laminate thickness. Adv Eng Softw. 2004;35(1):35\u201343.","journal-title":"Adv Eng Softw."},{"issue":"3","key":"1062_CR2","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/0377-2217(94)90416-2","volume":"72","author":"J Ashayeri","year":"1994","unstructured":"Ashayeri J, van Eijs A, Nederstigt P. Blending modelling in a process manufacturing: a case study. Euro J Oper Res. 1994;72(3):460\u20138.","journal-title":"Euro J Oper Res."},{"issue":"2","key":"1062_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.ijpe.2006.11.008","volume":"107","author":"B Bilgen","year":"2007","unstructured":"Bilgen B, Ozkarahan I. A mixed-integer linear programming model for bulk grain blending and shipping. Int J Prod Econ. 2007;107(2):555\u201371.","journal-title":"Int J Prod Econ."},{"issue":"3","key":"1062_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput Surv. 2003;35(3):268\u2013308.","journal-title":"ACM Comput Surv."},{"unstructured":"Bond JJ. Wheat sector at a glance. U.S. Department of Agriculture. https:\/\/www.ers.usda.gov\/topics\/crops\/wheat\/wheat-sector-at-a-glance. Last accessed 07\/14\/21.","key":"1062_CR5"},{"key":"1062_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s13748-011-0005-3","volume":"1","author":"J Ceberio","year":"2012","unstructured":"Ceberio J, Irurozki E, Mendiburu A, Lozano J. A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Progress Artificial Intell. 2012;1:103\u201317.","journal-title":"Progress Artificial Intell."},{"issue":"10","key":"1062_CR7","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1016\/j.cep.2010.07.014","volume":"49","author":"X Chen","year":"2010","unstructured":"Chen X, Wang N. Optimization of short-time gasoline blending scheduling problem with a dna based hybrid genetic algorithm. Chem Eng Process. 2010;49(10):1076\u201383.","journal-title":"Chem Eng Process."},{"issue":"1","key":"1062_CR8","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0377-2217(96)00388-8","volume":"99","author":"Y Crama","year":"1997","unstructured":"Crama Y. Combinatorial optimization models for production scheduling in automated manufacturing systems. Euro J Oper Res. 1997;99(1):136\u201353.","journal-title":"Euro J Oper Res."},{"doi-asserted-by":"crossref","unstructured":"Dantzig G. Formulation a linear programming model. In: Linear programming and extensions, pp. 42\u201350. Princeton Univ. Press, Princeton, NJ (1963).","key":"1062_CR9","DOI":"10.7249\/R366"},{"unstructured":"Davis L. Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence - Volume 1, p. 162\u2013164. Morgan Kaufmann Publishers Inc. (1985).","key":"1062_CR10"},{"key":"1062_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ijpe.2018.08.036","volume":"205","author":"F Djeumou Fomeni","year":"2018","unstructured":"Djeumou Fomeni F. A multi-objective optimization approach for the blending problem in the tea industry. Int J Prod Econ. 2018;205:179\u201392.","journal-title":"Int J Prod Econ."},{"issue":"2\u20133","key":"1062_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg DE, Holland JH. Genetic algorithms and machine learning. Mach Learn. 1988;3(2\u20133):95\u20139.","journal-title":"Mach Learn."},{"unstructured":"Goldberg DE, Lingle R. Alleles, loci and the traveling salesman problem. In: Proceedings of the 1st International Conference on Genetic Algorithms, p. 154\u2013159. L. Erlbaum Associates Inc., USA (1985).","key":"1062_CR13"},{"key":"1062_CR14","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.cie.2019.03.011","volume":"130","author":"Q Guo","year":"2019","unstructured":"Guo Q, Tang L. Modelling and discrete differential evolution algorithm for order rescheduling problem in steel industry. Comput Ind Eng. 2019;130:586\u201396.","journal-title":"Comput Ind Eng."},{"unstructured":"Haas N. Optimizing Wheat Blends for Customer Value Creation: A Special Case of Solvent Retention Capacity. MS Thesis, Kansas State University, USA (2011).","key":"1062_CR15"},{"key":"1062_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1111\/j.1745-4530.2001.tb00539.x","volume":"24","author":"M Hayta","year":"2001","unstructured":"Hayta M, Cakmalki U. Optimization of wheat blending to produce breadmaking flour. J Food Process Eng. 2001;24:179\u201392.","journal-title":"J Food Process Eng."},{"doi-asserted-by":"crossref","unstructured":"Hughes JA, Houghten S, Ashlock D. Permutation Problems, Genetic Algorithms, and Dynamic Representations, pp. 123\u2013149. Springer International Publishing (2017).","key":"1062_CR17","DOI":"10.1007\/978-3-319-50920-4_6"},{"issue":"4","key":"1062_CR18","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1021\/ie0204843","volume":"42","author":"Z Jia","year":"2003","unstructured":"Jia Z, Ierapetritou M. Mixed-integer linear programming model for gasoline blending and distribution scheduling. Ind Eng Chem Res. 2003;42(4):825\u201335.","journal-title":"Ind Eng Chem Res."},{"key":"1062_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4844-2","volume-title":"Linear Programming","author":"H Karloff","year":"1991","unstructured":"Karloff H. Linear Programming. USA: Birkhauser Boston Inc.; 1991."},{"issue":"3","key":"1062_CR20","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"MW Krentel","year":"1988","unstructured":"Krentel MW. The complexity of optimization problems. J Comput Syst Sci. 1988;36(3):490\u2013509.","journal-title":"J Comput Syst Sci."},{"unstructured":"Lawler E. Combinatorial Optimization: Networks and Matroids. Rinehart and Winston: Holt; 1976.","key":"1062_CR21"},{"issue":"8","key":"1062_CR22","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI. Binary codes capable of correcting deletions, insertions, and reversals. Cybernet Control Theory. 1966;10(8):707\u201310.","journal-title":"Cybernet Control Theory"},{"doi-asserted-by":"crossref","unstructured":"Li, X., Bonyadi, M.r., Michalewicz, Z., Barone, L.: A hybrid evolutionary algorithm for wheat blending problem. TheScientificWorldJournal 2014, 967254 (2014)","key":"1062_CR23","DOI":"10.1155\/2014\/967254"},{"doi-asserted-by":"crossref","unstructured":"Lichtblau D. Relative position indexing approach. In: Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization, pp. 81\u2013120. Springer Berlin Heidelberg (2009).","key":"1062_CR24","DOI":"10.1007\/978-3-540-92151-6_4"},{"key":"1062_CR25","volume-title":"Understanding and using linear programming","author":"J Matouek","year":"2006","unstructured":"Matouek J, G\u00e4rtner B. Understanding and using linear programming. Berlin, Heidelberg: Springer-Verlag; 2006."},{"key":"1062_CR26","first-page":"193","volume":"9","author":"B Miller","year":"1995","unstructured":"Miller B, Goldberg D. Genetic algorithms, tournament selection, and the effects of noise. Complex Syst. 1995;9:193\u2013212.","journal-title":"Complex Syst."},{"issue":"1","key":"1062_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1021\/ie030348d","volume":"43","author":"LFL Moro","year":"2004","unstructured":"Moro LFL, Pinto JM. Mixed-integer programming approach for short-term crude oil scheduling. Ind Eng Chem Res. 2004;43(1):85\u201394.","journal-title":"Ind Eng Chem Res."},{"key":"1062_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA. Integer and Combinatorial Optimization. USA: Wiley-Interscience; 1988."},{"doi-asserted-by":"crossref","unstructured":"Noor MA, Sheppard JW. Evolutionary grain-mixing to improve profitability in farming winter wheat. In: Applications of Evolutionary Computation, pp. 113\u2013129. Springer International Publishing (2021).","key":"1062_CR29","DOI":"10.1007\/978-3-030-72699-7_8"},{"unstructured":"Noor MA, Yaw S, Zhu B, Sheppard JW. Optimal grain mixing is NP-Complete. arXiv:2112.08501 (2021). https:\/\/arxiv.org\/abs\/2112.08501v1.","key":"1062_CR30"},{"doi-asserted-by":"crossref","unstructured":"Onwubolu G, Davendra D. Differential evolution for permutation\u2014based combinatorial problems. In: Differential Evolution: a handbook for global permutation-based combinatorial optimization, pp. 13\u201334. Springer Berlin Heidelberg (2009).","key":"1062_CR31","DOI":"10.1007\/978-3-540-92151-6_2"},{"issue":"11","key":"1062_CR32","first-page":"49","volume":"31","author":"A Otman","year":"2011","unstructured":"Otman A, Jaafar A. A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. Int J Comput Appl. 2011;31(11):49\u201357.","journal-title":"Int J Comput Appl"},{"issue":"8","key":"1062_CR33","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1016\/j.cor.2008.10.008","volume":"36","author":"QK Pan","year":"2009","unstructured":"Pan QK, Wang L, Qian B. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Comput Oper Res. 2009;36(8):2498\u2013511.","journal-title":"Comput Oper Res."},{"key":"1062_CR34","volume-title":"Production planning by mixed integer programming","author":"Y Pochet","year":"2010","unstructured":"Pochet Y, Wolsey LA. Production planning by mixed integer programming. 1st ed. Incorporated: Springer Publishing Company; 2010.","edition":"1"},{"key":"1062_CR35","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"J Potvin","year":"1996","unstructured":"Potvin J. Genetic algorithms for the traveling salesman problem. Ann Oper Res. 1996;63:337\u201370.","journal-title":"Ann Oper Res."},{"doi-asserted-by":"crossref","unstructured":"Qian B, Wang L, Hu R, liang Wang W, Huang D, Wang X. A hybrid differential evolution method for permutation flow-shop scheduling. Int J Adv Manuf Technol 38, 757\u2013777 (2008).","key":"1062_CR36","DOI":"10.1007\/s00170-007-1115-8"},{"doi-asserted-by":"crossref","unstructured":"Radhakrishnan A, Jeyakumar G. Evolutionary algorithm for solving combinatorial optimization\u2014a review. In: Innovations in Computer Science and Engineering, pp. 539\u2013545. Springer Singapore (2021).","key":"1062_CR37","DOI":"10.1007\/978-981-33-4543-0_57"},{"doi-asserted-by":"crossref","unstructured":"Randall D, Cleland L, Kuehne CS, Link GWB, Sheer DP. Water supply planning simulation model using mixed-integer linear programming \u201cengine.\u201d J Water Resources Plann Manag. 1997;123(2):116\u201324.","key":"1062_CR38","DOI":"10.1061\/(ASCE)0733-9496(1997)123:2(116)"},{"doi-asserted-by":"crossref","unstructured":"Sniedovich M. Dynamic programming: foundations and principles. Taylor & Francis (2010).","key":"1062_CR39","DOI":"10.1201\/EBK0824740993"},{"unstructured":"Storn R, Price K. Differential evolution\u2014a simple and efficient adaptive scheme for global optimization over continuous spaces. Tech. rep., TR-95-012, International Computer Science Institute, Berkeley (1995).","key":"1062_CR40"},{"issue":"6","key":"1062_CR41","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1016\/j.cor.2008.06.007","volume":"36","author":"MF Tasgetiren","year":"2009","unstructured":"Tasgetiren MF, Pan QK, Liang YC. A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Comput Oper Res. 2009;36(6):1900\u201315.","journal-title":"Comput Oper Res."},{"unstructured":"Vazirani VV. Approximation algorithms. Springer (2001).","key":"1062_CR42"},{"doi-asserted-by":"crossref","unstructured":"Whelan B. Site-Specific Crop Management, pp. 597\u2013622. Springer International Publishing (2018).","key":"1062_CR43","DOI":"10.1007\/978-3-319-63439-5_20"},{"doi-asserted-by":"crossref","unstructured":"Williamson DP, Shmoys DB. The Design of Approximation Algorithms. Cambridge University Press (2011).","key":"1062_CR44","DOI":"10.1017\/CBO9780511921735"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01062-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01062-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01062-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T21:25:42Z","timestamp":1674854742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01062-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,24]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1062"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01062-8","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,2,24]]},"assertion":[{"value":"28 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"172"}}