• 디지털융복합연구
• /
• 제15권10호
• /
• pp.31-43
• /
• 2017

본 연구는 DEA의 CCR/BCC 모형과 Malmquist 생산성 지수를 이용하여 택배 서브터미널 위수탁 대리점의 운영효율성을 분석했다. 투입변수로는 종업원수, 장비수, 영업비용을 선정하였으며 산출변수는 매출액을 선정하여 2014년부터 2016년 기간의 효율성을 분석하였다. 연구결과 CCR 모형과 BCC모형 모두 2014년 대비 2016년 효율성이 좋아졌으며 벤치마킹 분석결과 2016년 기준 DMU1과 DMU7이 가장 효율성이 좋은 것으로 나타났다. 또한 BCC 모형 기준 비효율성 분석결과 2014년 기준 2016년 모든 요소별 효율성이 증가한 것으로 나타났다. Malmquist 분석결과 MPI지수는 기술변화에 영향을 받아 소폭 하락하였으며 모든 DMU에서 기술퇴보가 이루어지고 있는 것으로 나타났다. 본 연구는 택배에 대한 인식을 제고하고 그동안 논문에서 다루지 않았던 서브터미널 위수탁 대리점의 실제 운영효율성을 분석하였으며 그 결과 위수탁 대리점에 대한 정부의 제도개선 및 지원정책이 필요함을 시사점으로 제시하였다. 본 연구는 파주, 김포의 신도시 택배대리점을 기준으로 분석을 수행하였다. 따라서 향후 분석범위를 타도시 및 구도심으로 넓혀 신도시와의 비교를 통한 효율성분석을 수행해야 한다.

• 한국경영과학회지
• /
• 제31권2호
• /
• pp.141-155
• /
• 2006

In this paper, we address an extended hub-and-spoke transportation network design problem (EHSNP). In the existing hub location problems, the location and number of spokes, and shipments on spokes are given as input data. These may, however, be viewed as the variables according to the areas which they cover. Also, the vehicle routing in each spoke needs to be considered to estimate the network cost more correctly. The EHSNP is a problem of finding the location of hubs and spokes, and pickup/delivery routes from each spoke, while minimizing the total related transportation cost in the network. The EHSNP is an integrated problem that consists of several interrelated sub-problems. To solve EHSNP, we present an approach based on a symbiotic evolutionary algorithm (symbiotic EA), which are known as an efficient tool to solve complex integrated optimization problems. First, we propose a framework of symbiotic EA for EHSNP and its genetic elements suitable for each sub-problem. To analyze the proposed algorithm, the extensive experiments are performed with various test-bed problems. The results show that the proposed algorithm is promising in solving the EHSNP.

• 전기학회논문지
• /
• 제64권11호
• /
• pp.1578-1586
• /
• 2015

Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

• 산업공학
• /
• 제17권1호
• /
• pp.71-77
• /
• 2004

At the present time, container transportation plays a key role in the international logistics and the efforts to increase the productivity of container logistics become essential for Korean trucking companies to survive in the domestic as well as global competition. This study suggests an approach for determining fleet size for container road transportation with dynamic demand. Usually the vehicles operated by the transportation trucking companies in Korea can be classified into three types depending on the ways how their expenses occur; company-owned truck, mandated truck which is owned by outsider who entrust the company with its operation, and rented vehicle (outsourcing). Annually the trucking companies should decide how many company-owned and mandated trucks will be operated considering vehicle types and the transportation demands. With the forecasted monthly data for the volume of containers to be transported a year, a heuristic algorithm using tabu search is developed to determine the number of company-owned trucks, mandated trucks, and rented trucks in order to minimize the expected annual operating cost. The idea of the algorithm is based on both the aggregate production planning (APP) and the pickup-and-delivery problem (PDP). Finally the algorithm is tested for the problem how the trucking company determines the fleet size for transporting containers.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1248-1251
• /
• 2002

Logistics optimization problems related with vehicle routing such as warehouse locating, track scheduling, customer order delivery, wastage pickup etc. are very interesting and important issues to date. Many Vehicle Routing and Scheduling Systems (VRSS) have been developed/proposed to optimize the logistics problems. But majority of them are dedicated to a particular problem and are unable to handle the real world spatial data directly. The system developed for one problem may not be suitable for others due to inter-problem constraint variations. The constraints may include geographical, environmental and road traffic nature of the working region along with other constraints related with the problem. So the developer always needs to modify the original routing algorithm in order to fulfill the purpose. In our study, we propose a general-purpose platform by combining GIS road map and Database Management System (DBMS), so that VRSS can interact with real world spatial data directly to solve different kinds of vehicle routing problems. Using the features of our developed system, the developer can frequently modify the existing algorithm or create a new one to serve the purpose.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.171-178
• /
• 2002

At the present time, container transportation plays a key role in the international logistics and the efforts to increase the productivity of container logistics become essential for Korean trucking companies to survive in the domestic as well as global competition. This study suggests an approach for determining fleet size for container road transportation with dynamic demand. Usually the vehicles operated by the transportation trucking companies in Korea can be classified into three types depending on the ways how their expenses occur; company-owned truck, mandated truck which is owned by outsider who entrust the company with its operation, and rented vehicle (outsourcing). Armually the trucking companies should decide how many company-owned and mandated trucks will be operated considering vehicle types and the transportation demands. With the forecasted monthly data for the volume of containers to be transported a year, a heuristic algorithm using tabu search is developed to determine the number of company-owned trucks, mandated trucks, and rented trucks in order to minimize the expected annual operating cost The idea of the algorithm is based on both the aggregate production planning (APP) and the pickup-and-delivery problem (PDP). Finally the algorithm is tested for the problem how the trucking company determines the fleet size for transporting containers.

• 대한교통학회지
• /
• 제22권2호
• /
• pp.145-154
• /
• 2004

본 논문에서는 실시간으로 화물차량의 위치와 상태정보가 의사결정자에게 전달되며 핸드폰 등을 이용하여 의사결정자와 운전자의 쌍방향 의사소통이 가능한 시스템 하에서 동적으로 들어오는, 즉 미리 알 수 없는 운송의뢰에 대하여 즉각적으로 최적의 차량운행 계획을 수립하고 이를 새로운 정보에 따라 지속적으로 개선할 수 있는 알고리즘을 개발하였다. 이러한 동적 시스템 하에서 운송의뢰의 성격은 TL(truckload)로 한정하였으며 각 화물은 출발지, 도착지 그리고 배송에 대한 시간제약이 주어진다. 의사결정자는 이러한 화물에 대한 정보를 미리 알지 못하며 인터넷이나 전화 등의 매체를 이용하여 운송의뢰가 들어오는 즉시 운송가능여부를 응답하고 주어진 운송의뢰를 최적의 차량에 배당하며 각 차량에 대한 최적의 운송계획을 수립한다. 이러한 차량의 운송계획은 새로운 정보나 상황에 따라 변화할 수 있다. 이러한 동적 문제에 대하여 본 논문에서는 휴리스틱적 방법론과 최적화 기법의 장점을 취합한 2단계 하이브리드 알고리즘을 제시하고 대규모의 차량군을 다룰 수 있는 기법을 개발하였다. 또한 제안된 다양한 알고리즘에 대하여 시뮬레이션을 통한 실험결과를 제시한다.