• Title/Summary/Keyword: Transportation Problem

Search Result 1,322, Processing Time 0.027 seconds

Budget Estimation Problem for Capacity Enhancement based on Various Performance Criteria (다중 평가지표에 기반한 도로용량 증대 소요예산 추정)

  • Kim, Ju-Young;Lee, Sang-Min;Cho, Chong-Suk
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.175-184
    • /
    • 2008
  • Uncertainties are unavoidable in engineering applications. In this paper we propose an alpha reliable multi-variable network design problem under demand uncertainty. In order to decide the optimal capacity enhancement, three performance measures based on 3E(Efficiency, Equity, and Environmental) are considered. The objective is to minimize the total budget required to satisfy alpha reliability constraint of total travel time, equity ratio, and total emission, while considering the route choice behavior of network users. The problem is formulated as the chance-constrained model for application of alpha confidence level and solved as a lexicographic optimization problem to consider the multi-variable. A simulation-based genetic algorithm procedure is developed to solve this complex network design problem(NDP). A simple numerical example ispresented to illustrate the features of the proposed NDP model.

The Impacts of the Traffic Demand Management Policies across the Different Income Classes in Seoul (교통수요관리정책의 소득계층별 효과 분석)

  • 이번송;이의섭
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.1
    • /
    • pp.7-27
    • /
    • 1996
  • It is very costly to construct transportation facilities such as roads, bridges, tunnels, and public parking lots mainly because land price is very high in metropolis like Seoul. Private car oweners use these facilities more extensively than public transportation users. However, the government does not impose proper charges for using these facilities. Such improper charge causes traffic congestion and then decreases social welfare in efficiency and equity. To solve problem, many traffic demand management policies are used. Traffic management policies which are currently used or under consideration by the City Government of Seoul include the imposition of road tolls, increase of parking fees in public parking lots, increase of gasoline taxes, expanded implementation of bus only lanes, and shippujae, which requires one(1) non-driving day for 10 calendar days. This study examined the impacts of such policies on the different income classes using simulation analysis. We found that the impacts of market-oriented policies such as the imposition of road tolls and the increase of gasoline taxes is regressive. Also, we found that while the low and middle income private car users have incentive have incentive for public transportation use, the high income private car users have no incentive for public transportation use in many cases.

  • PDF

Transporter Scheduling Based on a Network Flow Model for Dynamic Block Transportation Environment (동적 블록수송환경을 위한 네트워크 흐름모형 기반의 트랜스포터 일정계획)

  • Lee, Woon-Seek;Lim, Won-Il;Koo, Pyung-Hoi
    • IE interfaces
    • /
    • v.22 no.1
    • /
    • pp.63-72
    • /
    • 2009
  • This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

A Model for Detecting Braess Paradox in General Transportation Networks (일반 교통망에서 브라이스 역설 발견 모형)

  • Park, Koo-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.4
    • /
    • pp.19-35
    • /
    • 2007
  • This study is for detecting the Braess Paradox by stable dynamics in general transportation networks. Stable dynamics, suggested by Nesterov and de Palma[18], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model based on link latency function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. The phenomenon that increasing capacity of a network, for example creating new links, may decrease its performance is called Braess Paradox. It has been studied intensively under user equilibrium model with link latency function since Braess[5] demonstrated a paradoxical example. However it is an open problem to detect the Braess Paradox under stable dynamics. In this study, we suggest a method to detect the Paradox in general networks under stable dynamics. In our model, we decide whether Braess Paradox will occur in a given network. We also find Braess links or Braess crosses if a network permits the paradox. We also show an example how to apply it in a network.

A Service Network Design Model for Less-than-Truckload Freight Transportation (소화물 운송 서비스 네트웍 설계 모형 연구)

  • 김병종;이영혁
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.5
    • /
    • pp.111-122
    • /
    • 1999
  • A service network design model for LTL freight transportation is formulated as a mixed integer Programming Problem with two heuristic solution a1gorithms. The Proposed model derives the transportation Path for each origination-destination pair, taking into account transportation cost over the links and handling costs over the nodes. The first algorithm searches for a local minimum solution from a given initial solution by improving the quality of solution repeatedly while the second a1gorithm searches for a better solution using Simulated Annealing Method. For both solution algorithms, the initial solution is derived by a modified reverse Diikstras shortest Path a1gorithm. An illustrative example, Presented in the last part of the Paper, shows that the proposed algorithms find solutions which reduce the cost by 12% and 15% respectively, compared to the initial solution.

  • PDF

SELECTION OF BUS TRANSPORTATION ROUTES FOR REVITALIZATION OF DOWNTOWN CITY BY USING GIS

  • Imaoka, Yoshiko;Gotoh, Keinosuke
    • Proceedings of the KSRS Conference
    • /
    • v.2
    • /
    • pp.732-735
    • /
    • 2006
  • Downtown cities in Japan are facing sharp fall in customers and continued shut down of shops due to decrease of population, increase in family cars and flowing of customers into the suburban large-scale retail stores. Omura City in Nagasaki Prefecture, Japan is no exception to this. For the revitalization of the downtown, many actions have been taken to open the vacant shops. However, transportation problem is the most important one to be solved for the citizens including the elderly people having difficulty in movement. Accordingly, this study was aimed at the revitalization of the downtown by substantiality public transportation. We have attempted to develop routes from the view-point of convenience by using Analytic Hierarchy Process (AHP) and Geographic Information Systems (GIS). As a result of the study, we were able to select three bus transportation areas by incorporating qualitative factors into the analysis. Finally, the study concluded that, revitalization activities of the downtown city itself is required in addition to re-structuring of bus transportation system for the revitalization of the downtown city.

  • PDF

A Study on the Trolley Sliding Condition Inspection System

  • Chang, ChinYoung;Kim, ChanSam;Jung, NoGeon;Na, YeonIl;Kim, YangSu
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.2
    • /
    • pp.109-112
    • /
    • 2015
  • The Korean electric railway is growing rapidly such as speed of 300km/h in high speed section and 230km/h in the conventional railway section. But, power supply failure occurs because of loss of contact, defective catenary system and high speed vehicle. Therefore preventive maintenance way based reliability has been applied. Typical example is the facility inspection method using trolley inspection system. But it is required differentiated inspection method to prevent problem such as inspection errors. In this paper, a study on the trolley sliding condition inspection system using monitoring techniques is performed for performance enhancement of inspection system. It proposed the efficient maintenance method through monitoring the deviation and height of contact wire after installing inspection system on the top of train which operates in the metropolitan area. Inspection errors were decreased by virtually monitoring the video of faulty facilities. Also those facilities were identified through the impact sound analysis and tests at the main catenary section.

A Column Generation Approach to Line Planning in Rail Freight Transportation (화물열차 노선계획 작성을 위한 열 생성 기반 최적화 모형 연구)

  • Park, Bum-Hwan
    • Journal of the Korean Society for Railway
    • /
    • v.15 no.2
    • /
    • pp.185-192
    • /
    • 2012
  • Line planning is to determine the frequency of trains on each line to satisfy origin-destination demand while minimizing total operation cost. However, different from the line planning in passenger transportation, it is more important at which intermediate stations each train should be stopped and shunted because the freight car handling works like drop-off or(and) pick-up can incur much time and high cost so that the delay deteriorates the quality of rail freight transportation service. We present an optimization model for constructing line plan in rail freight transportation to simultaneously minimize the train operation cost and total transportation time of freights. And we suggest a column generation approach for our problem, which can solve the real network instances in reasonable computation times.

Research on Agent System for Dynamic Maritime Transportation Planning (동적 해상운송계획 수립을 위한 에이전트 시스템에 관한 연구)

  • Kang, Moo-Hong;Choi, Hyung-Rim;Kim, Sung-Kwan
    • The Journal of Information Systems
    • /
    • v.21 no.4
    • /
    • pp.185-199
    • /
    • 2012
  • The most of international shipping cargoes are transported by ship and the shipping market has been continuously increasing. However, due to the recent global recession, the volume of trade decreased accordingly, and the competition between shippers to gain a competitive advantage in the shipping market continues deepening. To do this, researches on transportation costs savings as well as ways to improve customer service are needed and recently related researches are being pursued. Car carriers which transport more than 80% of car import and export volume in the world also make a lot of effort in order to reduce transportation costs, but in contrast related researches are seldom fulfilled. In this study, we developed an agent system that supports the efficient transportation of car carriers plan so that the car carriers can increase competitiveness through reduction of the logistics costs. To make this, we researched an algorithm for maritime transportation planning, and also developed a prototype of an agent system which can collect the necessary information in real time and establish a dynamic plan.

A NEW METHOD FOR SOLVING FUZZY SHORTEST PATH PROBLEMS

  • Kumar, Amit;Kaur, Manjot
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.3_4
    • /
    • pp.571-591
    • /
    • 2012
  • To the best of our knowledge, there is no method, in the literature, to find the fuzzy optimal solution of fully fuzzy shortest path (FFSP) problems i.e., shortest path (SP) problems in which all the parameters are represented by fuzzy numbers. In this paper, a new method is proposed to find the fuzzy optimal solution of FFSP problems. Kumar and Kaur [Methods for solving unbalanced fuzzy transportation problems, Operational Research-An International Journal, 2010 (DOI 10.1007/s 12351-010-0101-3)] proposed a new method with new representation, named as JMD representation, of trapezoidal fuzzy numbers for solving fully fuzzy transportation problems and shown that it is better to solve fully fuzzy transportation problems by using proposed method with JMD representation as compare to proposed method with the existing representation. On the same direction in this paper a new method is proposed to find the solution of FFSP problems and it is shown that it is also better to solve FFSP problems with JMD representation as compare to existing representation. To show the advantages of proposed method with this representation over proposed method with other existing representations. A FFSP problem solved by using proposed method with JMD representation as well as proposed method with other existing representations and the obtained results are compared.