Organisations (de-)centralised to a greater or lesser degree for allocating cities in two Multiple Travelling Salesmen Problems

03/10/2022
by   Thierry Moyaux, et al.
0

Decisions in organisations may be made either by a Central Authority (CA), e.g., in a hierarchy, or by the agents in a decentralised way, e.g., in a heterarchy. Since both kinds of organisations have their advantages (e.g., optimality for centralised organisations and reactivity for decentralised ones), our goal is ultimately to understand when and how to use each of them. Our previous work proposed a variant of the Multiple Travelling Salesmen Problem, which we now call MTSPs . We use the subscript "s" to refer to salesmen's selfishness when they minimise their individual route length. If, on the contrary, they are assumed to be benevolent, we add subscript "b" and thus the term MTSPb to refer to the traditional MTSP in which the salesmen minimise the total route length. This article shows how to obtain such benevolent agents by slightly modifying selfish agents. We can then compare organisations which are (de-)centralised to a greater or lesser degree, which enables us to carry out the allocation of cities in the MTSPb . The first experiment shows that the relative efficiency (ranking) of the organisations differs between MTSPb and MTSPs . Since reactivity fosters decentralisation, the second experiment gradually reduces the time taken for it to impact this ranking. Both experiments show that pure centralisation is either the best or the worst option, and that the zone between the two situations is very narrow.

READ FULL TEXT

page 11

page 13

research
11/15/2018

Cost of selfishness in the allocation of cities in the Multiple Travelling Salesmen Problem

The decision to centralise or decentralise human organisations requires ...
research
07/06/2009

Apply Local Clustering Method to Improve the Running Speed of Ant Colony Optimization

Ant Colony Optimization (ACO) has time complexity O(t*m*N*N), and its ty...
research
05/21/2021

Verification of Multi-Layered Assignment Problems

The class of assignment problems is a fundamental and well-studied class...
research
09/09/2021

DAN: Decentralized Attention-based Neural Network to Solve the MinMax Multiple Traveling Salesman Problem

The multiple traveling salesman problem (mTSP) is a well-known NP-hard p...
research
08/24/2020

A Strategic Routing Framework and Algorithms for Computing Alternative Paths

Traditional navigation services find the fastest route for a single driv...
research
06/13/2019

Decentralised Multi-Demic Evolutionary Approach to the Dynamic Multi-Agent Travelling Salesman Problem

The Travelling Salesman and its variations are some of the most well kno...

Please sign up or login with your details

Forgot password? Click here to reset