Please use this identifier to cite or link to this item:
Title: Model for simultaneous routing and scheduling using genetic alghoritm
Authors: Gundaliya, P.J.
Shrivastava, Prabhat
Dhingra, P.L.
Issue Date: 2000
Publisher: EUT Edizioni Università di Trieste
ISTIEE Istituto per lo studio dei trasporti nell’integrazione economica
Source: P.J. Gundaliya, Prabhat Shrivastava, P.L: Dhingra, "Model for simultaneous routing and scheduling using genetic alghoritm", in: European Transport / Trasporti Europei, VI (2000) 16, pp. 10-19
Series/Report no.: European Transport / Trasporti Europei
VI (2000) 16
The design of bus routes and setting frequencies on these routes are two basic decision elements that critically determine public transport system performance. Various attempts are made to solve this type of combinatorial optimisation problem involving non- linearity, non- convexity with multiple objective functions but in most of the approaches design of routes and schedules are dealt separately though they are complementary to each other. In this study a model is developed for simultaneous routing and scheduling using a robust optimization technique namely Genetic Algorithm (GA). For this model objective function is minimisation of the sum of user and operator costs. User cost is taken as combination of in-vehicle travel time, waiting time and transfer time where as operator cost is vehicle operating cost of buses. Constraints are related to load factor, fleet size and overloading of links. The model is tested for Mandl's Swiss Transit Network and Demand Matrix. It is found that the developed model gives the better-optimised values over other existing results for the same network and demand matrix.
Type: Article
Appears in Collections:European Transport / Trasporti Europei (2000) 16/VI

Files in This Item:
File Description SizeFormat
Gundaliya_ET16.pdf4.24 MBAdobe PDFThumbnail
Show full item record

CORE Recommender

Page view(s) 20

checked on Jul 6, 2022

Download(s) 20

checked on Jul 6, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.