Route Selection Decision-Making in an Intermodal Transport Network Using Game Theory

Traveling through a transport network, or ordering and delivering packets, involves fundamental decision-making processes which can be approached by game theory: Rather than simply choosing a route, individuals need to evaluate routes in the presence of the congestion resulting from the decisions ma...

Full description

Saved in:
Bibliographic Details
Published in:Sustainability Vol. 13; no. 8; p. 4443
Main Authors: Bukvic, Lucija, Pasagic Skrinjar, Jasmina, Abramovic, Borna, Zitricky, Vladislav
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.04.2021
Subjects:
ISSN:2071-1050, 2071-1050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Traveling through a transport network, or ordering and delivering packets, involves fundamental decision-making processes which can be approached by game theory: Rather than simply choosing a route, individuals need to evaluate routes in the presence of the congestion resulting from the decisions made by themselves and everyone else. In this paper, a game theory model for resolving route choices in transport network graphs is used. In the process of doing this, discovering a rather unexpected result known as Braess’s paradox, which shows that adding capacity to a network can sometimes actually cause congestion and an increase in transport costs. The decisions are made by non-cooperative players in a game theory environment known as prisoner’s dilemma. These methods are used to analyze routing problems by competing logistics operators on the transport network consisting of three Eastern Adriatic ports and an intermodal terminal in Budapest. The congestion game can be used in route selection regarding a decrease in transport costs for the carriers who are considered as rational players choosing the most sustainable solution.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2071-1050
2071-1050
DOI:10.3390/su13084443