• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.1
• /
• pp.61-83
• /
• 2009

This study developed a variable demand traffic assignment model by stable dynamics. Stable dynamics, suggested by Nesterov and do Palma[19], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with the user equilibrium model, which is based on the arc travel time function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on congestion. It is therefore expected to be a useful analysis tool for transportation planners. In this study, we generalize the stable dynamics into the model with variable demands. We suggest a three stage optimization model. In the first stage, we introduce critical travel times and dummy links and determine variable demands and link flows by applying an optimization problem to an extended network with the dummy links. Then we determine link travel times and path flows in the following stages. We present a numerical example of the application of the model to a given network.

• Korean Journal of Agricultural Science
• /
• v.42 no.1
• /
• pp.63-71
• /
• 2015

Path planning is an essential part for traveling and mowing of autonomous lawn mower tractors. Objectives of the paper were to analyze operation patterns by a skilled farmer, to extract and optimize waypoints, and to demonstrate generation of formatted planned path for autonomous lawn mower tractors. A 27-HP mower tractor was operated by a skilled farmer on grass fields. To measure tractor travel and operation characteristics, an RTK-GPS antenna with a 6-cm RMS error, an inertia motion sensing unit, a gyro compass, a wheel angle sensor, and a mower on/off sensor were mounted on the mower tractor, and all the data were collected at a 10-Hz rate. All the sensor data were transferred through a software program to show the status immediately on the notebook. Planned path was generated using the program parameter settings, mileage and time calculations, and the travel path was plotted using developed software. Based on the human operation patterns, path planning algorithm was suggested for autonomous mower tractor. Finally path generation was demonstrated in a formatted file and graphic display. After optimizing the path planning, a decrease in distance about 13% and saving of the working time about 30% was achieved. Field test data showed some overlap, especially in the turning areas. Results of the study would be useful to implement an autonomous mower tractor, but further research needs to improve the performance.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.85-96
• /
• 2001

This paper discusses the problem of finding the Origin-Destination(O-D) shortest path in urban road networks that have variable special qualifies such as time windows for passing as well as geometrical special qualities such as U-turn and left-turn prohibition. The focus of this paper is motivated by the problem of finding minimum travel time paths for an advanced traveler information system (ATIS) in the context of intelligent transportation system(ITS) application. The transportation network with variable and geometrical special qualities is a more realistic representation of the urban road network in the real word. But, the traditional and existing shortest path algorithms can not search practical shortest path that variable special quality is reflected. This paper presents a shortest path algorithm which can search reasonable shortest path information for the urban ATIS application within a real time. The algorithm is based on genetic algorithm(GA). The high performance of the proposed algorithm is demonstrated by computer simulations.

• Journal of Korean Society of Transportation
• /
• v.8 no.1
• /
• pp.55-71
• /
• 1990

The behavioral mechanism underlying the traffic assignment model is a choice, or decision-making process of traveling paths between origins and destinations. The deterministic approach to traffic assignment assumes that travelers choose shortest path from their origin-destination pair. Although this assumption seems reasonable, it presumes that all travelers have perfect information regarding travel time, that they make consistently correct decision, and that they all behave in identical fashion. Stochastic user equilibrium assignment relaxes these presumptions by including a random component in traveler's perception of travel time. The objective of this study is to compare "A Model of Deterministic User Equilibrium Assignment" with "Models of Stochastic User Equilibrium Assignment" in the theoretical and practical aspects. Specifically, SUE models are developed to logit and probit based models according to discrete choice functions. The models were applied to sioux Falls net ork consisting of 24 zones, 24 nodes and 76 links. The distribution of perceived travel time was obtained by using the relationship between speed and traffic flow.

• IE interfaces
• /
• v.2 no.1
• /
• pp.37-45
• /
• 1989

Guide path design is the most important factor in planning automated guided vehicle systems(AGVS) in manufacturing shop environments. This paper studies a heuristic procedure to design an optimal bi-directional guide path with the objective of the minimum total travel time of the vehicles. An example is solved to validate the procedure developed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.2
• /
• pp.43-51
• /
• 1993

This paper describes the flow path design of unidirectional automated guided vehicle systems. The objective is to find the flow path which will minimize total travel time of unloaded as well as loaded vehicles. The allocation of unloaded vehicles is determined by applying the transportation simplex method. The problem is solved using a branch-and-bound technique. A simple illustrative example is discussed to demonstrate the procedure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2473-2489
• /
• 2022

Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.10
• /
• pp.3160-3172
• /
• 1996

A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

• The Journal of Society for e-Business Studies
• /
• v.17 no.4
• /
• pp.39-56
• /
• 2012

Technological advancements in information technology including RFID and mobile technologies have made it feasible to track the customers travel path in a store. The customer travel paths provide valuable implications to understanding the customer behaviors in a store. In our research, we develop a shopping path analysis system to track and analyze the customer travel path. The proposed system consists of RFID systems for collecting the customer paths and analysis system. The analysis system conducts clustering for identifying the distinctive shopping patterns, and analyzes the profile of a grocery, such as congestion rate, visiting rate, and staying time, etc. We show the applicability of our proposed system using the actual data obtained at a grocery in Seoul as a case study.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.10
• /
• pp.385-390
• /
• 2021

The gantry is a device that moves fine chips from the feeder to the PCB. While the gantry is moving the part, the camera checks the condition of the part. The purpose of this paper is to find the path with the shortest travel time of the gantry and calculate the travel time according to the path. stop_motion is a way to check the status of the parts currently in use. This paper presents the moving_motion method and the fly_motion method with maximum speed in front of the camera. In addition the signature method was used to inspect the condition of the parts. When comparing the moving time of the three types of gantry, the moving_motion method improved by 9.42% and the fly_motion method by 17.73% compared to stop_motion. When the fly_motion method proposed in this paper is used for the gantry movement path, it is expected that productivity will be improved.