Optimal delivery routing with wider drone-delivery areas along a shorter truck-route
| Autor: | Hyun Jung Lee, Yong Sik Chang |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Truck
050210 logistics & transportation 021103 operations research Computer science Distributed computing 05 social sciences 0211 other engineering and technologies General Engineering 02 engineering and technology Travelling salesman problem Drone Computer Science Applications Nonlinear programming Artificial Intelligence 0502 economics and business Routing (electronic design automation) Cluster analysis |
| Zdroj: | Expert Systems with Applications. 104:307-317 |
| ISSN: | 0957-4174 |
| DOI: | 10.1016/j.eswa.2018.03.032 |
| Popis: | While convergent technology has been booming recently, drones are being applied in various fields of industry and are expected to be used as a commercial delivery method. In a delivery system, routing becomes one of the major issues, and several studies have attempted to solve drone-based routing problems. In this study, we focus on finding an effective delivery route for trucks carrying drones. To put it concretely, we propose a new approach on a nonlinear programming model to find shift-weights that move the centers of clusters to make for wider drone-delivery areas along shorter truck-route after initial K-means clustering and TSP (Traveling Salesman Problem) modeling. In order to verify the effectiveness of the proposed model with shift-weights, we compare it with two other delivery route approaches. One is a route without shift-weights after K-means clustering and TSP modeling, and the other is a route by TSP for all delivery locations without K-means clustering. Through experimental results of paired t-tests on randomly generated delivery locations, we show that our proposed model is more effective than the other two models. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect