• Title/Summary/Keyword: 차량할당

Search Result 78, Processing Time 0.029 seconds

An Integer Programming Model for the Rolling Stock Assignment Plan (철도차량 할당계획을 위한 정수계획법모형)

  • 김성호;홍순흠
    • Proceedings of the KSR Conference
    • /
    • 2002.10a
    • /
    • pp.349-356
    • /
    • 2002
  • This paper describes a mathematical programming model for constructing the rolling stock assignment plan. This plan is a schedule which assigns daily routings, maintenance activities, and other tasks to trainsets. A generalized set partitioning model which is a kind of integer programming model is suggested as a model for constructing the assignment plan. And a column generation method are suggested as a solution method.

  • PDF

Deciding Priority of Safety Messages using Decision Tree in IEEE 802.11p/1609.4 Vehicular Network (802.11p/1609 차량네트워크에서 Decision Tree를 이용한 안전메세지 우선순위 결정 기법)

  • Baik, Hyein;Kwon, YongHo;Rhee, Byung Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.794-797
    • /
    • 2015
  • As the interest in VANET is increased, a study on the beacon message transmission between vehicles is actively being made. IEEE 802.11p/1609.4 standard is based on a multichannel system consisting of multiple service channels (SCH) and a control channel (CCH). Multiple SCHs are defined for nonsafety data transfer, while the CCH is used to broadcast safety messages called beacons and control messages (i.e., service advertisement messages). However, most messages broadcast in the only one CCH belong to safety application that must be contested in dense vehicular network. This paper suggests safety message transfer algorithm in dense vehicular congestion. The proposed algorithm is that the priority of safety messages is decided by decision tree and messages are stored in proper queues according to their priorities. Then, safety messages with higher priorities are sent in turn by CCH in the assigned time. The proposed algorithm decreases the beacon transmission delay and increase on the probability of a successful beacon reception in an IEEE 802.11p/1609.4-based network.

  • PDF

Frequency Allocation of WAVE for Smart Vehicle Services (주파수 간섭으로 본 스마트 자동차 서비스를 위한 WAVE 주파수 분배 방안)

  • Kim, Seung-Cheon;Rho, Kwang-Hyun;Hwang, Ho-Young;Hong, Jung-Wan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.5
    • /
    • pp.1-6
    • /
    • 2012
  • Recent trend of pursuing smart life began to affect the usage of vehicle in real life. The next generation of the smart vehicle services start to utilize telecommunication technology and sensing techniques for the advanced safety and efficient use of road for drivers, while there's still decency in satisfaction about vehicular safety upgrade. For this purpose, a new technology is devised as Wireless Access in Vehicular Environment(WAVE). Foreign industries now are developing technologies of key components, platform and services related to WAVE. Domestic industry just starts to develop the related technologies about WAVE, although the frequency for WAVE is not allocated. This paper introduces the status of technical standards for WAVE and the status of developing components of WAVE. And this paper also proposes the guidance of frequency allocating policy for WAVE through frequency interference experiments.

An antenna selection scheme considering low feedback rate in MIMO-OFDM systems for Personal Rapid Transit Systems (소형궤도열차 제어를 위한 MIMO-OFDM 시스템에서 낮은 귀환률을 고려한 안테나 선택 기법)

  • Park, Ho-Hwan;Lim, Jong-Kyung;Kim, Baek-Hyun;Yoo, Dong-Kwan;Kwak, Kyung-Sup
    • Proceedings of the KSR Conference
    • /
    • 2005.05a
    • /
    • pp.909-914
    • /
    • 2005
  • This paper proposes an efficient antenna selection scheme for PRT (Personal Rapid Transit) remote control in a wireless MIMO-OFDM systems. Using high correlation among neighboring sub-carriers, transmit antennas are selected by calculation based on the channel response of the center sub-carrier in each subgroup. This scheme reduces complexity of selection algorithm and significantly reduces the feedback channel information with small performance degradation. Especially, when feedback channel rate between a control base and a train is fixed, the proposed scheme can provide a significant advantage in high mobility.

  • PDF

Actuator Control based on Interconnected Heterogeneous Networks (이종 통신망에 연결된 네트워크 기반 액추에이터 제어)

  • Kim, Nayeon;Moon, Chanwoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.57-62
    • /
    • 2017
  • Recently, the use of electronic control units in vehicle has increased. The ECUs are connected to in vehicle networks to process a large amount of information. In this paper, for an actuator that is interconnected to CAN and FlexRay, a FlexRay-CAN gateway is presented and a data packing algorithm with a bisection method of a FlexRay slot is proposed. And, a network based actuator control system and packing map is implemented. With the proposed packing method, contact force sensor data are transferred within the maximum allowed delay to ensure the stability. The proposed method is useful for control of distributed system.

Dynamic Channel Allocation Using SJF Scheduling in IEEE 802.11p/1609 Vehicular Network (IEEE 802.11p/1609 차량 네트워크에서 SJF(Shortest Job First) 스케쥴링을 이용한 동적 채널 할당 기법)

  • Jang, Hyun-Jun;Kwon, Yong-Ho;Rhee, Byung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.624-627
    • /
    • 2014
  • In vehicular network, the basic goal is to provide vehicle safety service and commercial service such as ITS(Intelligent Transportation System) or video, etc on the road. And most research concentrated on transportation of safety message in congestion situation. It is important to allocate channel for safety message in congestion situation, but providing suitable service is also important problem in vehicular network. For this reason, IEEE 1609.4 allocate 4 multiple service channels (SCHs) for non-safety data transfer. But, in congestion situation with many vehicles, the contention for channel acquisition between services becomes more severe. So services are provided improperly because of lack of service channel. This paper suggests dynamic channel allocation algorithm. The proposed algorithm is that RSU(RaodSide Unit) maintain and manage the information about service and status of channels. On based of the SJF(Shortest Job First) scheduling using those information, RSU selects the most appropriate channel among the 4 SCHs allocated by IEEE 1609.4 in network congestion situation.

  • PDF

Comparative Analysis for Clustering Based Optimal Vehicle Routes Planning (클러스터링 기반의 최적 차량 운행 계획 수립을 위한 비교연구)

  • Kim, Jae-Won;Shin, KwangSup
    • The Journal of Bigdata
    • /
    • v.5 no.1
    • /
    • pp.155-180
    • /
    • 2020
  • It takes the most important role the problem of assigining vehicles and desigining optimal routes for each vehicle in order to enhance the logistics service level. While solving the problem, various cost factors such as number of vehicles, the capacity of vehicles, total travelling distance, should be considered at the same time. Although most of logistics service providers introduced the Transportation Management System (TMS), the system has the limitation which can not consider the practical constraints. In order to make the solution of TMS applicable, it is required experts revised the solution of TMS based on their own experience and intuition. In this research, different from previous research which have focused on minimizing the total cost, it has been proposed the methodology which can enhance the efficiency and fairness of asset utilization, simultaneously. First of all, it has been adopted the Cluster-First Route-Second (CFRS) approach. Based on the location of customers, we have grouped customers as clusters by using four different clustering algorithm such as K-Means, K-Medoids, DBSCAN, Model-based clustering and a procedural approach, Fisher & Jaikumar algorithm. After getting the result of clustering, it has been developed the optiamal vehicle routes within clusters. Based on the result of numerical experiments, it can be said that the propsed approach based on CFRS may guarantee the better performance in terms of total travelling time and distance. At the same time, the variance of travelling distance and number of visiting customers among vehicles, it can be concluded that the proposed approach can guarantee the better performance of assigning tasks in terms of fairness.

New Mathematical Model and Parallel Hybrid Genetic Algorithm for the Optimal Assignment of Strike packages to Targets (공격편대군-표적 최적 할당을 위한 수리모형 및 병렬 하이브리드 유전자 알고리즘)

  • Kim, Heungseob;Cho, Yongnam
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.4
    • /
    • pp.566-578
    • /
    • 2017
  • For optimizing the operation plan when strike packages attack multiple targets, this article suggests a new mathematical model and a parallel hybrid genetic algorithm (PHGA) as a solution methodology. In the model, a package can assault multiple targets on a sortie and permitted the use of mixed munitions for a target. Furthermore, because the survival probability of a package depends on a flight route, it is formulated as a mixed integer programming which is synthesized the models for vehicle routing and weapon-target assignment. The hybrid strategy of the solution method (PHGA) is also implemented by the separation of functions of a GA and an exact solution method using ILOG CPLEX. The GA searches the flight routes of packages, and CPLEX assigns the munitions of a package to the targets on its way. The parallelism enhances the likelihood seeking the optimal solution via the collaboration among the HGAs.

FMCW Radar simulation model with interference using a new radar performance parameter (새로운 레이더 성능지표를 이용한 FMCW 레이더 간섭 시뮬레이션 모델)

  • Mun, Sang-Kon;Park, Seung-Keun;Yang, Hoon-Gee;Cheon, Chang-Yul;Chung, Young-Seek;Bae, Kyung-Bin
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.4
    • /
    • pp.86-92
    • /
    • 2011
  • ITS(Intelligent Transport System) has been researched actively to guarantee the smooth traffic and the safety of the vehicle. In recent, as the sensor for the measurement of distance between vehicles, the FMCW radar system in millimeter wave band has been interested in ITS. Actually, 47, 60, 77, 94 and 139 GHz have been assigned for the vehicle radar frequencies in Europe and Japan. However, the performances of the FMCW radar are deteriorated due to the interferences from the surrounding radars and mobile devices. In this paper, in order to model and simulate the performance of FMCW radar under the exterior interference, we propose a new performance parameter, RER(Radius Error Rate), which contains the information of the range error due to the interferences, and show the effectiveness of the proposed parameter.

An Online Forklift Dispatching Algorithm Based on Minimal Cost Assignment Approach (최소 비용할당 기반 온라인 지게차 운영 알고리즘)

  • kwon, BoBae;Son, Jung-Ryoul;Ha, Byung-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.2
    • /
    • pp.71-81
    • /
    • 2018
  • Forklifts in a shipyard lift and transport heavy objects. Tasks occur dynamically and the rate of the task occurrence changes over time. Especially, the rate of the task occurrence is high immediately after morning and afternoon business hours. The weight of objects varies according to task characteristic, and a forklift also has the workable or allowable weight limit. In this study, we propose an online forklift dispatching algorithm based on nearest-neighbor dispatching rule using minimal cost assignment approach in order to attain the efficient operations. The proposed algorithm considers various types of forklift and multiple jobs at the same time to determine the dispatch plan. We generate dummy forklifts and dummy tasks to handle unbalance in the numbers of forklifts and tasks by taking their capacity limits and weights. In addition, a method of systematic forklift selection is also devised considering the condition of the forklift. The performance indicator is the total travel distance and the average task waiting time. We validate our approach against the priority rule-based method of the previous study by discrete-event simulation.