{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:17:16Z","timestamp":1648829836626},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0305-0548(96)00054-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"399-411","source":"Crossref","is-referenced-by-count":4,"title":["Enhanced genetic operators for the resolution of discrete constrained optimization problems"],"prefix":"10.1016","volume":"24","author":[{"given":"Darryn J.","family":"Reid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00054-8_BIB1","series-title":"Proc. Fourth Int. Conf. Genetic Algorithms","first-page":"92","article-title":"Extended selection mechanisms in genetic algorithms","author":"B\u00e4ch","year":"1991"},{"issue":"8","key":"10.1016\/S0305-0548(96)00054-8_BIB2","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1016\/0305-0548(94)90023-X","article-title":"Genetic search and the dynamic facility layout problem","volume":"21","author":"Conway","year":"1994","journal-title":"Comp. Oper. Res."},{"issue":"11","key":"10.1016\/S0305-0548(96)00054-8_BIB3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0898-1221(94)90100-7","article-title":"Applying evolutionary programming to selected control problems","volume":"27","author":"Fogel","year":"1994","journal-title":"Comp. Math. Appl."},{"key":"10.1016\/S0305-0548(96)00054-8_BIB4","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"issue":"3","key":"10.1016\/S0305-0548(96)00054-8_BIB5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/175247.175259","article-title":"Genetic and evolutionary algorithms come of age","volume":"37","author":"Goldberg","year":"1994","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0305-0548(96)00054-8_BIB6","doi-asserted-by":"crossref","DOI":"10.1038\/scientificamerican0792-66","article-title":"Genetic algorithms","author":"Holland","year":"1992","journal-title":"Scientific American"},{"key":"10.1016\/S0305-0548(96)00054-8_BIB7","series-title":"Proc. Fourth Int. Conf. on Genetic Algorithms","first-page":"151","article-title":"Handling constraints in genetic algorithms","author":"Michalewicz","year":"1991"},{"issue":"8","key":"10.1016\/S0305-0548(96)00054-8_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/0305-0548(94)90021-3","article-title":"A genetic algorithm for the talent scheduling problem","volume":"21","author":"Nordstr\u00f6m","year":"1994","journal-title":"Comp. Oper. Res."},{"issue":"5","key":"10.1016\/S0305-0548(96)00054-8_BIB9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0895-7177(96)00014-3","article-title":"Genetic algorithms in constrained optimization","volume":"23","author":"Reid","year":"1996","journal-title":"Math. Comp. Modelling"},{"key":"10.1016\/S0305-0548(96)00054-8_BIB10","series-title":"Proc. Third Int. Conf. on Genetic Algorithms","first-page":"191","article-title":"Some guidelines for genetic algorithms with penalty functions","author":"Richardson","year":"1989"},{"key":"10.1016\/S0305-0548(96)00054-8_BIB11","series-title":"Proc. Third Int. Conf. on Genetic Algorithms","first-page":"141","article-title":"Constrained genetic optimization via dynamic reward-penalty balancing and its use in pattern recognition","author":"Siedlecki","year":"1989"},{"key":"10.1016\/S0305-0548(96)00054-8_BIB12","series-title":"Proc. Third Int. Conf. on Genetic Algorithms","first-page":"2","article-title":"Uniform crossover in genetic algorithms","author":"Syswerda","year":"1989"},{"issue":"2","key":"10.1016\/S0305-0548(96)00054-8_BIB13","doi-asserted-by":"crossref","DOI":"10.1109\/21.87092","article-title":"A genetic algorithm for the linear transportation problem","volume":"21","author":"Vignaux","year":"1991","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"key":"10.1016\/S0305-0548(96)00054-8_BIB14","series-title":"Proc. Third Int. Conf. on Genetic Algorithms","first-page":"116","article-title":"The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best","author":"Whitley","year":"1989"},{"issue":"8","key":"10.1016\/S0305-0548(96)00054-8_BIB15","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1016\/0305-0548(94)90022-1","article-title":"Genetic search with dynamic operating disciplines","volume":"21","author":"Yeralan","year":"1994","journal-title":"Comp. Oper. Res."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000548?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000548?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:21:05Z","timestamp":1555204865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0305054896000548"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00054-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}