Showing 1 - 10 of 1,088
Persistent link: https://www.econbiz.de/10011372477
Supply chains for goods that must be kept cool-cold chains-are of increasing importance in world trade. The goods must be kept within well-defined temperature limits to preserve their quality. One technique for reducing logistics costs is to load cold items into multiple compartment vehicles...
Persistent link: https://www.econbiz.de/10011849519
Persistent link: https://www.econbiz.de/10011492154
The purpose of this paper is to introduce a novel family of games related to congested networks. Traffic routing has been extensively analyzed from the non-cooperative aspect. A common assumption is that each individual optimizes his route in the network selfishly. However looking at the same...
Persistent link: https://www.econbiz.de/10010494546
The purpose of this paper is to introduce a novel family of games related to congested networks. Traffic routing has been extensively analyzed from the non-cooperative aspect. A common assumption is that each individual optimizes his route in the network selfishly. However looking at the same...
Persistent link: https://www.econbiz.de/10009719701
Local routing protocols in scale free networks have been extensively studied. In this paper we consider a wireless contextualization of this routing problem and analyze on the one hand how cooperation affects network efficiency, and on the other hand the stability of cooperation structures....
Persistent link: https://www.econbiz.de/10010367386
A Chinese postman (CP) game is induced by a a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location. Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes this...
Persistent link: https://www.econbiz.de/10013088117
This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a...
Persistent link: https://www.econbiz.de/10013088121
The traveling salesman problem and its variants are among the most studied problems in the literature on transportation and logistics. In one of these variants known as the profitable tour problem [2], a profit-maximizing carrier decides whether to visit a particular customer with respect to the...
Persistent link: https://www.econbiz.de/10012858891
A repairman makes a round-trip along a set of customers. He starts in his home location, visits each customer exactly once, and returns home. The cost of his trip has to be shared by the customers. A cooperative cost game, called routing game, is associated with this allocation problem, and an...
Persistent link: https://www.econbiz.de/10014060694