• Title/Summary/Keyword: Vehicle Service

Search Result 1,019, Processing Time 0.046 seconds

COMPUTATIONAL DURABILITY PREDICTION OF BODY STRUCTURES IN PROTOTYPE VEHICLES

  • Kim, H.-S.;Yim, H.-J.;Kim, C.-B.
    • International Journal of Automotive Technology
    • /
    • v.3 no.4
    • /
    • pp.129-135
    • /
    • 2002
  • Durability estimation of a prototype vehicle has traditionally relied heavily on accelerated durability tests using predefined proving grounds or rig tests using a road simulator. By use of those tests, it is very difficult to predict durability failures in actual service environments. This motivated the development of an integrated CAE (Computer Aided Engineering) methodology for the durability estimation of a prototype vehicle in actual service environments. Since expensive computational costs such as computation time and hardware resources are required for a full vehicle simulation in those environments with a very long span of event time, the conventional CAE methodologies have little feasibility. An efficient computational methodology for durability estimations is applied with theoretical developments. The effectiveness of the proposed methodology is shown by the comparison of results of the typical actual service environment such as the city mode with those of the typical accelerated durability test over the Belgian road.

A Two-phase Method for the Vehicle Routing Problems with Time Windows (시간대 제약이 있는 차량경로 결정문제를 위한 2단계 해법의 개발)

  • Hong, Sung-Chul;Park, Yang-Byung
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.103-110
    • /
    • 2004
  • This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

Sensor Network System to Operate Multiple Autonomous Transport Platform (다수의 무인운송플랫폼 운용을 위한 센서 네트워크 시스템)

  • Nam, Choon-Sung;Gim, Su-Hyeon;Lee, Suk-Han;Shin, Dong-Ryeol
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.8
    • /
    • pp.706-712
    • /
    • 2012
  • This paper presents a sensor network and operation for multiple autonomous navigation platform and transport service. Multiple platform navigate with inside sensors and outside sensors while acquiring and process some useful information. Each platform communicates each other by navigational information through central main server. Efficient sensor network systems are considered for the scenario which some passengers call the service and the vehicle accomplish its transport service by transporting each caller to the destination by autonomous manners. In the scenario, all vehicles perform a role of sensor system to the central server and the server handles each information and integrate with faster procedure in the wireless 3G network.

A Location-based Real-time Re-routing Heuristic to Solve the VRPSPD (VRPSPD 해결을 위한 위치기반의 실시간 재경로 탐색 휴리스틱)

  • Cha, Sang-Jin;Lee, Kee-Sung;Yu, Young-Hoon;Jo, Geun-Sik
    • Spatial Information Research
    • /
    • v.18 no.3
    • /
    • pp.63-72
    • /
    • 2010
  • The vehicle routing problem with simultaneous pick-up and delivery (VRPSPD) is a variant of the vehicle routing problem (VRP) that customers require simultaneously a pick-up and delivery service. The main objective of VRPSPD is to minimize a cost of routes satisfying many constraints. Traditional VRPSPD have been dealt with a static environment. The static environment means that a routing data and plan cannot be changed. For example, it is difficult to change a vehicle's routing plan so that a vehicle serves the pick-up demands of new customers during the delivery service. Therefore, traditional approach is not suitable for dynamic environments. To solve this problem, we propose a novel approach for finding efficient routes using a real-time re-routing heuristics based on the Location Based Service (LBS). Our re-routing heuristics can generate a new route for vehicle that satisfies a new customer's demand considering the current geographic location of a vehicle. Experimental results show that our methodology can reduce the traveling cost of vehicles comparing with other previous methods.

The Technology of Connected Car (커넥티드 카의 기술)

  • Shim, Hyun-Bo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.590-598
    • /
    • 2016
  • It comes into the spotlight as the new Blue Ocean in which the connected car industry in which the car and mobile communication technology is convergence. All sorts of infortainments services connecting with the portable electronic device(Smart phone, tablet PC, and MP3 player) and car are rapidly grown. The Connected car emphasizes the vehicle connectivity with the concept that the car has communication with the around on a real time basis and it provides the safety and expedience to the operator and using the thing of Internet (IoT) in the car and supports the application, presently, the entertainment service including the real-time Navigation, parking assistant function, not only the remote vehicle control and management service but also Email, multimedia streaming service, SNS and with the platform. Intelligent vehicle network is studied as the kind according to MANET(Mobile Ad Hoc Network) for the safety operation of the cars of the road and improving the efficiency of the driving.

A Web GPS based Logistics Vehicle Control Management System using MVC Design Patterns (MVC 디자인 패턴을 활용한 Web GPS 기반의 물류차량 출하 관제 시스템)

  • Sim, Choon Bo;Kim, Kyoung Jong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.1
    • /
    • pp.131-142
    • /
    • 2010
  • In this paper, we propose a web GPS based logistics vehicle control management system using MVC design patterns. The proposed system is designed by applying design patterns of object oriented modeling called mini-architecture to enhance reliability of software as well as promote stability of overall system design. In addition, we can get a position information by means of the GPS embedded in PDA and communicate between client and monitoring server using CDMA network so that the position of client can be identified directly by the map service. The system provides an moving object indexing technique which extends the existing TB-tree to manage and retrieve a transporting trajectory of logistics efficiently. Finally, with development of the logistics vehicle control service called WG-LOGICS system, we can verify the usefulness of our system which is able for monitoring a vehicle preparation, allocating registration, loading a burden, transfer path, and destination arrival in real world.

An efficient vehicle route search with time varying vehicle speed (속도 정보를 이용한 효율적 차량경로의 탐색)

  • Mun, Gi-Ju;Yang, Seung-Man
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.660-663
    • /
    • 2004
  • The vehicle routing problem with time-varying speed(VRPTVS) is difficult to handle with regular problem solving approaches. An approach by partitioning the service zone into three sub-zones to reduce computing time and vehicle traveling distance is suggested in this paper. To develop a partitioning algorithm for VRPTVS, all customer locations are divided into two sections such as morning zone and evening zone, excluding daytime zone. And then each service zone is calculated to find a possible number of delivery points and chosen by time window having more number of possible delivery points by considering customer location and varying speeds. A temporary complete route that can serve all target points is developed by this procedure and a pairwise exchange method is applied to reduce the traveling time.

  • PDF

A Hybrid Genetic Algorithm for the Multiobjective Vehicle Scheduling Problems with Service Due Times (서비스 납기가 주어진 다목적차량일정문제를 위한 혼성유전알고리듬의 개발)

    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.2
    • /
    • pp.121-134
    • /
    • 1999
  • In this paper, I propose a hybrid genetic algorithm(HGAM) incorporating a greedy interchange local optimization procedure for the multiobjective vehicle scheduling problems with service due times where three conflicting objectives of the minimization of total vehicle travel time, total weighted tardiness, and fleet size are explicitly treated. The vehicle is allowed to visit a node exceeding its due time with a penalty, but within the latest allowable time. The HGAM applies a mixed farming and migration strategy in the evolution process. The strategy splits the population into sub-populations, all of them evolving independently, and applys a local optimization procedure periodically to some best entities in sub-populations which are then substituted by the newly improved solutions. A solution of the HCAM is represented by a diploid structure. The HGAM uses a molified PMX operator for crossover and new types of mutation operator. The performance of the HGAM is extensively evaluated using the Solomons test problems. The results show that the HGAM attains better solutions than the BC-saving algorithm, but with a much longer computation time.

  • PDF

Proposal and Simulation of Optimal Electric Vehicle Routing Algorithm (최적의 전기자동차 라우팅 알고리즘 제안 및 시뮬레이션)

  • Choi, Moonsuk;Choi, Inji;Jang, Minhae;Yoo, Haneul
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.6 no.1
    • /
    • pp.59-64
    • /
    • 2020
  • Scheduling of electric vehicles and optimizing for charging waiting time have been critical. Meanwhile, it is challengeable to exploit the fluctuating data from electric vehicles in real-time. We introduce an optimal routing algorithm and a simulator with electric vehicles obeying the Poisson distribution of the observed information about time, space and energy-demand. Electric vehicle routing is updated in every cycle even it is already set. Also, we suggest an electric vehicle routing algorithm for minimizing total trip time, considering a threshold of the waiting time. Total trip time and charging waiting time are decreased 34.3% and 86.4% respectively, compared to the previous algorithm. It can be applied to the information service of charging stations and utilized as a reservation service.

Safety evaluation of bolt for railway vehicle equipment use (차량장착용 볼트의 안전성평가)

  • 문형석;유원희;김남포
    • Proceedings of the KSR Conference
    • /
    • 2000.05a
    • /
    • pp.660-668
    • /
    • 2000
  • The stress of connection points between railway vehicle equipment and carbody is considered as one of the important railway safety factor under the vehicle service condition. If any material or equipment drop in to the rail during the service condition, the vehicle call be lose its control as well as run off the rail. The be]t safety evaluation method by using hand calculation is broadly used by manufacturer is introduced in this paper. Two different kinds of the bolt, such as regular bolt and the bolt aluminum extruded carbody use, are tested based on U.I.C according to equipment fixed. The effect of holder and base to bolt under tile loading condition is analyzed on this paper.

  • PDF