{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:58:02Z","timestamp":1772791082203,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1007\/bf00126629","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T07:52:38Z","timestamp":1099209158000},"page":"241-252","source":"Crossref","is-referenced-by-count":39,"title":["A hybrid approach to vehicle routing using neural networks and genetic algorithms"],"prefix":"10.1007","volume":"6","author":[{"given":"Jean-Yves","family":"Potvin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dub\ufffd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Robillard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0893-6080(90)90071-R","volume":"3","author":"S.C. Ahalt","year":"1990","unstructured":"S.C. Ahalt, A.K. Krishnamurthy, P. Chen, and D.E. Melton, ?Competitive learning algorithms for vector quantization,? Neural Networks, vol. 3, pp. 277?290, 1990.","journal-title":"Neural Networks"},{"key":"CR2","unstructured":"J.E. Baker, ?Reducing bias and inefficiency in the selection algorithm,? in Proceedings of the Second Int. Conf. on Genetic Algorithms, Cambridge, MA, 1987, pp. 14?21."},{"key":"CR3","unstructured":"J.L. Blanton and R.L. Wainwright, ?Multiple vehicle routing with time and capacity constraints using genetic algorithms,? in Proceedings of the Fifth International Conference on Genetic Algorithms, Champaign, IL, 1993, pp. 452?459."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"G. Clarke and J. Wright, ?Scheduling of vehicles from a central depot to a number of delivery points,? Operations Research, vol. 12, pp. 568?581, 1964.","journal-title":"Operations Research"},{"key":"CR5","volume-title":"Artificial Intelligence through Simulated Evolution","author":"L.J. Fogel","year":"1966","unstructured":"L.J. Fogel, A.J. Owens, and M.J. Walsh, Artificial Intelligence through Simulated Evolution, Wiley: New York, 1966."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00344744","volume":"23","author":"S. Grossberg","year":"1976","unstructured":"S. Grossberg, ?Adaptive pattern classification and universal recoding I. Parallel development and coding of neural feature detectors,? Biological Cybernetics, vol. 23, pp. 121?134, 1976.","journal-title":"Biological Cybernetics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF00344744","volume":"23","author":"S. Grossberg","year":"1976","unstructured":"S. Grossberg, ?Adaptive pattern classification and universal recoding II. Feedback, expectation, olfaction, illusions,? Biological Cybernetics vol. 23, pp. 187?202, 1976.","journal-title":"Biological Cybernetics"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1111\/j.1551-6708.1987.tb00862.x","volume":"11","author":"S. Grossberg","year":"1987","unstructured":"S. Grossberg, ?Competitive learning: From interactive activation to adaptive resonance,? Cognitive Science, vol. 11, pp. 23?63, 1987.","journal-title":"Cognitive Science"},{"key":"CR9","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"J.H. Holland (1975), Adaptation in Natural and Artificial Systems, The University of Michigan Press: Ann Arbor, Reprinted by MIT Press, 1992."},{"key":"CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-00784-6","volume-title":"Self Organization and Associative Memory","author":"T. Kohonen","year":"1988","unstructured":"T. Kohonen, Self Organization and Associative Memory, Second Edition, Springer: Berlin, 1988.","edition":"Second Edition"},{"key":"CR11","unstructured":"S. Martello and P. Toth, ?An algorithm for the generalized assignment problem,? in Operational Research'81: Proceedings of the Ninth IFORS Int. Conf. on Operational Research, edited by J.P. Brans, North Holland, 1981, pp. 589?603."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J.Y. Potvin","year":"1993","unstructured":"J.Y. Potvin and J.M. Rousseau, ?A parallel route building algorithm for the vehicle routing and scheduling problem with time windows,? European Journal of Operational Research, vol. 66, pp. 331?340, 1993.","journal-title":"European Journal of Operational Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1207\/s15516709cog0901_5","volume":"9","author":"D.E. Rumelhart","year":"1985","unstructured":"D.E. Rumelhart and D. Zipser, ?Feature discovery by competitive learning,? Cognitive Science, vol. 9, pp. 75?112, 1985.","journal-title":"Cognitive Science"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","volume":"47","author":"M.W.P. Savelsbergh","year":"1990","unstructured":"M.W.P. Savelsbergh, ?An efficient implementation of local search algorithms for constrained routing problems,? European Journal of Operational Research, vol. 47, pp. 75?85, 1990.","journal-title":"European Journal of Operational Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"M.M. Solomon, ?Algorithms for the vehicle routing and scheduling problem with time window constraints,? Operations Research, vol. 35, pp. 254?265, 1987.","journal-title":"Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"M.M. Solomon","year":"1988","unstructured":"M.M. Solomon and J. Desrosiers, ?Time window constrained routing and scheduling problems,? Transportation Science, vol. 22, pp. 1?13, 1988.","journal-title":"Transportation Science"},{"key":"CR17","first-page":"85","volume-title":"Vehicle Routing: Methods and Studies","author":"M.M. Solomon","year":"1988","unstructured":"M.M. Solomon, E.K. Baker, and J.R. Schaffer, ?Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures,? in Vehicle Routing: Methods and Studies, edited by B.L. Golden and A.A. Assad, North Holland: Amsterdam, pp. 85?105, 1988."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P. Thompson","year":"1993","unstructured":"P. Thompson and H. Psaraftis, ?Cyclic transfer algorithms for multivehicle routing and scheduling problems,? Operations Research, vol. 41, pp. 935?946, 1993.","journal-title":"Operations Research"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1287\/mnsc.18.11.664","volume":"18","author":"F. Tillman","year":"1972","unstructured":"F. Tillman and T. Cain, ?An upper bounding algorithm for the single and multiple terminal delivery problem,? Management Science, vol. 18, pp. 664?682, 1972.","journal-title":"Management Science"},{"key":"CR20","unstructured":"D. Whitley, ?The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best,? in Proceedings of the Third Int. Conf. on Genetic Algorithms, Fairfax, VA, 1989, pp. 116?121."}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00126629.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00126629\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00126629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T05:19:39Z","timestamp":1554268779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00126629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["BF00126629"],"URL":"https:\/\/doi.org\/10.1007\/bf00126629","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}