Return to search

Building Multi-agent System to Solve Distributed Constraint Satisfaction Problems for Supply Chain Management

In this thesis, I propose an agent-based cooperative model for supply chains to commit orders by satisfying constraints. Due to the limitation of the real world environment, the centralized schedule model to handle constraint satisfaction is impractical, it is important to excise the distributed constraint satisfaction model to meet the outsourcing paradigm of supply chain management. I introduce a multi-agent system based coordination mechanism that integrates theories of negotiation and distributed constraint satisfaction problem to resolve the constraints in supply chain. I adopt the asynchronous weak-commitment search, a DCSP algorithm to resolve the global constraint in supply chain. Asynchronous weak-commitment search is complete backtracking algorithms that guarantee to find a solution if there is a solution existing and asynchronous weak-commitment search provide priority dynamic mechanism that help us to find a solution quickly than other backtracking algorithms. We construct a coordination agent for each business entity in supplier chain. The agent embedded in the ability to resolve the constraints autonomously. We expect this agent-based coordination mechanism can make supply chain more efficient and enhance supply chain's agility.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0709103-072330
Date09 July 2003
CreatorsLin, You-Yu
ContributorsChun-Fu Hou, Fu-Ren Lin, Chih-Ping Wei
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0709103-072330
Rightscampus_withheld, Copyright information available at source archive

Page generated in 0.0019 seconds