Optimal path in an intelligent AGV-based manufacturing system

References

• Adem T and Mehmet Y. 2012. Dynamic path planning of mobile robots with improved genetic algorithm. Computers & Electrical Engineering, 38, pp.1564–72.
   Web of Science ®Google Scholar
• Bräysy O and Gendreau M. 2005a. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science, 39(1), pp.104–118.16.
   Web of Science ®Google Scholar
• Bräysy O and Gendreau M. 2005b. Vehicle routing problem with time windows, part II: metaheuristics. Transportation Science, 39(1), pp.119–39.
   Web of Science ®Google Scholar
• Campbell A and Savelsbergh M. 2004. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science, 38(3), pp.369–78.
   Web of Science ®Google Scholar
• Co CG and Tanchoco JMA. 1991. A review of research on AGVs vehicle management. Engineering Costs and Production Economics, 21, pp.35–42.
   Web of Science ®Google Scholar
• Conkur ES. 2005. Path planning using potential fields for highly redundant manipulators. Robotics and Autonomous Systems, 52, pp.209–228.
   Web of Science ®Google Scholar
• Cordeau J-F, Desaulniers G, Desrosiers J, Solomon M and Soumis F. 2002. VRP with time windows. In: Toth P and Vigo D, eds. The vehicle routing problem. SIAM monographs on discrete mathematics and applications, SIAM, Philadelphia, pp.157–93.
   Google Scholar
• Cordeau J-F, Gendreau M, Hertz A, Laporte G and Sormany J-S. 2004. New heuristics for the vehicle routing problem. Les cahiers du GERAD G-2004-33. Montréal, Canada: Université de Montréal HEC.
   Google Scholar
• Desaulniers G, Langevin A, Riopel D and Villeneuve B. 2003. Dispatching and conflict-free routing of automated guided vehicles: an exact approach. International Journal of Flexible Manufacturing Systems, 15, pp.309–331.
   Google Scholar
• Feillet D, Dejax P and Gendreau M. 2005. Traveling salesman problems with profits. Transportation Science, 39(2), pp.188–205.
   Web of Science ®Google Scholar
• Fleischmann B, Gnutzmann S and Sandvoß E. 2004. Dynamic vehicle routing based on on-line traffic information. Transportation Science, 38(4), pp.420–33.
   Web of Science ®Google Scholar
• Ganesharajah T, Hall NG and Sriskandarajah C. 1998. Design and operational issues in AGV-served manufacturing systems. Annals of Operations Research, 76, pp.109–154.
   Web of Science ®Google Scholar
• Hasle G. 2003. Heuristics for rich VRP models. In: Presented at the Seminar at GERAD, Montréal, Canada.
   Google Scholar
• Ho YC and Wu FC. 2002. A bidding-based control strategy for multiple-load automated guided vehicles. Journal of the Chinese Institute of Industrial Engineers, 19(4), pp.82–94.
   Google Scholar
• Kala R. 2012. Multi-robot path planning using co-evolutionary genetic programming. Expert Systems with Applications, 39, pp.3817–31.
   Web of Science ®Google Scholar
• King RE and Wilson C. 1991. A review of automated guided vehicle system design and scheduling. Production Planning & Control, 2, pp.44–51.
   Google Scholar
• Krishnamurthy NN, Batta R and Karwan MH. 1993. Developing conflict-free routes for automated guided vehicles in a flexible manufacturing system. Operations Research, 41, pp.1077–90.
   Web of Science ®Google Scholar
• Langevin A, Lauzon D and Riopel D. 1996. Dispatching, routing and scheduling of two automated guided vehicles in a flexible manufacturing system. International Journal of Flexible Manufacturing Systems, 8, pp.246–62.
   Google Scholar
• Laporte G and Semet F. 2002. Classical heuristics for the capacitated VRP. In: Toth P and Vigo D, eds., The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Philadelphia: Springer-Verlag, pp.109–128.
   Google Scholar
• Lee JH, Lee BH and Choi MH. 1998. A real-time traffic control scheme of multiple AGV systems for collision free minimum time motion: a routing table approach. IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans, 28, pp.347–58.
   Web of Science ®Google Scholar
• Lin JT, Wang FK and Young JR. 2004. Virtual vehicle in the connecting transport automated material-handling system (AMHS). International Journal of Production Research, 42(13), pp.2599–610.
   Web of Science ®Google Scholar
• Lin JT, Wu CK and Yang CJ. 2002. Vehicle management of AMHS in 300 MM wafer FAB. Journal of the Chinese Institute of Industrial Engineers, 19(4), pp.1–10.
   Google Scholar
• Mansoor D, Fatemeh P, Ali M and Seyed NH. 2013. Multiobjective path planning in discrete space. Applied Soft Computing, 13, pp.709–20.
   Web of Science ®Google Scholar
• Nagabhushan P and Manohara Pai MM. 2011. Cognition of free space for planning the shortest path: a framed free space approach. Pattern Recognition Letter, 22, pp.971–82.
   Web of Science ®Google Scholar
• Oboth C, Batta R and Karwan M. 1999. Dynamic conflict-free routing of automated guided vehicles. International Journal of Production Research, 37, pp.2003–2030.
   Web of Science ®Google Scholar
• Powell W, Snow W and Cheung R. 2000. Adaptive labeling algorithms for the dynamic assignment problem. Transportation Science, 34(1), pp.50–66.
   Web of Science ®Google Scholar
• Proc. 4th American National Conference on Artificial Intelligence, Austin, TX,1984, 318–321.
   Google Scholar
• Psaraftis H. 1995. Dynamic vehicle routing: status and prospects, Annals of Operations Research, 61, pp.143–64.
   Web of Science ®Google Scholar
• Psaraftis H. 1988. Dynamic vehicle routing problems. In: Golden B and Assad A, eds., Vehicle routing: methods and studies. Amsterdam, North-Holland, pp.233–48.
   Google Scholar
• Qiu L, Hsu W-J and Wang H. 2002. Scheduling and routing algorithms for AGVs: a survey. International Journal of Production Research, 40, pp.745–60.
   Web of Science ®Google Scholar
• Rajotia S, Shanker K and Batra JL. 1998. A semi-dynamic window constrained routing strategy in an AGV system. International Journal of Production Research, 36, pp.35–50.
   Web of Science ®Google Scholar
• Savelsbergh M and Sol M. 1995. The general pickup and delivery problem. Transportation Science, 29, (1), pp.17–30.
   Web of Science ®Google Scholar
• Savelsbergh M and Sol M. 1998. DRIVE: dynamic routing of independent vehicles. Operations Research, 46, pp.474–90.
   Web of Science ®Google Scholar
• Shital S, Chiddarwar N and Ramesh B. 2011. Conflict free coordinated path planning for multiple robots using a dynamic path modification sequence. Robotics and Autonomous Systems, 59, pp.508–18.
   Web of Science ®Google Scholar
• Tan G, HE H and Sloman A. 2007. Ant colony system algorithm for real-time globally optimal path planning of mobile robots. Acta Automatica Sinica, 33, pp.279–85.
   Google Scholar
• Thorpe CE. (1984). Path relaxation: path planning for a mobile robot. In: Proceedings of 4th national conf. on ‘artificial intelligence’, Austin, Tx, pp.318–21.
   Google Scholar
• Welzl E. 1985. Constructing the visibility graph for n-line segments in O(n2) time. Information Processing Letters, 20, pp.167–71.
   Web of Science ®Google Scholar
• Yang J, Jaillet P and Mahmassani H. 2004. Real-time multi-vehicle truckload pickup-and-delivery problems. Transportation Science, 38, (2), pp.135–48.
   Web of Science ®Google Scholar
• Zoumponos GT and Aspragathos NA. 2008. Fuzzy logic path planning for the robotic placement of fabrics on a work table. Robotics and Computer-Integrated Manufacturing, 24, pp.174–86.
   Web of Science ®Google Scholar