Bus Routes Planning Using a Graph Coloring Methodology

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27510%2F14%3A86092169" target="_blank" >RIV/61989100:27510/14:86092169 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Bus Routes Planning Using a Graph Coloring Methodology

Popis výsledku v původním jazyce

The Bus Routes Planning Problem (BRPP) is the problem of finding a set of routes that minimizes total traveling and delay times, while simultaneously satisfying the system's technical constraints. In this paper we use a directed weighted graph for planning bus routes in a public transportation network, which each node of this graph represents a street, and two distinct nodes are connected by a link if their equivalent streets are adjacent in the main network. A set of terminal nodes, where routes can start and end, traveling times of traversing through streets, delay times of street changings, and number of required routes are available. To solve this problem, we use a graph coloring methodology to formulate an integer programming problem. In the realworld problems, there are a large number of nodes and links and consequently solving the presented integer programming problem via the classic algorithms is out of reach. We use a genetic based search heuristic algorithm to tackle this is

Název v anglickém jazyce

Bus Routes Planning Using a Graph Coloring Methodology

Popis výsledku anglicky

The Bus Routes Planning Problem (BRPP) is the problem of finding a set of routes that minimizes total traveling and delay times, while simultaneously satisfying the system's technical constraints. In this paper we use a directed weighted graph for planning bus routes in a public transportation network, which each node of this graph represents a street, and two distinct nodes are connected by a link if their equivalent streets are adjacent in the main network. A set of terminal nodes, where routes can start and end, traveling times of traversing through streets, delay times of street changings, and number of required routes are available. To solve this problem, we use a graph coloring methodology to formulate an integer programming problem. In the realworld problems, there are a large number of nodes and links and consequently solving the presented integer programming problem via the classic algorithms is out of reach. We use a genetic based search heuristic algorithm to tackle this is

Druh

D - Stať ve sborníku

CEP obor

AE - Řízení, správa a administrativa

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

OPT-i 2014 - 1st International Conference on Engineering and Applied Sciences Optimization, Proceedings

ISBN

978-960-99994-6-5

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

2363-2369

Název nakladatele

National Technical University of Athens

Místo vydání

Sofia

Místo konání akce

Kos

Datum konání akce

4. 6. 2014

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—