• Advances in aircraft and spacecraft science
• /
• 제10권5호
• /
• pp.393-418
• /
• 2023

Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2016년도 춘계학술발표대회
• /
• pp.168-170
• /
• 2016

Drone package delivery routing problem is realistic problem used to find efficient route of drone package delivery service. In this paper, we present an approach for solving drone routing problem for package delivery service using two different heuristics algorithms, genetic and nearest neighbor. We implement and analyze both heuristics algorithms for solving the problem efficiently with respect to cost and time. The respective experimental results show that for the range of customers 10 to 50 nearest neighbor and genetic algorithms can reduce the tour length on average by 34% and 40% respectively comparing to FIFO algorithm.

• Korean Chemical Engineering Research
• /
• 제58권3호
• /
• pp.450-457
• /
• 2020

선행된 연구에서 Yo-Pro-1의 전달 효율의 경향과 CFP 유전자의 발현 효율의 경향이 큰 차이를 보였지만 이 문제에 대한 원인을 제시할 수 없었다. 따라서 본 연구에서는 형광 염료를 이용하여 DNA에 표지 후 전달 효율을 정량화함으로써 이 문제에 대한 원인을 찾고자 한다. 표지를 위한 형광 염료로 Yo-Pro-1을 사용하였으며, Yo-Pro-1과 표지 된 DNA의 전달 효율을 비교하였다. 전압 조건에 따른 전달효율 비교에서는 Yo-Pro-1과 Yo-Pro-1으로 표지 된 DNA의 전달 효율 모두 96 V에서 전달 효율이 최대가 되었으며 전압이 더 증가하면 전달 효율이 오히려 감소하는 경향을 보였다. 전압 인가 횟수 조건에 따른 전달 효율 비교에서는 Yo-Pro-1과 Yo-Pro-1으로 표지 된 DNA의 두 전달 물질 모두 8회의 전압 인가 횟수에서 전달 효율이 최대가 되었으며 전압 인가 횟수가 더 증가하면 전달 효율이 감소하는 경향을 보였다. 두 결과를 통해 디지털 전기천공시스템에서 Yo-Pro-1을 사용한 전달 효율 측정이 DNA의 전달 효율을 잘 대변하는 것을 확인하였다. 또한, 본 연구의 결과를 통해 선행된 연구에서 보인 Yo-Pro-1의 전달 효율의 경향과 CFP 유전자의 발현 효율의 경향 차이는 전달 물질의 전달 효율 차이에서 기인한 결과가 아닌 전달 된 유전 물질의 발현 과정에서의 문제로 인한 결과임을 추론해 볼 수 있었다.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.16-22
• /
• 2019

After Dantzig and Rasmer introduced Vehicle Routing Problem in 1959, this field has been studied with numerous approaches so far. Classical Vehicle Routing Problem can be described as a problem of multiple number of homogeneous vehicles sharing a same starting node and having their own routes to meet the needs of demand nodes. After satisfying all the needs, they go back to the starting node. In order to apply the real world problem, this problem had been developed with additional constraints and pick up & delivery model is one of them. To enhance the effectiveness of pick up & delivery, hub became a popular concept, which often helps reducing the overall cost and improving the quality of service. Lots of studies have suggested heuristic methods to realize this problem because it often becomes a NP-hard problem. However, because of this characteristic, there are not many studies solving this problem optimally. If the problem can be solved in polynomial time, optimal solution is the best option. Therefore, this study proposes a new mathematical model to solve this problem optimally, verified by a real world problem. The main improvements of this study compared to real world case are firstly, make drivers visit every nodes once except hub, secondly, make drivers visit every nodes at the right time, and thirdly, make drivers start and end their journey at their own homes.

• 한국경영과학회지
• /
• 제31권4호
• /
• pp.35-47
• /
• 2006

This paper considers an integrated scheduling problem for consecutive production and delivery stages in a two-stage supply chain. The Production is performed on a single facility and then the finished products are delivered to the customer by capacitated multiple vehicles. The objective of this paper is to obtain job sequencing and delivery batching minimizing the total cost of the associated WIP inventory, finished product inventory and delivery. The inventory cost is characterized by the sum of weighted flowtime. The delivery cost is proportional to the required number of delivery batches. Some polynomial-solvable cases are derived. For the general case, two efficient heuristic algorithms are suggested, and then the heuristics are tested through some numerical experiments.

• 경영과학
• /
• 제19권2호
• /
• pp.75-89
• /
• 2002

According to the fast-paced environment of information technology and improving customer services, the design activities of logistics systems improve customer centric services and delivery performance implementing e-logistics system. The fundamental design issues that arise in the delivery system planning are optimizing the system with minimum cost and maximum throughput and service level. This study is concerned with the integrated model development of delivery system with customer responsive service level for DCM, Demand Chain Management. We used a two-step approach for this study. First, we formulated the supply. center facility planning using stochastic set-covering problem and assigned the customers to the supply center using clustering algorithm. Second, we developed vehicle delivery planning for a supply center based on GIS, GIS-VRP. Also we developed a GUI-type computer program for proposed method for supply center problem using GIS and Geo-DataBase of Busan area. The computational results showed that the proposed method was very effective on a set of test problems.

• 대한산업공학회지
• /
• 제33권1호
• /
• pp.33-43
• /
• 2007

The pickup and delivery problem with time windows generally involves the construction of optimal routeswhich satisfy a set of transportation requests under pairing, precedence, time window, vehicle capacity, andavailability constraints. In this paper, we added some constraints to the problem and adopted an objectivefunction based on number of used vehicles, total travel distance and total schedule duration to consider morerealistic problems. A branch and price algohthm for the problem is proposed and an enumeration method is usedfor the subproblems. The algorithm was tested on randomly generated instances and computational results werereported.

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

A sweep-based heuristic using common area is developed for multi-vehicle VRPs under time various and unsymmetric forward and backward vehicle moving speed. One depot and 2 delivery vehicle are assumed in this research to make the problem solving strategy simple. A common area is held to make adjustment of possible unbalance of between two vehicle delivery completion times. The 4 time zone heuristic is used to solve for efficient delivery route for each vehicle. The current size of common area needs to be studied for better results, but the suggested problem solving procedures can be expanded for any number of vehicles.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.284-287
• /
• 2006

We consider the transportation problem of optimizing the use of trailers and tractors. Several variants with fixed loading and unloading time are discussed. We show that the variant requiring on-time delivery can be solved in polynomial time, whereas the other variant requiring time-window delivery is NP-hard. We also discuss that if the number of loading and unloading operations assigned to each trailer or tractor is limited, even the variant requiring on-time delivery becomes NP-hard.

• 한국군사과학기술학회지
• /
• 제11권1호
• /
• pp.15-24
• /
• 2008

The data delivery confirmation method of MIL-STD-188-220C, which is a tactical wireless mobile Ad-Hoc communication protocol, is that a source node requires the end-to-end ack from all destination nodes and the data-link ack from 1-hop neighboring destination nodes and relaying nodes, regardless of the hop distance from a source node to destination nodes. This method has the problem to degrade the whole communication network performance because of excessive data traffic due to the duplicate use of end-to-end ack and data-link ack, and the collision among end-to-end acks on the wireless network in the case of confirming a data delivery within an 1-hop distance. In order to solve this problem, this paper has proposed the method to perform the data delivery confirmation with the improvement of communication network performance through the data traffic reduction by achieving the reliable data delivery confirmation requiring the only data-link ack within an 1-hop distance. The effects of the proposed method are analyzed in the two aspects of the data delivery confirmation delay time and the data delivery confirmation success ratio.