Name
Abstract | ||
|---|---|---|
In this article, the problem of dynamic configuration of cooperative supply chain (CSC) as a dynamic, flexible and agile system is considered. Members of the CSC negotiate and compromise on the optimal configuration in a spirit of Cupertino, in order to meet commitments made to each other. Based on this framework, the proposed approach considers configuring as: (i) coalition formation and (ii) product and resource allocation tasks in multi-agent environment. To solve the configuring task, an application of different techniques of soft computing is examined. The first approach permits to find sub-optimal solution applying the theory of games with fuzzy coalitions. In this case, genetic algorithms (GA) are used to find solutions of the game. The second approach uses: (i) genetic algorithms directly and (ii) constraint satisfaction problem solving for resource allocation task. Ontologies codified as object oriented constraint networks are used for task description and decomposition. A multi-agent test-bed based on FIPA compliant agent platform is developed and used to conduct the experiments. The above techniques are compared and the simulation results are discussed. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.asoc.2003.10.001 | Applied Soft Computing |
Keywords | Field | DocType |
Configuration,Game with fuzzy coalitions,Constraint satisfaction,Genetic algorithm,Multi-agent system,Cooperative supply chain | Constraint satisfaction,Mathematical optimization,Object-oriented programming,Multi-agent system,Constraint satisfaction problem,Resource allocation,Supply chain,Soft computing,Genetic algorithm,Mathematics,Distributed computing | Journal |
Volume | Issue | ISSN |
4 | 1 | 1568-4946 |
Citations | PageRank | References |
19 | 1.61 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander V. Smirnov | 1 | 300 | 69.24 |
| Leonid Sheremetov | 2 | 198 | 28.37 |
| Nikolai Chilov | 3 | 126 | 14.13 |
| Jose Romero Cortes | 4 | 19 | 1.61 |