Cooperative transportation scheduling: an application domain for dai

Applied Artificial Intelligence

Volumn 10, Issue 1, 1996, Pages 1-34

  Fischer, Klaus ^a   Müller, Jörg P ^a   Pischel, Markus ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FREIGHT TRANSPORTATION; NETWORK PROTOCOLS; OPERATIONS RESEARCH; OPTIMIZATION; PLANNING; RESOURCE ALLOCATION; SCHEDULING;

COOPERATIVE TRANSPORTATION SCHEDULING; DISTRIBUTED ARTIFICIAL INTELLIGENCE; DYNAMIC REPLANNING; SCHEDULE OPTIMIZATION; TASK ALLOCATION; TASK DECOMPOSITION;

ARTIFICIAL INTELLIGENCE;

EID: 0029735287     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/088395196118669     Document Type: Article

References (50)

1. Bachem, A., W. Hochstättler, and M. Malich. 1992. Simulated trading: A new approach for solving vehicle routing problems. Mathematisches Institut der Universität zu Köln, Technical Report 92.125.
2. Bachem, A., W. Hochstättler, and M. Malich. 1993. The simulated trading heuristic for solving vehicle routing problems. Mathematisches Institut der Universität zu Köln, Technical Report 93.139.
3. Bagchi, P., and B. Nag. 1991. Dynamic vehicle scheduling: An expert system approach. Journal of Physical Distribution and Logistics Management 21(2).
4. Bargl, M. 1992. Tourenplanung in der Transportwirtschaft-viel gelobt, selten genutzt? Logistik im Unter-nehmen 6(6).
5. Boddy, M., and T. Dean. 1988. An analysis of time-dependent planning. In Proc. of the 7 th national conference on artificial intelligence, pp. 49-54.
6. Boddy, M., and T. L. Dean. 1994. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence 67: 245-285.
7. Bodin, L., B. Golden, A. Assad, and M. Ball. 1983. Routing and Scheduling Of Vehicles and Crews. Computers and Operations Research 10(2): 63-211.
8. Bond, A., and L. Gasser. 1988. Readings in distributed artificial intelligence. Los Angeles, Calif.: Morgan Kaufmann.
9. Brooks, R. A. 1986. A robust layered control system fora mobile robot. IEEE Journal of Robotics and Automation RA-2(1).
10. Chaib-Draa, B., B. Moulin, R. Mandiau, and P. Millot. 1992. Trends In Distributed Artificial Intelligence. Artificial Intelligence Review 1 (6): 35-66.
11. Cohen, P. R., M. L. Greenburg, D. M. Hart, and A. E. Howe. 1989. Trial by fire: Understanding the design requirements for agents in complex environments. AI Magazine 10(3).
12. Davis, R., R. G. Smith. 1983. Negotiation as a metaphor for distributed problem solving. Artificial Intelligence 20: 63-109.
13. Decker, K., and V. R. Lesser. 1994. Designing a family of coord inationalgorithms. In Proc. of the 13 th international workshop on distributed artificial intelligence, pp. 65-84.
14. Desrochers, M., and M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40(2).
15. Ephrati, E., and J. Rosenschein. 1993. Multi-agent planning as a dynamic search for social consensus. In Proc. of IJCAI'93, pp. 423-429. San Mateo, Calif.: Morgan Kaufmann.
16. Falk, J., S. Spieck, and P. Mertens. 1993. Unterstützung der Lager-und Transportlogistik durch Teilintelligente Argenten. Information Management 2.
17. Ferguson, I. A. 1992. TouringMachines: An architecture for dynamic, rational, mobile agents. Ph.D. thesis, Computer Laboratory, University of Cambridge, Cambridge, England.
18. Firby, R. J. 1992. Building symbolic primitives with continuous control routines. In J. Hendler (ed.), Proc. of the first international conference on AI planning systems. San Mateo, Calif.: Morgan Kaufmann.
19. Fischer, K. 1993. The rule-based multi-agent system MAGSY. In Proc. of the CKBS'92 Workshop.
20. Fischer, K. 1994. Decision theoretic analysis of the transportation domain. In Working notes of the ECAI'94 workshop: Decision theory for DAI applications.
21. Fischer, K., and N. Kuhn. 1993. A DAI approach to modelingthe transportation domain. DFKI, Technical Report RR-93-25.
22. Fischer, K., N. Kulm, H. J. Müller, J. P. Müller, and M. Pischel. 1993. Sophisticated and distributed: The transportation domain. In Proc. ofMAAMAW-93, Fifth European workshop on modelling autonomous agents in a multi-agent world.
23. Fischer, K., N. Kuhn, and J. P. Müller. 1994. Distributed, knowledge-based, reactive scheduling in the transportation domain. In Proc. of the Tenth IEEE conference on artificial intelligence and applications.
24. Fischer, K., J. P. Müller, and M. Pischel. 1996. Agenda: A general testbed for DAI applications. In N. R. Jennings and G. M. P. O'Hare (eds.), Foundations of Distributed Artificial Intelligence. Sixth Generation Computer Technology Series. New York: John Wiley & Sons.
25. Florian, M. 1993. Highway Helden in Not. Ein Beitrag zum Verständnis der sozialen Reproduktion arbeits-und berufsbedingter Risiken von Fernfahrern. Ph.D. thesis, Universität Münster.
26. Garey, M. R., and D. S. Johnson. 1979. Computers and intractability: A guide tu the theory of NP-completeness. New York: W. H. Freeman.
27. Georgeff, M. P., and A. L. Lansky. 1986. Procedural knowledge. In IEEE Special Issue on Knowledge Representation! 4: 1383-1398.
28. Golden, B., and A. Assad. 1983. Vehicle routing: Methods and studies. In Studies in management science and systems. New York: North-Holland.
29. Haddawy, P., and S. Hanks. 1990. Issues in decision-theoretic planning: Symbolic goals and numeric utilities. In Proc. of the DARPA workshop on innovative approaches to planning, scheduling, and control. San Mateo, Calif.: Morgan Kaufmann.
30. Hanks, S., M. E. Pollack, and P. R. Cohen. 1993. Benchmarks, test beds, controlled experimentation, and the design of agent architectures. AI Magazine (Winter): 17-42.
31. Kinny, D., M. Ljungberg, A. Rao, E. Sonenberg, G. Tidhar, and E. Werner. 1992. Planned team activity. In A. Cesta, R. Conte, and M. Miceli (eds.), Pre-Proceedings of MAAMAW’92.
32. Kuhn, N., H. J. M tiller, and J. P. Müller. 1993a. Simulating cooperative transportation companies. In Proc. of the European simulation muIticonference (ES M-93). San Diego: Society for Computer Simulation.
33. Kuhn, N., H. J. Müller, and J. P. Müller. 1993b. Task decomposition in dynamic agent societies. In Proc. of the International symposium on autonomous decentralized systems (ISADS-93). New York: IEEE Computer Society Press.
34. Kushmerick, N., S. Hanks, and D. Weld. 1993. An algorithm for probabilistic planning. Department of Computer Science, University of Washington, Technical Report 93-06-03.
35. Latombe, J. P. 1992. How to move (physically speaking) in a multi-agent world. In Y. Demazeau and E. Werner (eds.), Decentralized A.I. 3. New York: North-Holland.
36. Lyons, D. M., and A. J. Hendriks. 1992. A practical approach to integrating reaction and deliberation. In Proc. of the 1st international conference on AI planning systems (AIPS), pp. 153-162. San Mateo, Calif.: Morgan Kaufmann.
37. McDermott, D. 1991. Robot planning. Department of Computer Science, Yale University, Technical Report 861.
38. Müller, J. P. 1994. Evaluation of plans for multiple agents (preliminary report). In K. Fischerand G. M. P. O’Hare (eds.), Proc. of the EC AI workshop on decision theory for DAI applications.
39. Müller, J. P., and M. Pischel. 1994b. An architecture for dynamically interacting agents. International Journal of Intelligent and Cooperative Information Systems (IJICIS) 3(1): 25-45.
40. Müller, J. P., and M. Pischel. 1994b. Integrating agent interaction into a planner-reactor architecture. In M. Klein (ed.), Proc. of the 13 th international workshop on distributed artificial intelligence.
41. Preissner-Polte, A. 1993. Funk-Verkehr. Manager Magazin 5.
42. Psaraftis, H. 1988. Dynamic vehicle routing problems. In Vehicle routing: Methods and studies. New York: North-Holland.
43. Rao, A. S., and M. P. Georgeff. 1991. Modeling agents within a BDI-architecture. In R. Fikes and E. Sandewall (eds.), Proc. of the 2nd International conference on principles of knowledge representation and reasoning (KR'91). San Mateo, Calif.: Morgan Kaufmann.
44. Rittmann, R. 1991. Die Macht der Trucks. Bild der Wissenschaft 9:112-119.
45. Rosenschein, J. S., and G. Zlotkin. 1994. Rules of encounter: Designing conventions for automated negotiation among computers. Cambridge, Mass.: MIT Press.
46. Russell, S. J., and S. Zilberstein. 1991. Composing real-time systems. In Proc. of IJC AI-9I. pp. 212-217. San Mateo, Calif.: Morgan Kaufmann.
47. Russell, S. J., and S. Zilberstein. 1993. Anytime sensing, planning, and action: A practical model for robot control. In Proc. of IJC AI'93, pp. 1402-1407. San Mateo, Calif.: Morgan Kaufmann.
48. Schulte, C., G. Smolka, and J. Würtz. 1994. Encapsulated search and constraint programming in Oz. In Second workshop on principles and practice of constraint programming, pp. 116-129.
49. Wellman, M. P. 1992. A general-equilibrium approach to distributed transportation planning. In Proc. of AAAI-92, pp. 282-290.
50. Zlotkin, G., and J. S. Rosenschein. 1993. A domain theory for task-oriented negotiation. In Proc. of the 13th international joint conference on artificial intelligence, vol. 1.