THE ALGORITHM OF NEGOTIATION OF MULTI AGENTS FOR PLANNING IN GEOGRAPHICALLY DISTRIBUTED LOGISTIC SUPPLY CHAINS

摘要

The purpose is to realize the negotiation algorithm for multi-agents[2] in stochastic condition using Monte- Carlo methods [3]. The negotiation is intended to support planning in geographically distributed supply chains and to create such schedule[1] that reduces usage of resources and coordinates actions of the logistics process participants. It is proposed to test negotiation algorithm to create production schedule for the model of geographically distributed supply chain, where processors are plants, distribution centres, retailers and node points of the route, but jobs are transport units. The main condition is indefinite and stochastic character of some supply chain parameters such as delivery time and demand. All the data for solution of the task have to be incorporated in a database, and appropriate programming languages and servers will be used for realization of algorithms using group decision support system. The main advantage of using the negotiation in supply chain is organizing a centralized control system for all system, which follows large reduction of costs concerned with idle time and unsatisfied demand.