Optimal lot-sizing algorithms for complex product structures
Operations Research
Statistical search methods for lotsizing problems
Annals of Operations Research - Special issue on Tabu search
Distributed rational decision making
Multiagent systems
Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence
Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
Optimal Mutation Rates in Genetic Search
Proceedings of the 5th International Conference on Genetic Algorithms
Using an Annealing Mediator to Solve the Prisoners' Dilemma in the Negotiation of Complex Contracts
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Vote elicitation: complexity and strategy-proofness
Eighteenth national conference on Artificial intelligence
Fairness measures for resource allocation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The Science and Engineering of E-Negotiation: An Introduction
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track1 - Volume 1
Supply Chain Coordination by Means of Automated Negotiations
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3
Communication complexity of common voting rules
Proceedings of the 6th ACM conference on Electronic commerce
Automated Contract Negotiation Using a Mediation Service
CEC '05 Proceedings of the Seventh IEEE International Conference on E-Commerce Technology
Protocols for Negotiating Complex Contracts
IEEE Intelligent Systems
Introduction to Computational Optimization Models for Production Planning in a Supply Chain
Introduction to Computational Optimization Models for Production Planning in a Supply Chain
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
Computers and Operations Research
An Ant Colony Optimization Approach for the Multi-Level Unconstrained Lot-Sizing Problem
HICSS '09 Proceedings of the 42nd Hawaii International Conference on System Sciences
A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
INFORMS Journal on Computing
Multi-issue negotiation protocol for agents: exploring nonlinear utility spaces
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The supply chain trading agent competition
Electronic Commerce Research and Applications
How to select fair improving directions in a negotiation model overcontinuous issues
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
| Hi-index | 0.00 |
A new generic mechanism to coordinate decentral planning of a group of independent and self-interested decision makers, who are searching for an agreeable contract regarding multiple interdependent issues, in the case of asymmetric information is presented. The basic idea of the mechanism is that the group members cooperatively carry out an evolutionary search in the contract space. Therefore the (1,驴)-selection procedure, which is used in many evolutionary strategies, is combined with the Borda maximin voting rule, which has been applied successfully in group decision making. The proposed mechanism is realized, applied and evaluated for production coordination in a supply chain. A decentralized variant of the multi-level uncapacitated lot-sizing problem (MLULSP) is taken as the production model. For the evaluation 95 problem instances are generated based on MLULSP instances taken from the literature, with problem sizes varying from 5 to 500 items, from 12 to 52 periods. Experimental results show that the proposed mechanism is effective to determine fair cost distributions.