• 산업경영시스템학회지
• /
• 제41권4호
• /
• pp.138-145
• /
• 2018

In the field of optimization, many studies have been performed on various types of Vehicle Routing Problem (VRP) for a long time. A variety of models have been derived to extend the basic VRP model, to consider multiple truck terminal, multiple pickup and delivery, and time windows characteristics. A lot of research has been performed to find better solutions in a reasonable time for these models with heuristic approaches. In this paper, by considering realtime traffic characteristics in Map Navigation environment, we proposed a method to manage realistic optimal path allocation for the logistics trucks and cargoes, which are dispersed, in order to realize the realistic cargo mixing allowance and time constraint enforcement which were required as the most important points for an online logistics brokerage service company. Then we developed a prototype system that can support above functionality together with delivery status monitoring on Map Navigation environment. First, through Map Navigation system, we derived information such as navigation-based travel time required for logistics allocation scheduling based on multiple terminal multiple pickup and delivery models with time constraints. Especially, the travel time can be actually obtained by using the Map Navigation system by reflecting the road situation and traffic. Second, we made a mathematical model for optimal path allocation using the derived information, and solved it using an optimization solver. Third, we constructed the prototype system to provide the proposed method together with realtime logistics monitoring by arranging the allocation results in the Map Navigation environment.

• 산업경영시스템학회지
• /
• 제46권2호
• /
• pp.160-167
• /
• 2023

This study focuses on the development of a Last-Mile delivery service using unmanned vehicles to deliver goods directly to the end consumer utilizing drones to perform autonomous delivery missions and an image-based precision landing algorithm for handoff to a robot in an intermediate facility. As the logistics market continues to grow rapidly, parcel volumes increase exponentially each year. However, due to low delivery fees, the workload of delivery personnel is increasing, resulting in a decrease in the quality of delivery services. To address this issue, the research team conducted a study on a Last-Mile delivery service using unmanned vehicles and conducted research on the necessary technologies for drone-based goods transportation in this paper. The flight scenario begins with the drone carrying the goods from a pickup location to the rooftop of a building where the final delivery destination is located. There is a handoff facility on the rooftop of the building, and a marker on the roof must be accurately landed upon. The mission is complete once the goods are delivered and the drone returns to its original location. The research team developed a mission planning algorithm to perform the above scenario automatically and constructed an algorithm to recognize the marker through a camera sensor and achieve a precision landing. The performance of the developed system has been verified through multiple trial operations within ETRI.

• 한국시뮬레이션학회논문지
• /
• 제23권4호
• /
• pp.97-109
• /
• 2014

Personal Rapid Transit (PRT)는 차세대 대중교통 수단으로 에너지 효율적이며 높은 수준의 고객 서비스를 제공한다. 정류장에 동적으로 도착한 고객이 운송 서비스를 요청하면 PRT 시스템은 차량을 배차한다. 본 연구에서는 PRT 시스템을 위한 새로운 온라인 배차 알고리즘을 제시하였다. 제시된 알고리즘은 최근린(nearest neighbor) 배차 규칙을 기반으로 개발되었으며, 이분 매칭(bipartite matching)을 사용하여 다수의 PRT 차량과 고객을 동시에 고려하여 배차를 결정한다. 이 경우 전체 차량 중 배차 대상 차량의 선택 범위가 성능지표에 영향을 줄 수 있다. 따라서 본 연구에서는 차량의 상태를 고려하여 체계적으로 배차 차량을 선택하는 방법을 제시한다. 성능지표로 공차 이동거리와 고객 대기시간을 고려하였으며, 시뮬레이션 기법을 사용하여 배차 선택 범위에 따른 성능지표의 차이를 확인하였다. 그리고 기존의 배차 규칙과 비교하여 본 연구에서 제시하는 방법론이 우수하며 PRT 시스템에 적합한 것을 확인하였다.

• 전기학회논문지
• /
• 제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.