• 대한산업공학회지
• /
• 제33권2호
• /
• pp.265-272
• /
• 2007

The purpose of Vehicle Routing Problem (VRP) is to design the least costly (distance, time) routes for a fleet of identically capacitated vehicles to serve geographically scattered customers. There may be some restrictions such as the maximal capacity for each vehicle, maximal distance for each vehicle, time window to visit the specific customers, and so forth. This paper is concerned with VRP to minimize the sum of elapsed time from departure, where the elapsed time is defined as the time taken in a moving vehicle from the depot to each customer. It is important to control the time taken from departure in the delivery of perishable products or foods, whose freshness may deteriorate during the delivery time. An integer linear programming formulation is suggested and a heuristic for practical use is constructed. The heuristic is based on the set partitioning problem whose performances are compared with those of ILOG dispatcher. It is shown that the suggested heuristic gave good solutions within a short computation time by computational experiments.

• 대한산업공학회지
• /
• 제34권3호
• /
• pp.362-372
• /
• 2008

Manufacturers, or vendors, and their customers continue to adopt vendor-managed inventory(VMI) program to improve supply chain performance through collaboration achieved by consolidating replenishment responsibility upstream with vendors. In this paper, we construct a mixed integer linear programming model and propose a genetic algorithm for the integrated inventory and routing problems with lost sales maximizing the total profit in the VMI supply chains which comprise of a single manufacturer and multi-retailer. The proposed GA is compared with the mathematical model on the various sized test problems with respect to the solution quality and computation time. As a result, the GA demonstrates the capability of reaching solutions that are very close to those obtained by the mathematical model for small problems and stay within 3.2% from those obtained by the mathematical model for larger problems, with a much shorter computation time. Finally, we investigate the effects of the cost and operation variables on the total profit of the problem as well as the GA performance through the sensitivity analyses.

• 한국측량학회지
• /
• 제22권4호
• /
• pp.401-409
• /
• 2004

GPS를 이용한 컨데이너 모니터링 시스템은 실시간 물류추적 및 관리시스템이라 할 수 있다. GPS는 컨레이너 위치를 정확하고 신속하게 실시간으로 추적할 수 있는 시스템이다. 항만, 공항 등의 시설관리자는 효을적인 화물의 적재, 하역, 보관이 필요하고, 운송업체 또는 화물주는 최적으로 차량을 배차해야 하며, 화물분실, 운송지연 등의 문제를 사전에 예방하거나 대처할 수 있어야 한다. 본 연구에서는 GPS의 측위기법중 실시간 이동 측위 기법을 이용하여 컨테이너의 위치 및 경로를 추적하고, 실시간으로 관측함으로써 상차지에서 하차지까지의 절대위치 및 상대위치를 수치적이고 시각적으로 모니터링하였으며 컨데이너의 이동이나 정지시의 위치 정확도를 분석하였다.

• 대한교통학회지
• /
• 제21권1호
• /
• pp.65-75
• /
• 2003

교통혼잡 문제가 점점 심각해짐에 따라 대중교통의 중요성은 날로 부각되며, 대중교통을 지원하기 위한 정책들이 속속 입안되고 있어 대중교통을 심도 있게 분석할 수 있는 틀의 개발은 필연적이라 할 수 있다. 이에 본 연구는 대중교통의 특성을 고려하는 대중교통 통행배정모형의 개발을 목적으로 수행되었다. 본 연구에서 개발한 대중교통 통행배정모형은 기존의 대중교통 통행배정모형이 개별차량과 다른 대중교통의 특성을 정확히 반영하고 있지 못하다는 한계를 극복하고자, 최적경로 탐색에는 유전자 알고리즘(Genetic Algorithm)을 통행량 배정에는 로짓모형을 기반으로 한 확률적 통행량 배정모형(Stochastic Network Loading Model)을 이용하였다.

• 대한산업공학회지
• /
• 제39권6호
• /
• pp.554-561
• /
• 2013

As a special topic of the vehicle routing problems (VRP), VRPSDP extends the vehicle routing problem as considering simultaneous pickup and delivery for goods. The past studies have mainly dealt with a only weight constraint of a loading capacity for heterogeneous products. However. this study suggests VRPSDP considering separate loading area according to characteristics of loading species. The objective is to design a set of minimum distance routes for the vehicle routing assignment with independent capacity for heterogeneous species. And then we present a another HVRPSDP model which is easy to utilizes in a unique circumstance that is a guarantee of executing a task simultaneously from the various areas under restricted time and raising an application of vehicles that returns at the depot for the next mission like the military group. The optimal results of the suggested mathematical models are solved by the ILOG CPLEX software ver. 12.4 that is provided by IBM company.

• 한국군사과학기술학회지
• /
• 제20권4호
• /
• pp.566-578
• /
• 2017

For optimizing the operation plan when strike packages attack multiple targets, this article suggests a new mathematical model and a parallel hybrid genetic algorithm (PHGA) as a solution methodology. In the model, a package can assault multiple targets on a sortie and permitted the use of mixed munitions for a target. Furthermore, because the survival probability of a package depends on a flight route, it is formulated as a mixed integer programming which is synthesized the models for vehicle routing and weapon-target assignment. The hybrid strategy of the solution method (PHGA) is also implemented by the separation of functions of a GA and an exact solution method using ILOG CPLEX. The GA searches the flight routes of packages, and CPLEX assigns the munitions of a package to the targets on its way. The parallelism enhances the likelihood seeking the optimal solution via the collaboration among the HGAs.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2015년도 전력전자학술대회 논문집
• /
• pp.87-88
• /
• 2015

시중의 대형 버스 및 트럭 등 같은 경우, 부하가 아주 크다. 또한 내리막길이나 장거리 운행 시에 잦은 제동으로 인하여 마찰을 이용한 기존 방식의 브레이크들은 브레이크 파열 및 페이드 현상 때문에 제동 안전성에 문제가 있다. 이러한 제동 부담을 분담하기 위해 현재 보조브레이크(리타더)가 필수적이며, 엔진 계통의 보조브레이크가 아닌 비접촉식 브레이크 같은 친환경 보조브레이크가 요구되고 있다. 그리고 차량 제동 시 발생하는 기계에너지를 전기에너지로 회생하여 에너지효율을 향상시키려는 연구가 현재 활발히 진행되고 있다. 본 논문에서는 와전류를 이용한 전자기형 리타더에서 발생되는 전기에너지를 회수하기 위한 전압 제어 방법을 다룰 것이다. 제동에너지를 전기에너지로 회생하기 위해 L-C 공진회로로 구성하였다. 그리고 기존에 리타더에서 발생하는 전압을 간략히 다상변압기로 구현하였다. 또한 좀 더 실제 리타더와 가깝게 재현하기 위하여 유도발전기 모델로 변경하여 시뮬레이션을 진행하였다. 제어장치의 구동펄스에 따라 바뀌는 공진회로의 전압을 분석하였으며, 이 전압을 제어하기 위하여 PI 제어기를 이용한 알고리즘을 제안하였다. 끝으로 Matlab Simulink를 이용하여 리타더의 모델과 그 제어기의 타당성을 보였다.

• 한국국방경영분석학회지
• /
• 제26권1호
• /
• pp.89-99
• /
• 2000

This paper deals with a heuristic algorithm for the vehicle routing-scheduling problem to minimize the total travel distance and the total cost. Because the aim of the Clarke-Wright method, one of famous heuristic methods, is to minimize the total travel distance of vehicles, it cannot consider the cost if the cost and the travel distance is not proportional. In the Clarke-Wright method, the route of each vehicle is found by using the saving matrix which is made by an assumption that the vehicle comes back to the starting point. The problem dealt with in the paper, however, does not need the vehicle to come back because each vehicle has its hoping-start-points and hoping-destination-points. Therefore we need a different saving matrix appropriate to this occasion. We propose a method to find an initial solution by applying network simplex method after transforming the vehicle routing-scheduling problem into the minimum cost problem. Moreover, we propose a method to minimize the total travel distance by using the modified saving matrix which is appropriate to no-return occasion and the method for the case of plural types of vehicles and freights.

• 산업경영시스템학회지
• /
• 제42권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.

• 산업경영시스템학회지
• /
• 제45권4호
• /
• pp.134-141
• /
• 2022

Transportation in urban area has been getting hard to fulfill the demand on time. There are various uncertainties and obstacles related with road conditions, traffic congestions, and accidents to interrupt the on-time deliveries. With this situation, the last mile logistics has been a keen issue for researchers and practitioners to find the best strategy of the problem. A way to resolve the problem is to use parcel lockers. Parcel locker is a storage that customers can pick up their products. Transportation vehicles deliver the products to parcel lockers instead of all customer sites. Using the parcel lockers, the total delivery costs can be reduced. However, the inconvenience of customer has to increase. Thus, we have to optimal solution to balance between the total delivery costs and customers' inconvenience. This paper formulates a mathematical model to find the optimal solution for the vehicle routing problem and the location problem of parcel lockers. Experimental results provide the viability to find optimal strategy for the routing problem as well as the location problem.