All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Bus Routes Planning Using a Graph Coloring Methodology

The result's identifiers

  • Result code in 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>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Bus Routes Planning Using a Graph Coloring Methodology

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    AE - Management, administration and clerical work

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2014

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

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

  • ISBN

    978-960-99994-6-5

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    2363-2369

  • Publisher name

    National Technical University of Athens

  • Place of publication

    Sofia

  • Event location

    Kos

  • Event date

    Jun 4, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article