Multi-agent System for Resource Allocation and Scheduling | SpringerLink
Skip to main content

Multi-agent System for Resource Allocation and Scheduling

  • Conference paper
  • First Online:
Multi-Agent Systems and Applications III (CEEMAS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2691))

Abstract

The paper considers multi agent approach and respective multi-agent system for resource allocation and scheduling within shipping logistics problem. A well known benchmark that is Vehicle Routing Problem with Time Windows is considered as a case study. The paper proposes an approach to the shipping logistics problem solving that includes auction-based resource allocation and scheduling, distributed reallocation algorithm and distributed version of the “look ahead” algorithm. The proposed approach is implemented and studied experimentally. The experimental results are outlined.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Becker, M. and S.F. Smith, "Mixed-Initiative Resource Management: The AMC Barrel Allocator", In Proceedings 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-2000), Breckenridge, CO, April, 2000.

    Google Scholar 

  2. A. Cesta, A. Oddi, and S. Smith. A Constraint-Based Method for Project Scheduling with Time Windows. Tech. Report CMU-RI-TR-00-34, Robotics Institute, Carnegie Mellon University, February, 2000.

    Google Scholar 

  3. W. Cook and J.L. Rich. A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problem with Time Windows. Technical Report TR99-04 Department of Computational & Applied Mathematics, Rice University, USA, http://www.isye.gatech.edu/~wcook/papers/vrptw.ps.

  4. R. Davis and R.G. Smith. Negotiation as a metaphor for distributed problem solving, Artif. Intell., vol.20, pp. 63–109, 1983.

    Article  Google Scholar 

  5. K. Fisher, B. Chaib-draa. A Simulation Approach Based on Negotiation and Cooperation Between Agents: A Case Study. In IEEE Transactions On Systems, Man, And Cybernetics—Part C: Applications And Reviews, Vol. 29, No.4, November 1999.

    Google Scholar 

  6. V. Gorodetski, O. Karsaev, I. Kotenko, A. Khabalov. Software Development Kit for Multi-agent Systems Design and Implementation. In B. Dunin-Keplicz, E. Navareski (Eds.), From Theory to Practice in Multi-agent Systems. Lecture Notes in Artificial Intelligence, Vol. # 2296, pp. 121–130, 2002.

    Google Scholar 

  7. Solomon. http://web.cba.neu.edu/~msolomon/problems.htm.

  8. W. Vickrey. Counter-speculation, auctions, and competitive sealed tenders, Journal of Finance, Vol. 16, No. 1, pp. 9–37, March 1961.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gorodetski, V., Karsaev, O., Konushy, V. (2003). Multi-agent System for Resource Allocation and Scheduling. In: Mařík, V., Pěchouček, M., Müller, J. (eds) Multi-Agent Systems and Applications III. CEEMAS 2003. Lecture Notes in Computer Science(), vol 2691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45023-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45023-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40450-7

  • Online ISBN: 978-3-540-45023-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics