• Title/Summary/Keyword: 출발시간제약

Search Result 17, Processing Time 0.022 seconds

Performance of TCP without congestion control (혼잡제어를 하지 않는 TCP의 성능)

  • Oh, Hong-Kyun;Kim, Eun-Gi
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.229-234
    • /
    • 2004
  • In this study, the performance is compared between RFC compatible normal TCP and several speed constraints Ignored TCP. To do these, the main algorithms that constraints the transmit rate of TCP are modified. We have modified TCP protocol stack in a Linux kernel to compare the speeds between the standard TCP and our modified TCP. We find that if the destination is short distance away from the source and packet error is scarce then the speed differences between normal and modified TCP nay be negligible. However, if the destination is far away from the source and slow start algorithm is not adopted then the transfer time for small file is different greatly In addition, if packet error occurred frequently, our modified TCP is faster than the standard TCP regardless of distance.

Algorithm for Generating Sketch Map of Optimal Path on Mobile Phone (휴대폰에서의 최적 경로 약도화 알고리즘)

  • 소용욱;이기정;황보택근;양영규
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2004.05a
    • /
    • pp.322-325
    • /
    • 2004
  • 인터넷 통신과 무선 이동 통신의 발달은 최적 경로 탐색이 인터넷 웹 페이지를 통하여 서비스될 수 있도록 하였으며, CNS(Car Navigation System)를 이용한 서비스도 가능하도록 하였다. 더욱이 개인용 휴대통신 장비인 PDA나 휴대폰을 이용하여서도 그 서비스가 제공되고 있지만, 휴대폰에서의 최적 경로 표현은 화면 크기의 제약성 때문에 많은 정보를 나타내기 어려우며, 휴대폰의 환경에 맞도록 기존의 공간 DB를 수정하는 것 또한 많은 비용과 시간이 필요하다. 이에 본 논문에서는 기존의 DB를 이용하면서 사용자가 입력한 출발지와 목적지 정보를 이용하여 최적 경로 탐색을 수행하고, 탐색된 최적 경로를 일반화 알고리즘을 이용하여 휴대폰의 작은 화면에서 사용자가 쉽게 인지할 수 있도록 약도화 하는 알고리즘을 제안한다.

  • PDF

An Efficient Model and Algorithm to Allocate Rail Track Capacity Considering Line Plans (노선 계획을 고려한 철도 선로 용량 배분 최적화 모형 및 해법)

  • Park, Bum Hwan;Chung, Kwang Woo
    • Journal of the Korean Society for Railway
    • /
    • v.17 no.6
    • /
    • pp.466-473
    • /
    • 2014
  • Recently, there is has been significant interest in the allocation systems of rail track capacities with considerations of the multiple train operating companies. The system indicates both a well-defined procedure and an algorithmic method to allocate the rail track capacities. Among them, this study considers the algorithmic method to derive the optimal timetable for the trains, which the companies propose together with their arrival and departure times at each station. However, most studies have focused on the adjustment of the departure and arrival times without conflicts, which could result in incompatible allocations with the line plan, which would result in an insufficient number of trains on each line to satisfy the demands. Our study presents a new optimization model and algorithm for the allocation problem in order to reflect the predetermined line plan. Furthermore, we provide the experimental results that were applied to the Korean high-speed railway network including the Suseo lines.

A Case Study on the Emission Impact of Land Use Changes using Activity-BAsed Traveler Analyzer (ABATA) System (활동기반 통행자분석시스템(ABATA)을 이용한 토지이용변화에 따른 차량 배기가스 배출영향 사례 분석)

  • Eom, Jin Ki;Lee, Kwang-Sub
    • Journal of Cadastre & Land InformatiX
    • /
    • v.53 no.1
    • /
    • pp.21-36
    • /
    • 2023
  • Activity-based modeling systems have increasingly been developed to address the limitations of widely used traditional four-step transportation demand forecasting models. Accordingly, this paper introduces the Activity-BAsed Traveler Analyzer (ABATA) system. This system consists of multiple components, including an hourly total population estimator, activity profile constructor, hourly activity population estimator, spatial activity population estimator, and origin/destination estimator. To demonstrate the proposed system, the emission impact of land use changes in the 5-1 block Sejong smart city is evaluated as a case study. The results indicate that the land use with the scenario of work facility dispersed plan produced more emissions than the scenario of work facility centralized plan due to the longer travel distance. The proposed ABATA system is expected to provide a valuable tool for simulating the impacts of future changes in population, activity schedules, and land use on activity populations and travel demands.

Call-a-bus Satisfaction Based On Preference Between Rural Bus And Call-a-bus (농어촌버스와 콜버스 선호에 따른 콜버스 만족도 분석)

  • Jang, Tae Youn;Han, Sang Hwa;Kim, Chang Soo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.3
    • /
    • pp.1-13
    • /
    • 2019
  • The study examines preference between rural bus and call-a-bus before call-a-bus operation and empirically analyzes the effecting factors on the call-a-bus satisfaction after operation. As the result of log-linear model, older persons prefer call-a-bus because of door-to-door service convenience and female also because of limitation of trip moving means. It is shown that persons with lower number of trips prefer call-a-bus. As the result of ordinal regression model for call-a-bus satisfaction, age, the number of family members and bus stop distance have the positive tendency but the going out frequency and the return time negative among rural bus preference persons. Male and the going out frequence show the negative tendency but trip moving means, bus stop distance, rural bus satisfaction, depart and return time positive among call-a-bus preference persons. The persons who have the positive preference on call-a-bus shows higher satisfaction on call-a-bus.

Ramp Activity Expert System for Scheduling and Co-ordination (공항의 계류장 관리 스케줄링 및 조정을 위한 전문가시스템)

  • Jo, Geun-Sik;Yang, Jong-Yoon
    • Journal of Advanced Navigation Technology
    • /
    • v.2 no.1
    • /
    • pp.61-67
    • /
    • 1998
  • In this paper, we have described the Ramp Activity Coordination Expert System (RACES) which can solve aircraft parking problems. RACES includes a knowledge-based scheduling problem which assigns every daily arriving and departing flight to the gates and remote spots with the domain specific knowledge and heuristics acquired from human experts. RACES processes complex scheduling problem such as dynamic inter-relations among the characteristics of remote spots/gates and aircraft with various other constraints, for example, custome and ground handling factors at an airport. By user-driven modeling for end users and knowledge-driven near optimal scheduling acquired from human experts, RACES can produce parking schedules of aircraft in about 20 seconds for about 400 daily flights, whereas it normally takes about 4 to 5 hours by human experts. Scheduling results in the form of Gantt charts produced by the RACES are also accepted by the domain experts. RACES is also designed to deal with the partial adjustment of the schedule when unexpected events occur. After daily scheduling is completed, the messages for aircraft changes and delay messages are reflected and updated into the schedule according to the knowledge of the domain experts. By analyzing the knowledge model of the domain expert, the reactive scheduling steps are effectively represented as rules and the scenarios of the Graphic User Interfaces (GUI) are designed. Since the modification of the aircraft dispositions such as aircraft changes and cancellations of flights are reflected to the current schedule, the modification should be notified to RACES from the mainframe for the reactive scheduling. The adjustments of the schedule are made semi-automatically by RACES since there are many irregularities in dealing with the partial rescheduling.

  • PDF

Two-phases Hybrid Approaches and Partitioning Strategy to Solve Dynamic Commercial Fleet Management Problem Using Real-time Information (실시간 정보기반 동적 화물차량 운용문제의 2단계 하이브리드 해법과 Partitioning Strategy)

  • Kim, Yong-Jin
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.2 s.73
    • /
    • pp.145-154
    • /
    • 2004
  • The growing demand for customer-responsive, made-to-order manufacturing is stimulating the need for improved dynamic decision-making processes in commercial fleet operations. Moreover, the rapid growth of electronic commerce through the internet is also requiring advanced and precise real-time operation of vehicle fleets. Accompanying these demand side developments/pressures, the growing availability of technologies such as AVL(Automatic Vehicle Location) systems and continuous two-way communication devices is driving developments on the supply side. These technologies enable the dispatcher to identify the current location of trucks and to communicate with drivers in real time affording the carrier fleet dispatcher the opportunity to dynamically respond to changes in demand, driver and vehicle availability, as well as traffic network conditions. This research investigates key aspects of real time dynamic routing and scheduling problems in fleet operation particularly in a truckload pickup-and-delivery problem under various settings, in which information of stochastic demands is revealed on a continuous basis, i.e., as the scheduled routes are executed. The most promising solution strategies for dealing with this real-time problem are analyzed and integrated. Furthermore, this research develops. analyzes, and implements hybrid algorithms for solving them, which combine fast local heuristic approach with an optimization-based approach. In addition, various partitioning algorithms being able to deal with large fleet of vehicles are developed based on 'divided & conquer' technique. Simulation experiments are developed and conducted to evaluate the performance of these algorithms.