{'fraction_non_alphanumeric': 0.01107011070110701, 'fraction_numerical': 0.0, 'mean_word_length': 5.910828025477707, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Interdependent order allocation in the two-echelon competitive and cooperative supply chain

In this paper, we consider an order allocation problem in a two-echelon supply chain with multiple suppliers and multiple demanders. The orders from the demanders are interdependent in terms of execution sequence. We consider both the competition and cooperation relationships between the suppliers and demanders. We provide formal definition for the order allocation problem and propose a negotiation mechanism which includes a two-stage negotiation protocol and two heuristic negotiation algorithms. Different negotiation strategies are proposed for the demanders and suppliers to resolve the order interdependency and competition conflict. An automated negotiation approach is introduced to implement the negotiation mechanism. The computational experiments show that orders under different supply chain contexts can be allocated with high success rate. We also numerically compare the influence of different negotiation strategies and investigate the interaction of conflict resolutions.