The kernel and shell structure as a tool for improving the graph of transportation connections

Barbara Mażbic-Kulma (), Jan W. Owsiński (), Krzysztof Sęp () and Jarosław Stańczak ()

Operations Research and Decisions, 2013, vol. 23, issue 2, 91-105

Abstract: A model of a transportation system is expected to be useful in simulations of a real system to solve given transportation tasks. A connection graph is routinely used to describe a transportation system. Vertices can be train stations, bus stops, airports etc. The edges show direct connections between vertices. A direct approach can be difficult and computational problems can arise in attempts to organize or optimize such a transportation system. Therefore, a method for aggregating such graphs was introduced, using a general kernel and shell structure and its particular instances: α-clique structured graphs of connections and a hub and spoke transformation of the source graph. These structures enable the concentration and ordering of transport between vertices and reduction of the analyzed graph. To obtain the desired structures, several versions of a specialized evolutionary algorithm were developed and applied.

Keywords: transport; connections graph; hub and spoke; kernel and shell; α-clique; genetic algorithm (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/1084%20-%20published.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wut:journl:v:2:y:2013:p:91-105:id:1084

DOI: 10.5277/ord130208

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().