• Journal of the Society of Naval Architects of Korea
• /
• v.45 no.6
• /
• pp.646-655
• /
• 2008

A main issue about production management of shipyards is to efficiently manage the work in process and logistics. However, so far the management of a transporter for moving building blocks has not been efficiently performed. To solve the issues, optimal block transporting scheduling system is developed for minimizing of the travel distance without overload of a transporter. To implement the developed system, a hybrid optimization algorithm for an optimal block transportation scheduling is proposed by combining the genetic algorithm and the ant algorithm. Finally, to evaluate the applicability of the developed system, it is applied to a block transportation scheduling problem of shipyards. The result shows that the developed system can generate the optimal block transportation scheduling of a transporter which minimizes the travel distance without overload of the transporter.

• Journal of Korean Society for Atmospheric Environment
• /
• v.27 no.4
• /
• pp.443-453
• /
• 2011

Real-time Traffic Information Service could play a key role in reducing incomplete combustion time remarkably since it can provide traffic information in real-time basis. Emission characteristics of test engines were studied in terms of travel distance and speed. The present study focused on a north district in Daegu, 12 km. The driving for the emission test was done at 8AM, 3PM, 7PM which represents various traffic conditions. The reduced emissions of Greenhouse Gases (GHG) have been measured for a travel distance running at different loads (conventional shortest route and Real-time Traffic Information) and GHG ($CO_2$, $CH_4$, $N_2O$) are all inventoried and calculated in terms of existing emission factors. The emission of GHG has been shown to reduce linearly with travel distance: $CO_2$ (9.15%), $CH_4$ (18.43%), $N_2O$(18.62%).

• Journal of Drive and Control
• /
• v.21 no.1
• /
• pp.46-52
• /
• 2024

The advancement of autonomous driving technology has heightened the importance of Autonomous Mobile Robotics (AMR) within smart factories. Notably, in tasks involving the transportation of heavy objects, the consideration of weight in route optimization and path planning has become crucial. There is ongoing research on local path planning, such as Dijkstra, A^*, and RRT^*, focusing on minimizing travel time and distance within smart factory warehouses. Additionally, there are ongoing simultaneous studies on route optimization, including TSP algorithms for various path explorations and on minimizing energy consumption in mobile robotics operations. However, previous studies have often overlooked the weight of the objects being transported, emphasizing only minimal travel time or distance. Therefore, this research proposes route planning that accounts for the maximum payload capacity of mobile robotics and offers load-optimized path planning for multi-destination transportation. Considering the load, a genetic algorithm with the objectives of minimizing both travel time and distance, as well as energy consumption is employed. This approach is expected to enhance the efficiency of mobility within smart factories.

• Journal of the Korean Society for Railway
• /
• v.11 no.4
• /
• pp.417-423
• /
• 2008

Transportation planners are increasingly adopting policies aimed at changing travel choices made by general commuter. Theories on the relationship between high-speed technology and transport address changes in travel behavior of regional commuter due to alterations in the Kyung-Bu railroad transportation corridor. The purpose of this paper is to examine the relationships between travel behavior and high-speed technology. The KORAIL data allows us to explore the differences between travel characteristics that are usually hard to discern by guesswork. The effects of travel time were found to be significant in the full decisions that control for commuting KTX. Although many argue that transportation behavior cannot be changed, this paper demonstrates that about 4 years of behavioral data on KTX travel show otherwise. In this paper we explore several possibilities to fill in some of the gaps in our knowledge on the expansion of commuter belt.

• Journal of Ecology and Environment
• /
• v.30 no.2
• /
• pp.201-207
• /
• 2007

Researchers have used a variety of methods to measure patterns of animal movement, including the use of spatial data (mapping the position of a moving animal at specified intervals) and direct estimation of travel path length by pacing under a moving animal or group. I collected movement data from five groups of siamangs (Symphalangus syndactylus) using two different methods concurrently to estimate the effects of the method of data collection on estimates of daily path length (DPL). Estimates of DPL produced from spatial data collected at 15-minute intervals were 12% lower than estimates of DPL produced by pacing under the traveling animal. The actual magnitude of the difference was correlated with the travel distance, but there was no correlation between the proportional difference and the travel distance. While the collection of spatial data is generally preferable, as spatial data permit additional analyses of patterns of movements in two or three dimensions, the relatively small difference between the DPL's produced using different methods suggests that pacing is an acceptable substitute where the collection of spatial data is impractical. I also subsampled the spatial data at increasing time intervals to assess the effect of sampling interval on the calculation of daily path lengths. Longer sampling intervals produced significantly shorter estimates of travel paths than shorter sampling intervals. These results suggest that spatial data should be collected at short time intervals wherever possible, and that sampling intervals should not exceed 30 minutes. Researchers should be cautious when comparing data generated using different methods.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.64-78
• /
• 2019

This paper explores key factors affecting taxi travel using global positioning system(GPS) data in Seoul, Korea, considering spatial dependence. We first analyzed the travel characteristics of taxis such as average travel time, average travel distance, and spatial distribution of taxi trips according to the time of the day and the day of the week. As a result, it is found that the most taxi trips were generated during the morning peak time (8 a.m. to 9 a.m.) and after the midnight (until 1 a.m.) on weekdays. The average travel distance and travel time for taxi trips were 5.9 km and 13 minutes, respectively. This implies that taxis are mainly used for short-distance travel and as an alternative to public transit after midnight in a large city. In addition, we identified that taxi trips were spatially correlated at the traffic analysis zone(TAZ) level through the Moran's I test. Thus, spatial regression models (spatial-lagged and spatial-error models) for taxi trips were developed, accounting for socio-demographics (such as the number of households, the number of elderly people, female ratio to the total population, and the number of vehicles), transportation services (such as the number of subway stations and bus stops), and land-use characteristics (such as population density, employment density, and residential areas) as explanatory variables. The model results indicate that these variables are significantly associated with taxi trips.

• Journal of Korean Society for Quality Management
• /
• v.17 no.2
• /
• pp.142-148
• /
• 1989

In order to determine the level of service which minimizes the total of expected cost of service and the expected cost of waiting for that service, the important considerations are to evaluate the distance traveled to and from a service facility (D) and the expected number of mechanics in queueing system (L). The travel-time models are very useful when the servers must travel to the customer from the service facility. Thus, in this paper we studied on the determination of the optimal service level by the travel-time models. In order to decide the optimal service level, (D) has been introduced as a uniform distribution and (L) has been introduced as M/M/S model of queueing theory.

• Proceedings of the KSR Conference
• /
• 2005.05a
• /
• pp.257-262
• /
• 2005

Sleeping cars mean railroad cars which are equipped with facilities available business, travel, rest, sleep for long distance travel. Domestic sleeping cars , as the concept of ‘night train’, provide passenger who travel at night with simple berth . German, Japanese, American sleeping cars are classified with sleeping car, coach car, seat car or first class, standard class, family room, room for the handicapped, which offer not only sleep but various facilities and service such as snack, reading, available shower for daytime travel. Accordingly, through the analyzing spatial factor of domestic and foreign sleeping cars, we first should abstract the demand for fundamental design to enhance our passenger's comfort. And then we should try to improve the quality of travel culture by offering it passenger.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.101-108
• /
• 2004

The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.617-631
• /
• 2019

In the four-step demand model, a gravity mode is used most commonly at the trip distribution stage. The purpose of this study was to develop a new friction factor that can express the accessibility property as a single friction factor to compensate for the variable limits of the gravity model parameters (travel time, travel cost). To derive a new friction factor, a new friction factor was derived using the space syntax that can quantify the characteristics of the urban space structure, deriving the link-unit integration degree and then using the travel time and travel distance relationship. Calibration of the derived friction factor resulted in a similar level to that of the existing friction factor. As a result of verifying the various indicators, the explanatory power was found to be excellent in the short - and long - distance range. Therefore, it is possible to derive and apply the new friction factor using the integration index, which can complement the accessibility beyond the limit of the existing shortest distance, and it is believed to be more advantageous in future utilization.