Distributed intelligent architecture for logistics (DIAL)

Goutam Satapathy, Soundar R.T. Kumara, Leah M. Moore

Research output: Contribution to journalArticle

16 Scopus citations

Abstract

An ideal logistics problem is considered as a network flow problem which generates a logistics plan and subsequently executes the plan. A real-world logistics plan is different from its ideal counterpart modeled as a network flow problem in the sense that each node of the logistics graph is operated independently with disparate objectives. In contrast to the nodes of a network flow problem, agents are considered as software entities which embody elegant reasoning ability to justify their own actions towards individual objectives, and also interact with other agents. Hence, a group of agents or a multiagent system is best suited to solve real-world logistics problems with each agent representing a node of the graph. We have built a three-tier framework where a customer's problem can be decomposed and assigned to all the agents which together generate a logistics plan. We employ two simulation software as planning tools which enable us to simulate appropriate events. The key ideas behind this paper are large-scale multiagent architectural modeling issues (scalability), computation task control, information sharing among several customers, and a problem solving procedure before the planning process. The problem solving procedure is considered as determining the computational tasks required to be invoked to initiate the planning process. We describe the implementation of the framework.

Original languageEnglish (US)
Pages (from-to)409-424
Number of pages16
JournalExpert Systems With Applications
Volume14
Issue number4
DOIs
StatePublished - Apr 1998

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Distributed intelligent architecture for logistics (DIAL)'. Together they form a unique fingerprint.

  • Cite this