• 제목/요약/키워드: Transportation Time Constraints

검색결과 73건 처리시간 0.021초

Analytical design of constraint handling optimal two parameter internal model control for dead-time processes

  • Tchamna, Rodrigue;Qyyum, Muhammad Abdul;Zahoor, Muhammad;Kamga, Camille;Kwok, Ezra;Lee, Moonyong
    • Korean Journal of Chemical Engineering
    • /
    • 제36권3호
    • /
    • pp.356-367
    • /
    • 2019
  • This work presents an advanced and systematic approach to analytically design the optimal parameters of a two parameter second-order internal model control (IMC) filter that satisfies operational constraints on the output process, the manipulated variable as well as rate of change of the manipulated variable, for a first-order plus dead time (FOPDT) process. The IMC parameters are designed to minimize a control objective function composed of the weighted sum of the error between the process variable and the set point, and the rate of change of the manipulated variable, and to satisfy the desired constraints. The feasible region of the constrained IMC control parameters was graphically analyzed, as the process parameters and the constraints varied. The resulting constrained IMC control parameters were also used to find the corresponding industrial proportional-integral controller parameters of a Smith predictor structure.

교통약자의 행동특성과 이동편의시설 설치요소를 통한 여객시설 디자인방법에 관한 연구 - 군산 국제·연안여객선 터미널을 대상으로 - (Barrier Free Design Methods applied in Passenger Terminals based on Characteristics of Transportation Poor & Barrier Free Elements - Focused on the Gunsan International*Coastal Passenger Boat Terminal -)

  • 박병민;심은주
    • 한국실내디자인학회논문집
    • /
    • 제22권5호
    • /
    • pp.344-356
    • /
    • 2013
  • Due to implementation of legislations for translation poor such as handicapped people, elderlies, children most public buildings are now integrating barrier free design methods. However, barrier free design is still considered as constraints of physical elements that only serve to meet functional aspects for minors and conflict with designs of the space. The authors believe that it is time that barrier free design is considered not as constraints but opportunities that both meet functional and aesthetical needs serving the growing population of transportation poor and others as well. This paper has looked into characteristics of transportation poor and barrier free design elements of passenger terminals and developed 4 categories of design methods. applied by using human sense, form, furniture, and architectural elements. Then the authors analyzed Gunsan International and coastal passenger terminal existing conditions which is considered to be designed to meet barrier free guidelines and legislations through the developed design categories and elements. The result turned out that the subject in regard of barrier free designs for transportation poor lack various applications such as forms that can be used as symbolic and directional elements that assists as wayfinding cues. Also, flexible and multi functional approaches in furniture arrangements, structural approaches are needed.

서비스시간 제약이 존재하는 도시부 복합교통망을 위한 링크기반의 최단경로탐색 알고리즘 (A Link-Based Shortest Path Algorithm for the Urban Intermodal Transportation Network with Time-Schedule Constraints)

  • 장인성
    • 대한교통학회지
    • /
    • 제18권6호
    • /
    • pp.111-124
    • /
    • 2000
  • 본 연구에서 다루고자 하는 문제는 서비스시간 제약을 갖는 도시부 복합교통망에서의 기종점을 잇는 합리적인 최단경로를 탐색하고자 하는 것이다. 서비스시간 제약은 도시부 복합교통망에서의 현실성을 보다 더 사실적으로 표현하지만 기존의 알고리즘들은 이를 고려하지 않고 있다. 서비스시간 제약은 환승역에서 여행자가 환승차량을 이용해서 다른 지점으로 여행할 수 있는 출발시간이 미리 계획된 차량운행시간들에 의해 제한되어지는 것이다. 환승역에 도착한 여행자는 환승차량의 정해진 운행시간에서만 환승차량을 이용해서 다른 지점으로 여행할 수 있다. 따라서 서비스시간 제약이 고려되어지는 경우 총소요시간에는 여행시간과 환승대기시간이 포함되어지고, 환승대기시간은 여행자가 환승역에 도착한 시간과 환승차량의 출발이 허용되어지는 시간에 의존해서 변한다. 본 논문에서는 이러한 문제를 해결할 수 있는 링크기반의 최단경로탐색 알고리즘을 개발하였다. Dijkstra 알고리즘과 같은 전통적인 탐색법에서는 각 노드까지의 최단도착시간을 계산하여 각 노드에 표지로 설정하지만 제안된 알고리즘에서는 각 링크가지의 최단도착시간과 각 링크에서의 가장 빠른 출발시간을 계산하여 각 링크의 표지로 설정한다. 제안된 알고리즘의 자세한 탐색과정이 간단한 복합교통망에 대하여 예시되어진다.

  • PDF

최적제어이론을 이용한 동적 통행배정 모형의 적용에 관한 연구 (An Application of Dynamic Route Choice Model Using Optimal Control Theory)

  • 전경수;오세현
    • 대한교통학회지
    • /
    • 제13권4호
    • /
    • pp.5-29
    • /
    • 1995
  • Advanced Traveler Inoformation Systems*ATIS) , as a subsystem of ITS influence the travel choices of dreivers by providing them with historical, real-time and predictive information to supprot travel decisions and consequently improves the speed and quality of travel. For thesuccessul accomplishment of ATIS, the time-dependent variations of traffic in a road network and travel times of vehicles during their journey must be predicted . The purpose of this study is to evaluate the past developments in the dynamic route choice models and to apply the instantaneous dynamic user optimal route choice model. recently formulated with flow propagation constraints by Ran, Boyce and LeBlanc, to the real transportation network of Seocho-Ku in Seoul. As input data for this application, the time-dependent travel rates are estimated and the link travel time function is derived. The modelis validated from three view points : the efficiency of model itself the ability to predict traffic volume and travel time on links, and the optimal traffic control.

  • PDF

승객 수송 문제의 최적화 (Optimization of Passenger Transportation Problem)

  • 박준혁;김병인;김성배
    • 산업공학
    • /
    • 제23권2호
    • /
    • pp.139-146
    • /
    • 2010
  • In this paper, we present the study of a real passenger transportation system. Passenger transportation problem aims to transport passengers from bus stops to their destinations by a fleet of vehicles while satisfying various constraints such as vehicle capacity, maximum allowable riding time in a bus, and time windows at destinations. Our problem also has special issues such as mixed loading, consideration of afternoon problem together with morning problem, and transferring passengers between vehicles. Our solution approach consists of three serial procedures: bus route generation, bus scheduling, and post optimization. Efficient heuristic algorithms were developed and implemented for the procedures. The proposed solution approach has been successfully applied to several real world problem instances and could reduce about 10% to 15% of buses.

수도권 복합 대중교통망의 복수 대안 경로 탐색 알고리즘 고찰 (A Study on Finding the K Shortest Paths for the Multimodal Public Transportation Network in the Seoul Metropolitan)

  • 박종훈;손무성;오석문;민재홍
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
    • /
    • pp.607-613
    • /
    • 2011
  • This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

  • PDF

네트워크 기반모델을 이용한 서울-부산간 고속철도 개통 후의 교통수단별 시장점유율 예측 (A Network-Based Model for Estimating the Market Share of a High-Speed Rail System in the Korean NW-SE Corridor)

  • Gang-Len Chang
    • 대한교통학회:학술대회논문집
    • /
    • 대한교통학회 2003년도 제43회 학술발표회논문집
    • /
    • pp.127-150
    • /
    • 2003
  • This research presents a novel application of static traffic assignment methods, but with a variable time value, for estimating the market share of a high-speed rail (HSR) in the NW-SE corridor of Korea which is currently served by the airline (AR), conventional rail (CR), and highway (HWY) modes. The proposed model employs the time-space network structure to capture the interrelations among all competing transportation modes, and to reflect their supply- and demand-sides constraints as well as interactions through properly formulated link-node structures. The embedded cost function for each network link offers the flexibility for incorporating all associated factors, such as travel time and fare, in the model computation, and enables the use of a distribution rather than a constant to represent the time-value variation among all transportation mode users. To realistically capture the tripmakers' value-of-time (VOT) along the target area, a novel method for VOT calibration has been developed with aggregate demand information and key system performance data from the target area. Under the assumption that intercity tripmakers often have nearly "perfect" travel information, one can solve the market share of each mode after operations of HSR for each O-D pair under the time-dependent demand with state-of-the-art traffic assignment. Aside from estimating new market share, this paper also investigated the impacts of HSR on other existing transportation modes.

  • PDF

회전 제약을 포함하고 있는 교통 네트워크의 경로 유도를 위한 개미 알고리즘 (Ant Algorithm for Dynamic Route Guidance in Traffic Networks with Traffic Constraints)

  • 김성수;안승범;홍정기;문재기
    • 대한교통학회지
    • /
    • 제26권5호
    • /
    • pp.185-194
    • /
    • 2008
  • 본 논문에서는 기본적으로 라우팅(routing) 메커니즘을 이용하는 개미 알고리즘(ant algorithm)을 이용하여 실시간으로 변화하는 교통 상황과 U턴, P턴 및 회전제약(좌회전 및 U턴 금지)을 고려하여 다수의 최적경로를 제한된 시간내에 탐색제시 할 수 있는 경로 유도 방법을 제시하고자 한다. 이 방법은 기존 최적경로알고리즘과 비교하여 회전 제약 상황을 쉽고 빠르게 고려할 수 있는 장점이 있다.

동일경로 제약을 갖는 집배송 차량 경로 수립 문제의 최적화 해법 (An Optimization Algorithm for The Pickup and Delivery Problem With Time Windows)

  • 강자영;장희정;강장하;박성수
    • 대한산업공학회지
    • /
    • 제33권1호
    • /
    • pp.33-43
    • /
    • 2007
  • The pickup and delivery problem with time windows generally involves the construction of optimal routeswhich satisfy a set of transportation requests under pairing, precedence, time window, vehicle capacity, andavailability constraints. In this paper, we added some constraints to the problem and adopted an objectivefunction based on number of used vehicles, total travel distance and total schedule duration to consider morerealistic problems. A branch and price algohthm for the problem is proposed and an enumeration method is usedfor the subproblems. The algorithm was tested on randomly generated instances and computational results werereported.

정시배송체계의 실용적 설계를 위한 방법론 (A Practical Method for Designing Vehicle Routing with Time Windows in Warehouse)

  • 변의석
    • 산업공학
    • /
    • 제13권3호
    • /
    • pp.455-461
    • /
    • 2000
  • Logistics systems can be evaluated by how productively distribution center operates, how promptly transportation vehicle dispatches, how efficiently facility layout is, and so on. In this paper, a practical vehicle routing scheme with fixed delivery time and fixed vehicle routes is introduced. The method helps the distribution center reduce logistics cost with respect to dispatching vehicles, and satisfy the customer with pre-determined delivery time window constraints. A case study has shown that the proposed scheme not only generates a feasible schedule with time windows, but also balances material flow in warehouse.

  • PDF