• Title/Summary/Keyword: travel cost function

Search Result 55, Processing Time 0.02 seconds

Forming of Metallic Bipolar Plates by Dynamic Loading (Dynamic Load를 이용한 박막 금속 분리판 성형기술)

  • Koo, J.Y.;Kang, C.G.
    • Transactions of Materials Processing
    • /
    • v.21 no.1
    • /
    • pp.5-12
    • /
    • 2012
  • The weight of the bipolar plate is one of the crucial aspects of improving power density in PEMFC stacks. Aluminum alloys have good mechanical properties such as density, electrical resistivity, and thermal conductivity. Furthermore, using aluminum in a bipolar plate instead of graphite reduces the bipolar plate cost and makes machining easier. Therefore in this study, an aluminum alloy was selected as the appropriate material for a bipolar plate. Results from feasibility experiments with the aim of developing fuel cells consisting of Al bipolar plates with multiple channels are presented. Dynamic loading was applied and the formability of micro channels was estimated as a function of punch pressure and die radius. Sheets of Al5052 with a thickness of 0.3mm were used. For a die radius of 0.1mm the formability was optimized with a sine wave dynamic load of 90kN at maximum pressure and 5 cycles of a sine wave punch travel. The experimental results demonstrate the feasibility of the proposed manufacturing technique for producing bipolar plates.

Network Design with Non-Linear Optimization Method (비선형(非線型) 최적화기법(最適化技法)에 의한 가로망설계(街路網設計))

  • Jang, Hyun Bong;Park, Chang Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.8 no.1
    • /
    • pp.165-172
    • /
    • 1988
  • An optimal network design method using continuous form of design variables is considered. Modified Hooke-and-Jeeves algorithm has been implemented in order to solve nonlinear progamming problem which is approximately equivalent to the real network design problem (NDP) with system. efficiency criteria(i. e. travel time and costs) and construction cost as objective function. Various forms of construction cost function, locations of initial solution, and dimension of initial step size of link improvement are taken into account to show the validity of this approach. The results obtained are quite promising in terms of the numbers of evaluations in solving NDP, and the speed of convergence. Finally, some techniques in choosing efficient intial solution, initial step size and approximation are given.

  • PDF

A Solution Algorithm for Elastic Demand Traffic Assignment Model Based on Dynamic Process (동적과정을 이용한 가변수요 통행배정모형의 알고리듬 개발)

  • Im, Yong-Taek;Kim, Hyeon-Myeong
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.2 s.88
    • /
    • pp.169-178
    • /
    • 2006
  • Traffic assignment has been used both for predicting travel demands and for evaluating the tools for alleviating congestion on road network in advance. Some assignment models have been proposed such as equivalent mathematical minimization method, variational inequality problem, nonlinear complementary problem and fixed point method, in following the principle of Wardrop (1952) that no driver can not Improve his travel cost by unilaterally changing his route. Recently Jin(2005a) presented a traffic assignment model based on dynamic process. This paper proposes a solution algorithm for the model of Jin and assesses the performances. Compared to the Frank-Wolfe method, which has been wildly used for solving the existing assignment models, the proposed algorithm is expected to be more efficient because it does not need to evaluate the objective function. Two numerical examples are used for assessing the algorithm, and they show that the algorithm converges to user equilibrium of Wardrop.

Technical Study on Possibility of an Express Service Wide Area Railway (광역철도 노선의 급행화 가능성에 대한 기술적 검토)

  • Park, Jung Hyun
    • Journal of the Korean Society for Railway
    • /
    • v.20 no.5
    • /
    • pp.612-624
    • /
    • 2017
  • As the existing metropolitan area metropolitan railway operates on a one-to-one basis, which leads to long travel times, its competitiveness with other means of transportation is deteriorating. Since there is a limit to attracting road traffic by rail, there is a continuing societal demand to expand express train service. Especially in the northern and the southwestern parts of the metropolitan area, a public transportation network system with express function, connecting to the city center of Seoul, is needed because of the social cost of the increase of traffic congestion and the increase of the travel time. The most efficient express service in Korea is Seoul Subway Line 9, which runs in 27 minutes from Gimpo Airport to the high speed terminal; this is a 40% shorter time compared to 44 minutes by car; the congestion in this area is up to 240%, so the preference for this train is quite high. The technical results of this study are expected to contribute to the implementation of an express service metropolitan railway.

Integer Programming Model to the Travelling Salesman Problems with Route Dependent Travel Cost (경로의존 이동 비용을 갖는 외판원 문제의 정수계획 모형)

  • Yu, Sung-Yeol
    • Management & Information Systems Review
    • /
    • v.29 no.4
    • /
    • pp.109-121
    • /
    • 2010
  • In this study, we propose a solution procedure to solve travelling salesman problem(TSP) with special cost function, route dependent travelling salesman problem(RDTSP). First, we develop an integer programming model to describe the problem. In the model, a variable means a possible route. And, the number of variables in this model are extremely large. So, we develop a LP relaxation problem of the IP model and solve the relaxation problem by a column generation technique. The relaxation problem does not guarantee the optimal solution. If we get an integer solution in the ralaxation problem, then the solution is an optimal one. But, if not, we cannot get an optimal solution. So, we approach a branch and price technique. The overall solution procedure can be applied a printed circuit board(PCB) assembly process.

  • PDF

Estimation of the Expressway Traffic Congestion Cost Using Vehicle Detection System Data (VDS 자료 기반 고속도로 교통혼잡비용 산정 방법론 연구)

  • Kim, Sang Gu;Yun, Ilsoo;Park, Jae Beom;Park, In Ki;Cheon, Seung Hoon;Kim, Kyung Hyun;Ahn, Hyun Kyung
    • International Journal of Highway Engineering
    • /
    • v.18 no.1
    • /
    • pp.99-107
    • /
    • 2016
  • PURPOSES : This study was initiated to estimate expressway traffic congestion costs by using Vehicle Detection System (VDS) data. METHODS : The overall methodology for estimating expressway traffic congestion costs is based on the methodology used in a study conducted by a study team from the Korea Transport Institute (KOTI). However, this study uses VDS data, including conzone speeds and volumes, instead of the volume delay function for estimating travel times. RESULTS : The expressway traffic congestion costs estimated in this study are generally lower than those observed in KOTI's method. The expressway lines that ranked highest for traffic congestion costs are the Seoul Ring Expressway, Gyeongbu Expressway, and the Youngdong Expressway. Those lines account for 64.54% of the entire expressway traffic congestion costs. In addition, this study estimates the daily traffic congestion costs. The traffic congestion cost on Saturdays is the highest. CONCLUSIONS : This study can be thought of as a new trial to estimate expressway traffic congestion costs by using actual traffic data collected from an entire expressway system in order to overcome the limitations of associated studies. In the future, the methodology for estimating traffic congestion cost is expected to be improved by utilizing associated big-data gathered from other ITS facilities and car navigation systems.

Solution Algorithms for Logit Stochastic User Equilibrium Assignment Model (확률적 로짓 통행배정모형의 해석 알고리듬)

  • 임용택
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.2
    • /
    • pp.95-105
    • /
    • 2003
  • Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.

Empirical Study on the Mode Choice Behavior of Travelers by Express Bus and Express Train (특급(特急)과 고속(高速)버스 이용자(利用者)의 수단선정행태(手段選定行態)에 관한 경험적(經驗的) 연구(研究))

  • Kim, Kyung Whan
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.3 no.2
    • /
    • pp.119-126
    • /
    • 1983
  • The purposes of this study are to analyze/model the mode choice behavior of the regional traveler by express bus/express train and to offer useful source in deciding the public transportation policy. The data analyzed were trips of both modes from March, 1980 to November, 1981, between Seoul and other nineteen cities; the data were grouped as five groups according to the change of service variables. Service variables were travel time(unit: minute), cost(:won), average allocation time(:won), service hour(:hour), and dummy variables by mode. As model Logit Model with linear or log utility function were postulated. As the result of this study, some reseanable models were constructed at Model Type I(eq. 2. of this paper) based on the above data except the dummy. It was judged that the parameters calibrated by Group III and Group IV data in table 4, were optimal. Among the parameters, the parameter of travel cost was most reliable. There was a tendency preferring express bus to train in October and November. With the constructed model and Pivot-Point Method. the demand change of express train caused by the service variables' change could be forecasted over 99%.

  • PDF

Development of A Network loading model for Dynamic traffic Assignment (동적 통행배정모형을 위한 교통류 부하모형의 개발)

  • 임강원
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.3
    • /
    • pp.149-158
    • /
    • 2002
  • For the purpose of preciously describing real time traffic pattern in urban road network, dynamic network loading(DNL) models able to simulate traffic behavior are required. A number of different methods are available, including macroscopic, microscopic dynamic network models, as well as analytical model. Equivalency minimization problem and Variation inequality problem are the analytical models, which include explicit mathematical travel cost function for describing traffic behaviors on the network. While microscopic simulation models move vehicles according to behavioral car-following and cell-transmission. However, DNL models embedding such travel time function have some limitations ; analytical model has lacking of describing traffic characteristics such as relations between flow and speed, between speed and density Microscopic simulation models are the most detailed and realistic, but they are difficult to calibrate and may not be the most practical tools for large-scale networks. To cope with such problems, this paper develops a new DNL model appropriate for dynamic traffic assignment(DTA), The model is combined with vertical queue model representing vehicles as vertical queues at the end of links. In order to compare and to assess the model, we use a contrived example network. From the numerical results, we found that the DNL model presented in the paper were able to describe traffic characteristics with reasonable amount of computing time. The model also showed good relationship between travel time and traffic flow and expressed the feature of backward turn at near capacity.

Analytical Determination of Optimal Transit Stop Spacing (최적 정류장 간격의 해석적 연구)

  • Park, Jun-Sik;Go, Seung-Yeong;Lee, Cheong-Won;Kim, Jeom-San
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.3
    • /
    • pp.145-154
    • /
    • 2007
  • Determining stop spacing is a very important process in transit system planning. This study is involved in an analytical approach to decide the transit stop spacing. Transit stop spacing should be longer as 1) user access speed, 2) user travel time, and 3) dwell time increase, and shorter as 1) passengers (boardings and alightings) and 2) headway increase. In this study, a methodology is proposed to determine transit stop spacing to minimize total cost (user cost plus operator cost) with irregular passenger distribution (boardings and alightings) Without considering in-vehicle passengers, the transit stop spacing should be shorter in the concentrated sections of the passenger distribution than in others to minimize total cost. Through the conceptual analysis, it is verified that the transit stop spacing could be longer as the in-vehicle passengers increase in certain sections. This study proposes a simple practical method to determine transit stop spacing and locations instead of a dynamic programming method which generally includes a complex and difficult calculation. If the space axis is changed to a time axis. the methodology of this study could be expanded to analyze a solution for the transit service (or headway) schedule problem.