Journal Search Engine

Volume/Issue :

Year(s) : to

Search :

Title :

Author :

Keyword :

Abstract :

Figure :

Table :

Reference :

ISSN : 2005-0461(Print)
ISSN : 2287-7975(Online)

Journal of Society of Korea Industrial and Systems Engineering Vol.13 No.21 pp.111-117
DOI :

Maximal-Flow-Problem with transit priority in a track

Received Finally Revised Accepted

Abstract

This paper treats the problem to schedule for train with low transit priority so as to maximizing the number that can be sent during given time without interfering with the fixed schedule for train with high transit priority in a track. We transform the this problem into Time-Expanded Network without traverse time through application of Ford-Fulkerson Model, develop a TENET GENerator(TENETGEN) and obtain the data of TENET using developed TENETGEN. Finally, we seek the optimal solution to these data with Dinic's Maximal-Flow Algorithm and examine the availability of our procedures in personal computer.

Key Words :

통과 우선순위가 있는 선로의 최대 흐름문제

이달상, 김만식

동의대학교 산업공학과, 한양대학교 산업공학과

초록

키워드 :

This article has been cited by 0 article in crossref

Cited-By

: SOGOBO_1990_v13n21_111.pdf220.0KB

Maximal-Flow-Problem with transit priority in a track

AbstractOther SectionsAbstract초록Reference

통과 우선순위가 있는 선로의 최대 흐름문제

초록Other SectionsAbstract초록Reference

ReferenceOther SectionsAbstract초록Reference

Abstract

초록

Reference