Bus routes planning using a graph coloring methodology

Esmaiel Keshavarz, Mehdi Toloo

نتاج البحث

ملخص

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.

اللغة الأصليةEnglish
عنوان منشور المضيفOPT-i 2014 - 1st International Conference on Engineering and Applied Sciences Optimization, Proceedings
المحررونN. D. Lagaros, Matthew G. Karlaftis, M. Papadrakakis
ناشرNational Technical University of Athens
الصفحات2363-2369
عدد الصفحات7
رقم المعيار الدولي للكتب (الإلكتروني)9789609999465
حالة النشرPublished - 2014
منشور خارجيًانعم
الحدث1st International Conference on Engineering and Applied Sciences Optimization, OPT-i 2014 - Kos Island
المدة: يونيو ٤ ٢٠١٤يونيو ٦ ٢٠١٤

سلسلة المنشورات

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

Conference

Conference1st International Conference on Engineering and Applied Sciences Optimization, OPT-i 2014
الدولة/الإقليمGreece
المدينةKos Island
المدة٦/٤/١٤٦/٦/١٤

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1706???
  • ???subjectarea.asjc.1700.1712???
  • ???subjectarea.asjc.2200???

قم بذكر هذا