Continuous Truck Delivery Scheduling and Execution System with Multiple Agents

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2413)


In this paper, we propose a practical method for solving the delivery-scheduling problem and discuss its implementation. The method is based on the cooperative problem solving with multiple agents. In the truck delivery scheduling method, the covered region is partitioned into multiple sub-regions and each sub-region is assigned a sub-problem solving agent. For integrating those sub-problem solving agents, an integration-and-evaluation agent solves the total problem. We also discuss the functions for building cooperative decision support system in a mobile environment in delivery scheduling domain. We consider a delivery center with function, i.e., generating and integrating delivery schedule, acquiring and managing the information shared commonly by all delivery persons, and dispatching the selected information to delivery persons, and the mobile terminal that a delivery person uses for exchanging information with the center. By employing the multi-agent problem solving framework for the delivery scheduling problem, we achieved an easy incorporation of various evaluation parameters in the process of scheduling, efficient use and management of scheduling knowledge of various levels.


Delivery Route Execution System Delivery Schedule Vehicle Rout Problem With Time Window Cooperative Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows, Technical Report IDSIA-06-99, IDSIA, Lugano, Switzerland, 1999.Google Scholar
  2. 2.
    Uchimura, K., Kanki, K.: A Method for Finding Round Trip Routes on Road Network Data, Transactions IEE Japan, Vol. 114-C, No. 4, 1994, 456–461Google Scholar
  3. 3.
    Niwa, H., Yoshida, Y., Fukumura, T.:Path Finding Algorithms Based on the Hierarchical Representation of a Road Map and Its Application to a Map Information System, Transactions of Information Processing Society of Japan,Vol31.,No. 5, 1990, 659–665Google Scholar
  4. 4.
    Wilkins, D.E., desJardins, M.: A Call for Knowledge-based Planning, AI Magazine, Spring 2001, Vol. 22, No. 1, 2001, 99–115.Google Scholar
  5. 5.
    Sycara, K.P., Roth, S.F., Sadeh, N. and Fox, M.S.: Resource Allocation in Distributed Factory Scheduling, IEEE Expert, Vol. 6, No. 1, 1991, 29–40CrossRefGoogle Scholar
  6. 6.
    Neiman, D.E., Hildum, D.W. and Lessor, V.R.: Exploiting Meta-Level Information in a Distributed Scheduling System, Proc. 12th Nat. Conf. On Artificial Intelligence, 1994, 394–400Google Scholar
  7. 7.
    Lau, H.C., Liang, Z.: Pickup and Delivery Problem with Time Windows, Algorithms and Test Case Generation, Proc. IEEE Conf. on Tools with Artificial Intelligence (ICTAI), 2001.Google Scholar
  8. 8.
    Fischer, K., Müller, J. P. and Pischel M.: A Model for Cooperative Transportation Scheduling, Proceedings of the 1st International Conference on Multiagent Systems (ICMAS’95), San Francisco, June, 1995.Google Scholar
  9. 9.
    Fischer, K. and Müller, J. P.: A Decision-Theoretic Model for Cooperative Transportation Scheduling, Agents Breaking Away, Proc. of the Seventh European Workshop on Modelling Autonomous Agents in a Multi-Agent World (MAAMAW’96), Eindhoven, The Netherlands, January 1996.Google Scholar
  10. 10.
    Sawamoto, J., Tsuji, H., Tokunaga, T., Koizumi, H.: A Proposal of Delivery Scheduling Method based on the Distributed Cooperative Problem Solving and its Implementation, Trans. IEE Japan, Vol. 117-C, No. 7, 1997, 896–906Google Scholar
  11. 11.
    Sawamoto, J., Ohta, Y., Tsuji, H., Koizumi, H.: A Proposal of a Method of Reactive Scheduling for the Delivery Scheduling Problem, Trans. IEE Japan, Vol. 122-C, No. 5, 2002, 832–842Google Scholar
  12. 12.
    Myers, K.L.: Towards a Framework for Continuous Planning and Execution, In Proceeding of the AAAI Fall Symposium on Distributed Continuous Planning, 1998.Google Scholar
  13. 13.
    Stentz, A.: The focused D* Algorithm for Real Time Replanning, Proc. of IJCAI-95, 1995, 1652–1659Google Scholar
  14. 14.
    Wong, D.: Concordia Java-based Mobile Agent Systems Framework, Mitsubishi Electric Technical Journal, March 2000.Google Scholar
  15. 15.
    Jain, A. K., Dubes, R. C.: Algorithms for Clustering Data, Prentice Hall, Englewood Cliffs, NJ, 1988.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  1. 1.Mitsubishi Electric CorporationKanagawaJapan
  2. 2.Tokai UniversityKanagawaJapan
  3. 3.Tokyo Denki UniversitySaitamaJapan

Personalised recommendations