header
Image from OpenLibrary

Optimization models for skip-stop strategy in urban rail transit systems / Mohamed Raafat Mohamed Abdelaziz Salama ; Supervised Mohamed A. Shalaby , Ehab A. Abdelhafiez

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Mohamed Raafat Mohamed Abdelaziz Salama , 2017Description: 76 P. ; 30cmOther title:
  • نماذج الأمثلية لإستراتيجية تخطى المحطات فى أنظمة النقل الحضرى [Added title page title]
Subject(s): Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Mechanical Design and Production Summary: In urban rail transit (URT) systems, implementing a skip-stop strategy aims at minimizing the average passenger travel time; reducing energy consumption; and relieving in-vehicle congestion. This thesis contributes in building up a methodology for implementing the skip-stop strategy practically. A detailed description of the problem is first proposed. This description itemizes different scenarios, passenger trips categories, and key factors that should be considered in implementing this strategy. Following, a data set generator is proposed to develop a number of test problems. After that, two mathematical models are formulated. The first model is a pure integer quadratic programming Model with the objective of maximizing the number of direct trips at a given number of non-skipped stations. The second is a non-linear programming model that aims to minimize total travel time of passengers. A linearization is performed for both models to be solved as Integer-linear programming models. In addition, a new heuristic algorithm is proposed to be used with large scale problems. This algorithm is a hierarchy of three-stages, first the feasible solution space is to be defined, after that, a near-optimal solution is to be obtained through a smart process to be used as the initial solution, and finally a local search is conducted to find the optimal solution. The optimal arrangement of stations regarding number of direct trips is obtained. On the other hand, travel time optimality higher than 99% on average is accomplished. Finally, the effectiveness of the strategy in URT systems is interpreted through conducting design of experiments
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.13.M.Sc.2017.Mo.O (Browse shelf(Opens below)) Not for loan 01010110073635000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.13.M.Sc.2017.Mo.O (Browse shelf(Opens below)) 73635.CD Not for loan 01020110073635000

Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Mechanical Design and Production

In urban rail transit (URT) systems, implementing a skip-stop strategy aims at minimizing the average passenger travel time; reducing energy consumption; and relieving in-vehicle congestion. This thesis contributes in building up a methodology for implementing the skip-stop strategy practically. A detailed description of the problem is first proposed. This description itemizes different scenarios, passenger trips categories, and key factors that should be considered in implementing this strategy. Following, a data set generator is proposed to develop a number of test problems. After that, two mathematical models are formulated. The first model is a pure integer quadratic programming Model with the objective of maximizing the number of direct trips at a given number of non-skipped stations. The second is a non-linear programming model that aims to minimize total travel time of passengers. A linearization is performed for both models to be solved as Integer-linear programming models. In addition, a new heuristic algorithm is proposed to be used with large scale problems. This algorithm is a hierarchy of three-stages, first the feasible solution space is to be defined, after that, a near-optimal solution is to be obtained through a smart process to be used as the initial solution, and finally a local search is conducted to find the optimal solution. The optimal arrangement of stations regarding number of direct trips is obtained. On the other hand, travel time optimality higher than 99% on average is accomplished. Finally, the effectiveness of the strategy in URT systems is interpreted through conducting design of experiments

Issued also as CD

There are no comments on this title.

to post a comment.