{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T13:36:08Z","timestamp":1770471368651,"version":"3.49.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1016\/s0377-2217(98)00231-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:07:59Z","timestamp":1027613279000},"page":"533-552","source":"Crossref","is-referenced-by-count":23,"title":["Routing heuristics for automated pick and place machines"],"prefix":"10.1016","volume":"117","author":[{"given":"Reza H.","family":"Ahmadi","sequence":"first","affiliation":[]},{"given":"John W.","family":"Mamer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00231-8_BIB1","unstructured":"Ahmadi, J., Sciomachen, A., 1990. Modeling and optimization environment for a component placement machine. Working paper"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB2","doi-asserted-by":"crossref","unstructured":"Ahmadi, J., Grotzinger, S., Johnson, D., 1990. Component allocation and partitioning for a dual delivery placement machine. Operations Research 36 (2)","DOI":"10.1287\/opre.36.2.176"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB3","unstructured":"Ball, M., Magazine, M., 1987. Sequencing of placements in printed circuit board assembly. Working paper"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB4","doi-asserted-by":"crossref","unstructured":"Bartholdi, J., Platzman, L., 1986. Retrieval strategies for carousel conveyor, IIE Transactions (June)","DOI":"10.1080\/07408178608975344"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB5","doi-asserted-by":"crossref","unstructured":"Bozer, Y., Schorn, E., Sharp, G., 1990. Geometric approaches to solve the Chebyshev traveling salesman problem. IIE Transactions 22 (3)","DOI":"10.1080\/07408179008964179"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB6","doi-asserted-by":"crossref","unstructured":"Burke, L., 1994. Neural methods for the traveling salesman problem \u2013 insights from operations research. Neural Network 7 (4)","DOI":"10.1016\/0893-6080(94)90045-0"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","article-title":"The clustered traveling salesman problem","volume":"2","author":"Chisman","year":"1975","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB8","doi-asserted-by":"crossref","unstructured":"Deinkeko, Vandal, V.R., Rote, G., 1994. The convex-hull-and line traveling salesman problem \u2013 a solvable case. Information Processing Letters 51 (3)","DOI":"10.1016\/0020-0190(94)00071-9"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB9","doi-asserted-by":"crossref","unstructured":"Fiechter, C., 1994. A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics 51 (3)","DOI":"10.1016\/0166-218X(92)00033-I"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01328808","article-title":"Optimal strip sequencing strategies for flexible manufacturing operations in two and three dimensions","volume":"6","author":"Gaboune","year":"1994","journal-title":"International Journal of Flexible Manufacturing Systems"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB11","doi-asserted-by":"crossref","unstructured":"Gaboune, B., Laporte, Soumis, F., 1994. Optimal tool partitioning rules for numerically controlled punch press operations. Recherche Operationnelle 28, 209\u2013220","DOI":"10.1051\/ro\/1994280302091"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB12","unstructured":"Garey, M., Johnson, D., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB13","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Hertz, A., Laporte, G., 1992. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40 (6)","DOI":"10.1287\/opre.40.6.1086"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB14","unstructured":"Goetschalckx, M.P., 1983. Storage and retrieval policies for efficient order picking. Unpublished dissertation, Georgia Institute of Technology, Atlanta, GA"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB15","first-page":"255","article-title":"Sequencing picking operations in man-aboard order picking system","volume":"4","author":"Goetschalckx","year":"1993","journal-title":"Material Flow"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB16","unstructured":"Golden, B.L., Stewart, W.R., 1990. Empirical analysis of TSP heuristics. In: Lawler et al. (Eds.), The Traveling Salesman Problem. Wiley, New York"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB17","doi-asserted-by":"crossref","unstructured":"Grotzinger, S., Sciomachen, A., 1988. Feeder assignment models for concurrent placement machines. IIE Transactions 24 (4)","DOI":"10.1080\/07408179208964232"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB18","unstructured":"Johnson, D., McGeoch, L., 1997. Optimization by simulated annealing: An experimental evaluation. Operations Research 39 (1)"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB19","doi-asserted-by":"crossref","unstructured":"Knox, J., 1994. Tabu search performance on the symmetric traveling salesman problem. Computers and Operations Research 21 (8)","DOI":"10.1016\/0305-0548(94)90016-7"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB20","doi-asserted-by":"crossref","unstructured":"Laporte, G., Sauve, G., Soumis, M., 1988. Vehicle routing with full loads, Computers and Operations Research 15 (3)","DOI":"10.1016\/0305-0548(88)90034-2"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB21","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1990. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB22","doi-asserted-by":"crossref","unstructured":"Lee, J., Choi, M., 1994. Optimization by multicanonical annealing and the traveling salesman problem. Physical Review 50 (2)","DOI":"10.1007\/978-3-642-79293-9_19"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB23","doi-asserted-by":"crossref","unstructured":"Litke, J., 1984. An improved solution to the traveling salesman problem with thousands of nodes. Communications of the ACM 27(12)","DOI":"10.1145\/2135.2141"},{"issue":"4","key":"10.1016\/S0377-2217(98)00231-8_BIB24","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1287\/opre.39.4.623","article-title":"A Lagrangian based approach for the asymmetric generalized traveling salesman problem","volume":"39","author":"Noon","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB25","doi-asserted-by":"crossref","unstructured":"Platzman, L., Bartholdi, J., 1989. Specefilling curves and the planar traveling salesman problem. Journal of the Association for Computing Machinery 36 (4)","DOI":"10.1145\/76359.76361"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB26","doi-asserted-by":"crossref","unstructured":"Steele, M., 1990. Probabilistic and worst case analyses of classical problems of combinatorial optimizations in Euclidean space. Mathematics of Operations Research 15 (4)","DOI":"10.1287\/moor.15.4.749"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB27","unstructured":"Stewart, J.W., 1977. A computationally efficient heuristic for the traveling salesman problem. In: Proceedings of the 13th Annual Meeting of Southeastern TIMS, South Carolina"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB28","unstructured":"Weide, B.W., 1978. Statistical methods in algorithm design and analysis. Unpublished Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA"},{"key":"10.1016\/S0377-2217(98)00231-8_BIB29","doi-asserted-by":"crossref","unstructured":"Wilhelm, M., Ward, T., 1987. Solving quadratic assignment problems by simulated annealing. IIE Transactions 19 (1)","DOI":"10.1080\/07408178708975376"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798002318?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798002318?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:29:24Z","timestamp":1578706164000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798002318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0377221798002318"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00231-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}