@inproceedings{b052b04145ef4fdf97c8cca832fb9cba,
title = "Bus routes planning using a graph coloring methodology",
abstract = "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 real world 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 issue.",
keywords = "Bus routes planning, Graph coloring, Heuristic algorithm, Integer programming, Terminal nodes, Weighted graph",
author = "Esmaiel Keshavarz and Mehdi Toloo",
year = "2014",
language = "English",
series = "OPT-i 2014 - 1st International Conference on Engineering and Applied Sciences Optimization, Proceedings",
publisher = "National Technical University of Athens",
pages = "2363--2369",
editor = "Lagaros, {N. D.} and Karlaftis, {Matthew G.} and M. Papadrakakis",
booktitle = "OPT-i 2014 - 1st International Conference on Engineering and Applied Sciences Optimization, Proceedings",
note = "1st International Conference on Engineering and Applied Sciences Optimization, OPT-i 2014 ; Conference date: 04-06-2014 Through 06-06-2014",
}