• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.8
• /
• pp.88-100
• /
• 1997

This paper proposes a new concept for an optimal traffic signal cycle method which will reduce the average vehicle waiting time and improve average vehicle speed. Electro sensitive traffic system can extend the traffic cycle when there ar emany vehicles in the road or it can reduce the traffic consider vehicle length, so it can cause oveflow and reduce average vechicel waiting time at the intersection, we propose on optimal traffic cycle with fuzzy ruels and neural network. Computer simulation results prove that reducing the average vehicle waiting time which proposed considering passing vehicle's length for the optimal traffic cycle better than fixe dsignal method dosen't consider vehicle length.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.4
• /
• pp.171-178
• /
• 2012

A possible heuristic to solve metropolitan area vehicle routing problems with variable vehicle speeds is suggested in this research. Delivery hours are classified into 4 different time zones to make variable vehicle speeds no change within the same time zone to make TDVRP simple to solve. The suggested heuristic consists of 2 stages such as initial solution development step and initial solution improvement step. A computer program using C++ is constructed to evaluate the suggested heuristic. Randomly generated vehicle routing problems are used for the experiments. This heuristic could be helpful to logistics companies by increasing delivery efficiencies since the 4 zone classification is taken from the observed traffic information offered by a local government.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1170-1177
• /
• 2006

We apply VRP(Vehicle Routing Problem) to sludge collection system in this study. Sewage stores of villages are located in each village around a multipurpose dam. Sludge which is produced in sewage store of village is transported from the sewage store of village to the sewage treatment plants by the special purpose vehicle such as the tank lorry. In this paper, we propose sludge collection strategies which allocate each sewage store of village to sewage treatment plants and decide the schedule of sludge collection in order to collect sludge efficiently. The strategies aim to decrease transportation cost with deciding proposed vehicle routing and scheduling the sludge collection. When we decide route of vehicles, we consider the collection time in sewage store of village, distance between sewage store of villages and vehicle information as average velocity of vehicle, operation time of vehicle driver. We also develop the SCMS(Sludge Collection Management System) based on windows system with real data which is used in certain circumstance. And we experiment to figure out vehicle route and transportation cost throughout changing input data.

• Journal of Mechanical Science and Technology
• /
• v.17 no.10
• /
• pp.1399-1410
• /
• 2003

In this paper, we develop a joystick manual driving algorithm for an electric vehicle called Cycab. Cycab is developed as a public transportation vehicle, which can be driven either by a manual joystick or an automated driving mode. The vehicle uses six motors for driving four wheels, and front/rear steerings. Cycab utilizes one industrial PC with a real time Linux kernel and four Motorola MPC555 micro controllers, and a CAN network for the communication among the five processors. The developed algorithm consists of two automatic vehicle speed control algorithms for normal and emergency situations that override the driver's joystick command and an open loop torque distribution algorithm for the traction motors. In this study, the algorithm is developed using SynDEx, which is a system level CAD software dedicated to rapid prototyping and optimizing the implementation of real-time embedded applications on distributed architectures. The experimental results verify the usefulness of the two automatic vehicle control algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.1
• /
• pp.133-140
• /
• 2014

An efficient heuristic for two-vehicle-one-depot problems is developed in this research. Vehicle moving speeds are various along hour based time intervals due to traffic jams of rush hours. Two different heuristics are examined. One is that the delivery area assignment is made using Sweep algorithm for two vehicles by splitting the whole area in half to equally divide all delivery points. The other is using common area by leaving unassigned area between the assigned for two vehicles. The common area is reassigned by two stages to balance the completion time of two vehicle's delivery. The heuristic with common area performed better than the other due to various vehicle moving speeds and traffic jams.

• Wind and Structures
• /
• v.20 no.2
• /
• pp.169-189
• /
• 2015

To investigate the effects of "sudden change" of wind fluctuations on vehicle running performance, which is caused by the artificial discrete simulation of wind field, a three-dimensional vehicle model is set up with multi-body dynamics theory and the vehicle dynamic responses in crosswind conditions are obtained in time domain. Based on Hilbert Huang Transform, the effects of simulation separations on time-frequency characteristics of wind field are discussed. In addition, the probability density distribution of "sudden change" of wind fluctuations is displayed, addressing the effects of simulation separation, mean wind speed and vehicle speed on the "sudden change" of wind fluctuations. The "sudden change" of vehicle dynamic responses, which is due to the discontinuity of wind fluctuations on moving vehicle, is also analyzed. With Principal Component Analysis, the comprehensive evaluation of vehicle running performance in crosswind conditions at different simulation separations of wind field is investigated. The results demonstrate that the artificial discrete simulation of wind field often causes "sudden change" in the wind fluctuations and the corresponding vehicle dynamic responses are noticeably affected. It provides a theoretical foundation for the choice of a suitable simulation separation of wind field in engineering application.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.201-208
• /
• 2010

This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.619-624
• /
• 2021

Vehicle orientation detection is a challenging task because the orientations of vehicles can vary in a wide range in captured images. The existing methods for oriented vehicle detection require too much computation time to be applied to a real-time system. We propose Rotate YOLO, which has a set of anchor boxes with multiple scales, ratios, and angles to predict bounding boxes. For estimating the orientation angle, we applied angle-related IoU with CIoU loss to solve the underivable problem from the calculation of SkewIoU. Evaluation results on three public datasets DLR Munich, VEDAI and UCAS-AOD demonstrate the efficiency of our approach.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.13 no.1
• /
• pp.758-771
• /
• 2021

This paper presents a novel control scheme for the three-dimensional (3D) path following of underactuated Autonomous Underwater Vehicle (AUVs) subject to unknown internal and external disturbances, in term of the time scale decomposition method. As illustration, two-time scale motions are first artificially forced into the closed-loop control system, by appropriately selecting the control gain of the integrator. Using the singular perturbation theory, the integrator is considered as a fast dynamical control law that designed to shape the space configuration of fast variable. And then the stabilizing controller is designed in the reduced model independently, based on the time scale decomposition method, leading to a relatively simple control law. The stability of the resultant closed-loop system is demonstrated by constructing a composite Lyapunov function. Finally, simulation results are provided to prove the efficacy of the proposed controller for path following of underactuated AUVs under internal and external disturbances.

• 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.