{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T02:27:26Z","timestamp":1761964046318},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1007\/bf00114139","type":"journal-article","created":{"date-parts":[[2004,10,30]],"date-time":"2004-10-30T21:26:52Z","timestamp":1099171612000},"page":"69-76","source":"Crossref","is-referenced-by-count":23,"title":["The path and location planning of workpieces by genetic algorithms"],"prefix":"10.1007","volume":"7","author":[{"given":"Cheng-Ji","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching-Shiow","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Baker, J. E. (1985) Adaptive selection methods for genetic algorithms, inProceedings of the International Conference on Genetic Algorithms and their Applications, Hillsdale, NJ, pp. 101?111."},{"key":"CR2","unstructured":"Davis, L. (1985) Job shop scheduling with genetic algorithms, inProceedings of the International Conference on Genetic Algorithms and their Applications, Hillsdale, NJ, pp. 136?140."},{"key":"CR3","unstructured":"Dejong, K. A. and Spears, W. M. (1989) Using genetic algorithms to solve NP-complete problem, inProceedings of the International Conference on Genetic Algorithms and their Applications, San Mateo, CA."},{"key":"CR4","volume-title":"Foundations of Genetic Algorithms","author":"B. R. Fox","year":"1991","unstructured":"Fox, B. R. and McMahon, M. B. (1991) Genetic operators for sequencing problems, inFoundations of Genetic Algorithms, Rawlins, G. J. E. (ed.), Morgan Kaufmann Publishers, New York."},{"key":"CR5","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989)Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, New York."},{"key":"CR6","unstructured":"Goldberg, D. E. and Lingle, R. (1985) Alleles, loci, and the traveling salesman problem, inProceedings of the International Conference on Genetic Algorithms and their Applications, Hillsdale, NJ, pp. 154?159."},{"key":"CR7","unstructured":"Grefenstette, J. J., Gopal, R., Rosmaita, B. J. and Van Gucht, D. (1985) Genetic algorithms for the traveling salesman problem, inProceedings of the International Conference on Genetic Algorithms and their Applications, Hillsdale, NJ, pp. 160?168."},{"key":"CR8","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. H. Holland","year":"1975","unstructured":"Holland, J. H. (1975)Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI."},{"issue":"8","key":"CR9","first-page":"63","volume":"5","author":"J. J. Hopfield","year":"1985","unstructured":"Hopfield, J. J. and Tank, D. W. (1985) Neural computation of decisions in optimization problems.Biological Cybernetics,5(8), 63?70.","journal-title":"Biological Cybernetics"},{"issue":"6","key":"CR10","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/70.63276","volume":"6","author":"O. Maimon","year":"1990","unstructured":"Maimon, O. (1990) The robot task-sequencing planning problem.IEEE Transactions on Robotics and Automation,6(6), 760?765.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"CR11","unstructured":"Oliver, I. M., Smith, D. J. and Holland, J. R. C. (1987) A study of permutation crossover operators on the traveling salesman problem, inProceedings of the International Conference on Genetic Algorithms and their Applications, Cambridge, MA, pp. 224?230."},{"key":"CR12","unstructured":"Syswerda, G. (1989) Uniform crossover in genetic algorithm, inProceedings of the International Conference on Genetic Algorithms and their Applications, San Mateo, CA, pp. 2?9."},{"key":"CR13","unstructured":"Whitley, D. (1989) The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best, inProceedings of the International Conference on Genetic Algorithms and their Applications, San Mateo, CA, pp. 116?121."},{"key":"CR14","volume-title":"Genetic Algorithms and Robots: A Heuristic Strategy for Optimization","author":"D. Yural","year":"1990","unstructured":"Yural, D. (1990)Genetic Algorithms and Robots: A Heuristic Strategy for Optimization, World Scientific, New Jersey."}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00114139.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00114139\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00114139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T10:09:07Z","timestamp":1554718147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00114139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF00114139"],"URL":"https:\/\/doi.org\/10.1007\/bf00114139","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}