• IE interfaces
• /
• v.7 no.2
• /
• pp.87-97
• /
• 1994

Many vehicle routing methods have been suggested, which minimize the routing distances of vehicles to reduce the total transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to develop a vehicle distribution planning system using heuristic algorithms and simulation techniques for home electronics companies. The vehicle distribution planning system developed by this study involves such complicated and stochastic conditions as one depot, multiple nodes(demand points), multiple vehicle types, multiple order items, and other many restrictions for operating vehicles. The proposed system is compared with the nearest neighbor method of the current system in terms of total logistics cost and driving time. This heuristics algorithm and simulation based distribution planning system is efficient in computational complexity, and give improved solutions with respect to the cost as well as the time. This method constructs a route with a minimum number of vehicles for a given demand.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.2
• /
• pp.91-97
• /
• 2006

The vehicle routing problem with time windows (VRPTW) is an important problem in third party logistics and supply chain management. We extend the VRPTW to the VRPTW with overtime and outsourcing vehicles (VRPTWOV) which allows the overtime of drivers and the possibility of using outsourcing vehicles. This problem can be applied to third party logistics companies for managing central distributor-local distributors, local distributor-retailers (or customers), and a manufacturer. We develop a mixed integer programming model and a genetic algorithm. Computational results demonstrate the efficiency of the developed genetic algorithm. We also develop a decision support system based on this genetic algorithm.

• IE interfaces
• /
• v.19 no.3
• /
• pp.202-213
• /
• 2006

In this paper, we develop a planning system for the routing and scheduling of vehicles in pickup and delivery service such as door-to-door parcel service. Efficient routing and scheduling of vehicles is very important in pickup and delivery service. The routing and scheduling problem is a variation of vehicle routing problem which has various realistic constraints. We develop a heuristic algorithm based on tabu search to solve the routing and scheduling problem. We develop a routing and scheduling system installed the algorithm as a planning engine. The system manage the basic data and uses GIS data to make a realistic route plan.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.23 no.3
• /
• pp.247-253
• /
• 2015

Platform standardization is widely used in commercial auto industries and other industries to acquire cost reduction as well as high reliability. This paper reviews some application examples and estimates expected effect of Korean army's platform standardization for combat system and combat support system. Also, military platform standardization based on utilization of commercial vehicles has been studied with the standard vehicles used in Korean army. It is estimated that outstanding results may be achieved if a dual platform, the public and military platforms, is utilized. So, when the strategy of the military transportation system is decided, "dual use" concept is necessary and this could maximize the effect of the military strategy reinforcement.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.93-113
• /
• 2007

In the previous research, we considered a logistics brokerage problem with the objective of minimizing total transportation lead time of freights in a logistics e-marketplace, in which a logistics brokerage agent intermediates empty vehicles and freights registered by car owners and shippers [7]. However, in the logistics e-marketplace, transportation due date tardiness is more important than the transportation lead time, since transportation service level is critically determined by whether the due date is met or not. Therefore, in this paper, we deal with the logistics brokerage problem with the objective of minimizing total tardiness of freights. Hungarian method based matching algorithms, real time matching(RTM), periodic matching(PM), and fixed matching(FM), are used for solving the problem considered in this paper. In order to test performance of the proposed algorithms, we perform computational experiments on a various problem instances. The results show that the waiting-and-matching algorithms, PM and FM, also give better performance than real time matching strategy, RTM, for the total tardiness minimization problem as the algorithms did for the total lead time minimization problem.

• Journal of the Korea Safety Management & Science
• /
• v.17 no.3
• /
• pp.239-246
• /
• 2015

Enforced environmental regulations call for extending the domain of manufacturers' responsibility to the entire product life cycle. To comply with the environmental regulations, manufacturers have constructed reverse logistics networks to re-collect their leftover waste for recycling consumed resources. However, the operational activities associated with storage, loading and transportation processes within the networks inevitably impose environmental burdens. Particularly, the transportation process largely influences environmental performance due to perpetual uses of transportation vehicles. Therefore, there is a need to develop an environmentally-conscious transportation model that can efficiently manage the uses of transportation vehicles. Additionally, it is vital to analyze its significances of environmental performance to compare quantitatively it with existing models. This paper proposes a transportation model for improving environmental performance in a reverse logistics network. This paper also presents a case study to perform its comparative analysis using Life Cycle Assessment that evaluates potential environmental impacts of a product system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.8-20
• /
• 2019

The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

• Journal of the Korea Safety Management & Science
• /
• v.26 no.2
• /
• pp.55-64
• /
• 2024

As the distribution of vehicles and logistics increases due to the development of human civilization and the increase in population, various roads play an important role in domestic traffic and transportation. However, the recent emergence of large cities and new cities is causing traffic problems, and the increase in roads is inevitable for the smooth distribution of vehicles and logistics. In Korea, mountainous regions occupy 70% of the country, so tunnels are used to open roads. Without this, it is difficult to open the road. Currently, there are 3,720tunnels (as of December 31, 2023) installed on high-speed national highways, general national highways, and local roads nationwide, with a length of 2.499 and increasing every year. Accordingly, fire accidents in tunnels will also increase, and due to the nature of tunnel fire accidents, there is a high probability that they will escalate into large-scale disasters, resulting in casualties and property damage, as well as significant social losses due to the disruption of logistics transportation, etc. As the possibility of potential hazards is increasing, the purpose of this study is to build a safe and efficient tunnel system by optimizing maintenance and management for fire and disaster accidents in tunnels.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.4
• /
• pp.107-121
• /
• 2017

This study conducted a 3-stage survey and simulation experiment to identify the impact of vehicle platoons on car-following behavior of manually-driven vehicles. Vehicle maneuvering data obtained from driving simulations was statistically analyzed based on three measures including average speed, acceleration noise, and offset to represent the deviation of lateral movements. Results indicate that MV drivers tended to have psychological burden while driving in automated vehicle platooning environments, which resulted in different vehicle maneuvers. It is expected that the outcome of this study would be useful fundamentals in developing various traffic operations strategies for managing mixed traffic stream consisting of MVs and autonomous vehicles.

• IE interfaces
• /
• v.16 no.4
• /
• pp.473-484
• /
• 2003

In this paper we deal with the logistics brokerage process in which a logistics agent intermediates between vehicle owners and shippers for matching empty vehicles and freights. Based on the Multi-Criteria Decision Making (MCDM) methodology, the proposed agent system matches the most preferred empty vehicle to the shipper and the most preferred freight to the vehicle owner. In the proposed agent system, an MCDM based sensitivity analysis is also used for supporting decision makers under negotiations. Among various MCDM methodologies, Analytic Hierarchy Process (AHP) is utilized in this paper. Although AHP is one of the most popular MCDM methodologies, AHP needs a number of pair-wise comparisons for assessing alternatives and hence may give excessive decision making burden to the decision makers. In this paper, in order to reduce the decision making burden, a preference function based estimation method is proposed. We can expect that the MCDM based logistics brokerage agent can be used as an efficient and effective tool for e-logistics marketplaces on the internet.