선택한 단어 수는 입니다.
최소 단어 이상 선택하여야 합니다.
최소 단어 이상 선택하여야 합니다.
선택한 단어 수는 30입니다.
최대 10 단어까지만 선택 가능합니다.
최대 10 단어까지만 선택 가능합니다.
제안 방법
- The objective of this research is to create effective routing for drone’s paths by applying genetic algorithm and nearest neighbor algorithm and compare the performance of the algorithms.
- This experiment involves three algorithms: Genetic Algorithm, Nearest Neighbor Modified and Random FIFO. We use five different instances of customers and two package loading capacity instances.
- In this paper, we present an approach for solving drone routing problem for package delivery service using two different heuristics, genetic and nearest neighbor algorithms. We use different instances of customers and package loading capacity and measure average tour length of each algorithm for each instance.
이론/모형
- The solution to this problem is achieved by implementing two heuristics algorithms: genetic and nearest neighbor algorithms and comparing to random FIFO algorithm.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.