Abstract
The global transportation scheduling problem is complex, decentralised, open and dynamic. It typically requires the services of many transport organizations to transport partial quantities along partial routes to fulfill a transportation task. We have applied agents to address this problem. The Provisional Agreement Protocol (PAP) was developed to facilitate the planning required in our transportation problem. A greedy PAP approach has been implemented for the complex global transportation problem, allowing partial quantity and route bids, and backtracking if an infeasible solution is encountered. In this paper, we present the PAP, together with some improvements over that which has been previously presented. Further implementation details and formal evaluation are provided. Our implementation allows a wider range of transportation problems to be solved than previous approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Perugini, D., et al. Agents for Military Logistic Planning. in Workshop “Agent Technology in Logistics” as part of the 15th European Conference on Artificial Intelligence (ECAI-2002). 2002. Lyon, France.
Perugini, D., et al. Agents in Logistics — Experiences with the Coalition Agents Experiment Project. in Proceedings of the International Workshop “Agents at work”, held in conjunction with the Second International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS03). 2003. Melbourne, Australia.
Perugini, D., et al. Distributed Information Fusion Agents. in Proceedings of the 6th International Conference on Information Fusion. 2003. Cairns, Australia.
Perugini, D., et al. A Distributed Agent Approach to Global Transportation Scheduling. in IEEE/WIC International Conference on Intelligent Agent Technology (IAT 2003). 2003. Halifax, Canada.
Fischer, K., J.P. Muller, and M. Pischel, Cooperative transportation scheduling: an application domain for DAI. Applied Artificial Intelligence, 1996. 10(1): p. 1–33.
Dean, T. and L. Greenwald, Package Routing in Transportation Networks with Fixed Vehicle Schedules: Formulation, Complexity Results and Approximation Algorithms: Technical Report CS-92-26. 1992, Department of Computer Science, Brown University.
Dean, T. and L. Greenwald, A Formal Description of the Transportation Problem: Technical Report CS-92-14. 1992, Department of Computer Science, Brown University.
Russell, S. and P. Norvig, Artificial Intelligence: A Modem Approach. 1995: Prentice-Hall International.
Perugini, D., et al. Agent-Based Transport Scheduling in Military Logistics. in Third International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’04). 2004. New York, U.S.A.
Lambert, D. Automating Cognitive Routines. in Proceedings of the 6th International Conference on Information Fusion. 2003. Cairns, Australia.
Kettler, B.P.e., The CoABS Grid: Technical Vision, http://coabs.globalinfotek.com/.
Smith, R.G., The contract net protocol: high level communication and control in a distributed problem solver. IEEE Transactions on Computers, 1980. C-29(12): p. 1104–13.
Sandholm, T. and V. Lesser, Leveled Commitment Contracting: A Backtracking Instrument for Multiagent Systems. AI Magazine, 2002. 23(3): p. 89–100.
Sandholm, T.W. and V.R. Lesser, Advantages of a leveled commitment contracting protocol, in Proceedings of the Thirteenth National Conference on Artificial Intelligence 1996, pp. 126–33 vol. 1.
Kraus, S., O. Shehory, and G. Taase. Coalition Formation with Uncertain Heterogeneous Information. in Proceedings of The Second International Joint Conference on Autonomous Agents and Multi-Agent Systems. 2003. Melbourne, Australia.
Sandholm, T.W. and V.R. Lesser, Coalitions among computationally bounded agents. Artificial Intelligence, 1997. 94(1–2): p. 99–137.
Rosenschein, J.S. and G. Zlotkin, Rules of Encounter: Designing Conventions for Automated Negotiation among Computers. 1994: The MIT Press. 231.
Dang, V.D. and N.R. Jennings. Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions. in Proc. 15th European Conf. on AI (ECAI-2002). 2002. Lyon, France.
Walsh, W.E., M.P. Wellman, and F. Ygge. Combinatorial Auctions for Supply Chain Formation. in Second ACM Conference on Electronic Commerce. 2000.
Gonen, R. and D. Lehmann, Optimal Solutions for Multi-Unit Combinatory Auctions: Branch and Bound Heuristics. EC, 2000: p. 13–20.
Leyton-Brown, K., Y. Shoham, and M. Tennenholtz, An Algorithm for Multi-Unit Combinatory Auctions. AAAI, 2000: p. 56–61.
Nisan, N., Bidding and Allocation in Combinatory Auctions. EC, 2000: p. 1–12.
Sandholm, T. and S. Suri. Market Clearability. in IJCAI. 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Birkhäuser Verlag
About this paper
Cite this paper
Perugini, D., Lambert, D., Sterling, L., Pearce, A. (2005). Provisional Agreement Protocol for Global Transportation Scheduling. In: Klügl, F., Bazzan, A., Ossowski, S. (eds) Applications of Agent Technology in Traffic and Transportation. Whitestein Series in Software Agent Technologies. Birkhäuser Basel. https://doi.org/10.1007/3-7643-7363-6_2
Download citation
DOI: https://doi.org/10.1007/3-7643-7363-6_2
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7258-3
Online ISBN: 978-3-7643-7363-4
eBook Packages: Computer ScienceComputer Science (R0)