• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.729-734
• /
• 2004

The e-Logistics means the virtual business activity and service architecture among the logistics companies based on the Internet technology. The management of vehicles' location in most conventional vehicle tracking system has some critical defects when it deals with data which are continuously changed. It means the conventional vehicle tracking system based on the conventional database is unable eventually to cope with the environment that should manage the frequently changed location of vehicles. The important things in the evaluation of the vehicle tracking system is to determine the threshold of cost of database ,update period and communication period between vehicles and the system. In other words, the difference between the reallocation of vehicle and the data in database can evaluate the overall performance of vehicle tracking systems. Most of the previous works considers only the information that is valid at the current time, and is hard to manage efficiently the past and future information. To overcome this problem, the efforts on moving objects management system(MOMS) and uncertainty processing have been started from a few years ago. In this paper, we propose an uncertainty processing model and system implementation of moving object that tracks the location of the vehicles. We adopted both linear-interpolation method and trigonometric function to chase up the location of vehicles for the past time as well as future time, respectively. We also explain the comprehensive examples of MOMS and uncertainty processing in parcel application that is one of major application of e-Logistics domain.

• Korean Management Science Review
• /
• v.29 no.1
• /
• pp.89-99
• /
• 2012

In this paper, we deal with the dual-depot heterogeneous vehicle routing problem with simultaneous delivery and pick up(DH-VRPSDP) in reverse logistics. The DH-VRPSDP is a problem of designing vehicle routes in a day of given vehicle to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited only once according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by changing the customer and the vehicle simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.

• Proceedings of the Safety Management and Science Conference
• /
• 2006.11a
• /
• pp.171-179
• /
• 2006

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.145-158
• /
• 2015

Disposable marine product packaging materials such as wooden, Styrofoam, and corrugated cardboard boxes have a very low reuse rate, thus causing the logistics costs to rise and making it difficult to establish a unit load system for marine products. Disposable packing containers to be discarded are accompanied by resource and environmental issues home and abroad. Transportation vehicles for marine products have to return empty without loading different kinds of products after delivery due to the smell and properties of marine products, thus posing as an obstacle to logistics rationalization. In an effort to overcome those limitations, this study examined the stages of transportation including "producer-wholesale market in the producing area-commission merchant-wholesale market in the consumption area-commission merchant-quasi-wholesale market-consumer" and also analyzed the utilization and distribution of disposable packaging materials currently used in the circulation of marine products including wooden, Styrofoam, and corrugated cardboard boxes. Based on the analysis results, the investigator developed a logistics rationalization model capable of promoting semi-permanent reuse and lowering empty vehicle rate on return routes as an alternative to address environmental issues caused by disposable packaging materials, which have been an obstacle to the logistics rationalization of marine products, packaging costs in the process of repeating packing and unpacking at each stage of marine products circulation, and empty vehicle rates on return routes after marine products delivery.

• 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 Information Processing Systems
• /
• v.18 no.5
• /
• pp.665-676
• /
• 2022

In modern logistics, the effective use of the vehicle volume and loading capacity will reduce the logistic cost. Many heuristic algorithms can solve this knapsack problem, but lots of these algorithms have a drawback, that is, they often fall into locally optimal solutions. A fusion optimization method based on simulated annealing algorithm (SA) and binary particle swarm optimization algorithm (BPSO) is proposed in the paper. We establish a logistics knapsack model of the fusion optimization algorithm. Then, a new model of express logistics simulation system is used for comparing three algorithms. The experiment verifies the effectiveness of the algorithm proposed in this paper. The experimental results show that the use of BPSO-SA algorithm can improve the utilization rate and the load rate of logistics distribution vehicles. So, the number of vehicles used for distribution and the average driving distance will be reduced. The purposes of the logistics knapsack problem optimization are achieved.

• IE interfaces
• /
• v.14 no.1
• /
• pp.30-38
• /
• 2001

Logistics network management has become one of the most important sources of competitive advantage regarding logistics cost and customer service in numerous business segments. Logistics network simulation is a powerful analysis method for designing and planning the logistics network optimally in an integrated way. This paper introduces a logistics network simulator, LONSIM, developed by author. LONSIM deploys a mix of simulation and optimization functions to model and analysis logistics network issues such as facility location, inventory policy, manufacturing policy, transportation mode, warehouse assignment, supplier assignment, order processing priority rule, and vehicle routes. LONSIM is built with AweSim 2.1 and Visual Basic 6.0, and executed in windows environment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.1
• /
• pp.1-8
• /
• 2011

Controlling industrial vehicle operated by human in warehouse was not simple since the information transfer for controlling the vehicle was not easy. However, as the technology for the WMS (Warehouse Management System) has been advanced and the PDA (Personal Digital Assistant) has come into wide use in a workplace, the control of man-operated vehicle became less difficult as do to AGVS (Automated Guided Vehicle System). This study examines the ways to improve the efficiency of warehouse operation through introducing rule of task assignment for the vehicles, particularly forklift. This study, basically, refer to AGV operation policy because a great number of studies for AGV dispatching rule have been done and the mechanism for the controlling vehicles is very similar. The workers in field prefer to simple dispatching rules such as Shortest Retrieval Time First (SRTF), Shortest Travel Time First (STTF), and Longest Waiting Time First (LWTF). However, these rules have potential disadvantage. Thus, several rules made up by combining rules mentioned above are introduced and these new rules use threshold value or evaluation formula. The effectiveness of these new rules are tested by simulation and the results are compared. This study proposes favorable dispatching rules for forklift in warehouse for the efficiency of the vehicle operation and stability of service level.

• Korean Management Science Review
• /
• v.18 no.2
• /
• pp.125-134
• /
• 2001

This paper is concerned with the development of a GIS-based distribution system with service consideration. The proposed model could be used for a wide range of logistics applications in planning, engineering and operational purpose for logistics system. This research addresses the formulation of those complex prob1ems of two-echelon logistics system to plan the incorporating supply center locations and distribution problems based on GIS. We propose an integrated logistics model for determining the optimal patterns of supply centers and inventory allocations (customers) with a three-step sequential approach. 1) First step, Developing GIS-distance model and stochastic set-covering program to determine Optimel pattern of supply center location. 2) Second step, Optimal sector-clustering to support customers. 3) Third step, Optimal vehicle rouse scheduling based on GIS, GIS-VRP In this research we developed GUI-tree program, the GIS-VRP provide the vehicle to users and freight information in real time. We applied a set of sample examples to this model and demonstrated samp1e results. It has been found that the proposed model is potentially efficient and useful in solving multi-depot problem through examples. However the proposed model can provide logistics decision makers to get the best supply schedule.

• Journal of the Korea Safety Management & Science
• /
• v.18 no.3
• /
• pp.127-135
• /
• 2016

Korean automobile industrial is in a difficult situation because of more competitive global market and lower demand. Therefore, domestic as well as global automobile manufacturers are making greater efforts in cost reduction to strengthen the competitiveness. According to statistical data, logistics cost in domestic manufacturers is higher than advanced countries. In this study, we developed program to effectively manage standard time of procurement logistics, and confirm based on A-automobile factory data. For the purpose, we develop the system which is possible to manage standard time as well as calculate man-hour. Program is not just for calculating and managing standard man-hour, scenarios analysis function will be added to calculate benefit while introduce logistics automated equipment. In this study we propose scenario using AGV instead of electric motor while move component. In the scenario analysis, job constitution is changed, and then we use system to compare the result. We can confirm standard man-hour is reduced from 22.3M/H to 14.3M/H. In future research, it is necessary scenario analysis function, and develop algorithm with realistic constraint condition.