Skip to main content

Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming

  • Conference paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)

Abstract

This paper reports on the on-going development of a hybrid approach for dispatching and conflict-free routing of automated guided vehicles used for material handling in manufacturing. The approach combines Constraint Programming for scheduling and Mixed Integer Programming for routing without conflict. The objective of this work is to provide a reliable method for solving instances with a large number of vehicles. The proposed approach can also be used heuristically to obtain very good solution quickly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Desaulniers, G., Langevin, A., Riopel, D.: Dispatching and conflict-free routing of automated guided vehicles: an exact approach. International Journal of FlexibleManufacturing Systems (2003) (to appear)

    Google Scholar 

  2. Krishnamurthy, N.N., Batta, R., Karwan, M.H.: Developing Conflict-free Routes for Automated Guided Vehicles. Operations Research 41(6), 1077–1090 (1993)

    Article  MATH  Google Scholar 

  3. Langevin, A., Lauzon, D., Riopel, D.: Dispatching, routing and scheduling of two automated guided vehicles in a flexible manufacturing system. International Journal ofFlexible manufacturing Systems 8, 246–262 (1996)

    Google Scholar 

  4. Qiu, L., Hsu, W.-J., Huang, S.-Y., Wang, H.: Scheduling and routing algorithms for Agvs: a survey. International Journal of Production Research 40(3), 745–760 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corréa, A.I., Langevin, A., Rousseau, L.M. (2004). Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24664-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21836-4

  • Online ISBN: 978-3-540-24664-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics