{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:29:44Z","timestamp":1725838184569},"publisher-location":"New Delhi","reference-count":37,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132226512"},{"type":"electronic","value":"9788132226536"}],"license":[{"start":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T00:00:00Z","timestamp":1447891200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-81-322-2653-6_17","type":"book-chapter","created":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T15:47:51Z","timestamp":1447861671000},"page":"249-270","source":"Crossref","is-referenced-by-count":1,"title":["Comparative Analysis of Genetic Algorithm and Classical Algorithms in Fractional Programming"],"prefix":"10.1007","author":[{"given":"Debasish","family":"Roy","sequence":"first","affiliation":[]},{"given":"Surjya Sikha","family":"Das","sequence":"additional","affiliation":[]},{"given":"Swarup","family":"Ghosh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,19]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/nav.3800200308","volume":"20","author":"A. Charnes","year":"1973","unstructured":"Charnes, A.C.W.: An explicit general solution in linear fractional programming. Naval Res. Logist. Quart. 20, 449\u2013467 (1973)","journal-title":"Naval Research Logistics Quarterly"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.21.1.22","volume":"21","author":"GR Bitran","year":"1973","unstructured":"Bitran, G.R., Novaes, A.G.: Linear programming with fractional objective function. Oper. Res. 21, 22\u201329 (1973)","journal-title":"Oper. Res."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1287\/opre.24.4.675","volume":"24","author":"GR Birtan","year":"1976","unstructured":"Birtan, G.R., Magnanti, T.L.: Duality and sensitivity analysis of fractional objective function. Oper. Res. 24, 675\u2013699 (1976)","journal-title":"Oper. Res."},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1287\/opre.13.6.1029","volume":"13","author":"K Swarup","year":"1965","unstructured":"Swarup, K.: Linear fractional programming. Oper. Res. 13(6), 1029\u20131036 (1965)","journal-title":"Oper. Res."},{"issue":"3-4","key":"17_CR5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"George B. Dantzig","year":"1955","unstructured":"Dantzig, G.B.: Linear Programming under uncertainty. Manage. Sci. 1(3 and 4), 197\u2013206 (1955)","journal-title":"Management Science"},{"key":"17_CR6","unstructured":"Dantzig, G.B., Mandansky, A.: on solution of two stage linear programming under uncertainty. Barkley Symp. Maths Stat. 1(3 and 4), 165\u2013176 (1961)"},{"key":"17_CR7","volume-title":"Linear Fractional Programming","author":"EB Bazalinov","year":"2003","unstructured":"Bazalinov, E.B.: Linear Fractional Programming. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"17_CR8","unstructured":"Bajalinov, E.: Scaling problems in linear fractional programming. In: proceeding of 10th international conference on operation research, vol. 3, no. 1, pp. 22\u201324 (2004)"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4236\/ajcm.2012.21006","volume":"2","author":"E Shohrab","year":"2012","unstructured":"Shohrab, E., Morteza, P.: Solving the Interval Valued Fractional Programming. Am. J. Comput. Math. 2(1), 51\u201355 (2012)","journal-title":"Am. J. Comput. Math."},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02592087","volume":"72","author":"AI Barros","year":"1996","unstructured":"Barros, A.I., Frenk, J.B., Schaible, S., Zhang, S.: A new algorithm for generalised fractional programming. Math. Program. 72(2), 147\u2013175 (1996)","journal-title":"Math. Program."},{"issue":"1","key":"17_CR11","first-page":"55","volume":"36","author":"N Gogia","year":"1969","unstructured":"Gogia, N.: Revised simplex algorithm for linear fractional programming problem. Math. Student 36(1), 55\u201357 (1969)","journal-title":"Math. Student"},{"key":"17_CR12","unstructured":"Horvath, I.: AsupraprogramliriifracJionare lineare cu restricJii suplimentare. Informatica pentru Conducere, pp. 101\u2013102 (1981)"},{"key":"17_CR13","unstructured":"Stahl, J.: Two new methods for solution of hyperbolic programming. In: Publications of the Mathematical Institute of Hungarian Science, vol. 9, no. B, pp. 743\u2013754 (1964)"},{"key":"17_CR14","volume-title":"Stochastic Programming with MultiObjective Function","author":"IM Stancu-Minasian","year":"1984","unstructured":"Stancu-Minasian, I.M.: Stochastic Programming with MultiObjective Function. D. Reidel Publishing Company, Dordrecht (1984)"},{"issue":"1","key":"17_CR15","first-page":"29","volume":"19","author":"W. B\u00fchler","year":"1975","unstructured":"Buhler, W.: A note on fractional interval programming. Oper. Res. A-B 19, 1, 29\u201336 (1975); Z(19), 29\u201335 (1975)","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robins","year":"1951","unstructured":"Robins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2006.11.005","volume":"35","author":"A Costa","year":"2007","unstructured":"Costa, A., Jones, O., Kroese, D.: Convergence properties of the cross entropy method for discrete optimization. Oper. Res. Lett. 35, 573\u2013580 (2007)","journal-title":"Oper. Res. Lett."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/TEVC.2003.820663","volume":"8","author":"Q Zhang","year":"2004","unstructured":"Zhang, Q., Muhlenbein, H.: On the convergence of a class of estimation of distribution algorithm. IEEE Trans. Evol. Comput. 8, 127\u2013134 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"17_CR19","volume-title":"Convergence of probability measures","author":"P Binglsley","year":"1999","unstructured":"Binglsley, P.: Convergence of probability measures. John Wiley and Sons, New York (1999)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2985505","volume":"6","author":"GE Box","year":"1957","unstructured":"Box, G.E.: Evolutionary operation: a method for increasing industrial productivity. Appl Stat 6, 81\u2013101 (1957)","journal-title":"Appl Stat"},{"key":"17_CR21","volume-title":"Algorithms for Minimization without derivatives","author":"RP Brent","year":"2002","unstructured":"Brent, R.P.: Algorithms for Minimization without derivatives. Printice Hall, EngleWoods Cliffs (2002)"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/BF01681333","volume":"17","author":"R Mifflin","year":"1975","unstructured":"Mifflin, R., Strodiot, J.J.: A Bracketing technique to ensure desirable convergence in univariate minimisation. Math. Prog. 17, 100\u2013117 (1975)","journal-title":"Math. Prog."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01585172","volume":"62","author":"R Mifflin","year":"1993","unstructured":"Mifflin, R., Strodiot, J.J.: A rapidly convergent five-point algorithm for univariate minimisation. Math. Prog. 62, 299\u2013319 (1993)","journal-title":"Math. Prog."},{"key":"17_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1951.tb00067.x","volume":"13","author":"GP Box","year":"1951","unstructured":"Box, G.P., Wilson, K.B.: On the experimental attainment of optimal conditions. Stat. Soc. 13, 1\u201313 (1951)","journal-title":"Stat. Soc."},{"key":"17_CR25","unstructured":"Box, G.E.P., Draper, N.R.: Evolutionary Operation: A Statistical Method For Process Improvement. Wiley, New York (1998)"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R Hooke","year":"1961","unstructured":"Hooke, R., Jeeves, T.A.: Direct search solution for numerical and statistical problem. ACM 8, 212\u2013219 (1961)","journal-title":"ACM"},{"issue":"4","key":"17_CR27","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J. A. Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimisation. Comput. J. 7, 308\u2013313 (1965)","journal-title":"The Computer Journal"},{"key":"17_CR28","volume-title":"Practical Methods for Optimisation","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods for Optimisation. John Wiley and Sons, Chichester (1987)"},{"key":"17_CR29","unstructured":"Murray, W., Wright, M.H., Gill, P.E.: Practical Optimization. Academic Press, London (1981)"},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/BFb0120946","volume":"16","author":"D Gabay","year":"1982","unstructured":"Gabay, D.: Reduced Quasi Newton method with feasibilty improvement for nonlinear constrained optimisation. Math. Prog. Stud. 16, 18\u201344 (1982)","journal-title":"Math. Prog. Stud."},{"key":"17_CR31","first-page":"11","volume":"5","author":"R Fletcher","year":"1975","unstructured":"Fletcher, R.: Conjugate Gradient Methods for Indefinite Systems. Numer. Anal. Rep. 5, 11 (1975)","journal-title":"Numer. Anal. Rep."},{"key":"17_CR32","volume-title":"Nonlinear Programming: A Unified Approach","author":"W Zangwill","year":"1969","unstructured":"Zangwill, W.: Nonlinear Programming: A Unified Approach. Printice Hall, Englewood Cliffs (1969)"},{"key":"17_CR33","unstructured":"Holland, J.H.: Hierarchical description of universal spaces and adaptive systems. Tech. Rep ORA Project 01252 (1968)"},{"key":"17_CR34","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Grefenstette, J.J.: Deception considered harmful. In: Whitley, L.D. (ed.) Foundations of genetic algorithms (1993)","DOI":"10.21236\/ADA294072"},{"issue":"4","key":"17_CR36","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/4235.687889","volume":"1","author":"DG Fogel","year":"1997","unstructured":"Fogel, D.G.: Schema processing under proportional selection in the presence of random effects. IEEE Trans. Evol. Comput. 1(4), 290\u2013293 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"17_CR37","unstructured":"Radcliffe, N.J.: Schema Processing. In: Handbook of evolutionary computation, pp. B2.5\u20131.10. Oxford University Press (1997)"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computing and Systems for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-2653-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T14:48:35Z","timestamp":1718203715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-81-322-2653-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,19]]},"ISBN":["9788132226512","9788132226536"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-2653-6_17","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,11,19]]}}}