{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:56:51Z","timestamp":1754157411771,"version":"3.41.2"},"reference-count":21,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2009,3,6]],"date-time":"2009-03-06T00:00:00Z","timestamp":1236297600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,3,6]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to develop an efficient method for solving a vehicle scheduling problem (VSP) in 2D industrial environments. An autonomous vehicle is requested to serve a set of work centers in the shop floor providing transport and delivery tasks while avoiding collisions with obstacles during its travel. The objective is to find a minimum in length, collision\u2010free vehicle routing schedule that serves timely as many as possible work centers in the shop floor.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>First, the vehicle's environment is mapped into a 2D B\u2010Spline surface embedded in 3D Euclidean space using a robust geometric model. Then, a modified genetic algorithm is applied on the generated surface to search for an optimum legal route schedule that satisfies the requirements of the vehicle's mission.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Simulation experiments show that the method is robust enough and can determine in a reasonable computation time a solution to VSP under consideration.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>There is a gap in the literature for methods that face VSP in shop\u2010floor environments. This paper contributes to filling this gap by implementing a practical method that can be easily programmed and included in a modern service delivery system.<\/jats:p><\/jats:sec>","DOI":"10.1108\/01439910910932630","type":"journal-article","created":{"date-parts":[[2009,2,28]],"date-time":"2009-02-28T07:03:18Z","timestamp":1235804598000},"page":"176-183","source":"Crossref","is-referenced-by-count":14,"title":["Vehicle scheduling in 2D shop floor environments"],"prefix":"10.1108","volume":"36","author":[{"given":"Elias K.","family":"Xidias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas C.","family":"Nearchou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos A.","family":"Aspragathos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022031120470884400_b18","doi-asserted-by":"crossref","unstructured":"Azariadis, P. and Aspragathos, N. (2005), \u201cObstacle representation by bump\u2010surfaces for optimal motion\u2010planning\u201d, Journal of Robotics and Autonomous Systems, Vol. 51 Nos 2\/3, pp. 129\u201050.","DOI":"10.1016\/j.robot.2004.11.001"},{"key":"key2022031120470884400_b4","doi-asserted-by":"crossref","unstructured":"Baker, E. (1983), \u201cAn exact algorithm for the time\u2010constrained travelling salesman problem\u201d, Operations Research, Vol. 31, pp. 938\u201045.","DOI":"10.1287\/opre.31.5.938"},{"key":"key2022031120470884400_b13","doi-asserted-by":"crossref","unstructured":"Barraquand, J., Langlois, B. and Latombe, J.C. (1991), \u201cNumerical potential field techniques for robot path planning\u201d, Proc. IEEE 5th Int. Conf. Advanced Robot., Pisa, Italy, pp. 1012\u201027.","DOI":"10.1109\/ICAR.1991.240539"},{"key":"key2022031120470884400_b16","unstructured":"Bemporad, A., Luca, A. and Oriolo, G. (1996), \u201cLocal incremental planning for a car\u2010like robot navigating among obstacles\u201d, IEEE International Conference on Robotics and Automation, Minneapolis, MN, pp. 1205\u201011."},{"key":"key2022031120470884400_b11","doi-asserted-by":"crossref","unstructured":"Divelbiss, A.W. and Wen, J.T. (1997), \u201cA path space approach to nonholonomic motion planning in the presence of obstacles\u201d, IEEE trans. on Robot. and Automat., Vol. 13 No. 3, pp. 443\u201051.","DOI":"10.1109\/70.585905"},{"key":"key2022031120470884400_b20","unstructured":"Goldberg, D.E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Addison\u2010Wesley Publishing Company, Reading, MA."},{"key":"key2022031120470884400_b1","unstructured":"Halme, A. and Koskinen, K. (1995), Intelligent Autonomous Vehicles, Elsevier Science & Technology, Amsterdam."},{"key":"key2022031120470884400_b7","doi-asserted-by":"crossref","unstructured":"Latombe, J.C. (1991), Robot Motion Planning, Kluwer Academic Publishers, Boston, MA.","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"key2022031120470884400_b21","unstructured":"Lipschutz, M.M. (1969), Differential Geometry, McGraw\u2010Hill, New York, NY."},{"key":"key2022031120470884400_b12","doi-asserted-by":"crossref","unstructured":"Nearchou, A.C. (1998), \u201cPath planning of a mobile robot using genetic heuristics\u201d, Robotica, Vol. 16, pp. 575\u201088.","DOI":"10.1017\/S0263574798000289"},{"key":"key2022031120470884400_b19","doi-asserted-by":"crossref","unstructured":"Piegl, L.A. and Tiller, W. (1997), The NURBS Book, Springer, Berlin.","DOI":"10.1007\/978-3-642-59223-2"},{"key":"key2022031120470884400_b9","doi-asserted-by":"crossref","unstructured":"Pruski, A. and Rohmer, S. (1997), \u201cRobust path planning for non\u2010holonomic robots\u201d, Journal of Intelligent and Robotic Systems, Vol. 18, pp. 329\u201050.","DOI":"10.1023\/A:1007937713460"},{"key":"key2022031120470884400_b3","doi-asserted-by":"crossref","unstructured":"Qiu, L., Hsu, W.J., Huamg, S.Y. and Wang, H. (2002), \u201cScheduling and routing algorithms for AGVs: a survey\u201d, Int. Journal of Production Research, Vol. 40, pp. 475\u2010760.","DOI":"10.1080\/00207540110091712"},{"key":"key2022031120470884400_b15","doi-asserted-by":"crossref","unstructured":"Rimon, E. and Koditschek, E. (1992), \u201cExact robot navigation using artificial potential functions\u201d, IEEE Trans. Robot. Automat., Vol. 8, pp. 501\u201018.","DOI":"10.1109\/70.163777"},{"key":"key2022031120470884400_b6","doi-asserted-by":"crossref","unstructured":"Solomon, M. (1987), \u201cAlgorithms for the vehicle routing and scheduling problem with time windows constraints\u201d, Operations Research, Vol. 35, pp. 254\u201065.","DOI":"10.1287\/opre.35.2.254"},{"key":"key2022031120470884400_b10","unstructured":"Song, G. and Amato, N.M. (2001), \u201cRandomized motion planning for car\u2010like robots with C\u2010PRM\u201d, Proc. 2001 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 37\u201042."},{"key":"key2022031120470884400_b5","doi-asserted-by":"crossref","unstructured":"Tsitsiklis, J.N. (1992), \u201cSpecial cases of travelling salesman and repairman problems with time windows\u201d, Networks, Vol. 22, pp. 263\u201082.","DOI":"10.1002\/net.3230220305"},{"key":"key2022031120470884400_b2","doi-asserted-by":"crossref","unstructured":"Vis Iris, F.A. (2006), \u201cSurvey of research in the design and control of automated guided vehicle systems\u201d, European Journal of Operational Research, Vol. 170, pp. 677\u2010709.","DOI":"10.1016\/j.ejor.2004.09.020"},{"key":"key2022031120470884400_b14","doi-asserted-by":"crossref","unstructured":"Volpe, R. and Kholsa, P. (1987), \u201cArtificial potential with elliptic isopotential contours for obstacle avoidance\u201d, 28th IEEE Conf. on Decision and Control, Los Angeles, CA, pp. 180\u20105.","DOI":"10.1109\/CDC.1987.272738"},{"key":"key2022031120470884400_b8","unstructured":"Vougioukas, S.G. (2005), \u201cOptimization of robots paths computed by randomized planners\u201d, Proc. IEEE Int. Conf. on Robot. Automat., Barcelona, Spain, pp. 2160\u20105."},{"key":"key2022031120470884400_b17","doi-asserted-by":"crossref","unstructured":"Xidias, E.K., Azariadis, P.N. and Aspragathos, N.A. (2007), \u201cTwo dimensional motion\u2010planning for nonholonomic robots using the bump\u2010surfaces concept\u201d, Journal of Computing, Vol. 79\/2, pp. 109\u201018.","DOI":"10.1007\/s00607-006-0190-2"}],"container-title":["Industrial Robot: An International Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/01439910910932630","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/01439910910932630\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/01439910910932630\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:50:24Z","timestamp":1753401024000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ir\/article\/36\/2\/176-183\/177631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,3,6]]}},"alternative-id":["10.1108\/01439910910932630"],"URL":"https:\/\/doi.org\/10.1108\/01439910910932630","relation":{},"ISSN":["0143-991X"],"issn-type":[{"type":"print","value":"0143-991X"}],"subject":[],"published":{"date-parts":[[2009,3,6]]}}}