Traveling Salesman Problem With a Drone Station

Savkin

2020

Sensors

This paper proposes a novel parcel delivery system which consists of a drone and public transportation vehicles such as trains, trams, etc. This system involves two delivery schemes: drone-direct scheme referring to delivering to a customer by a drone directly and drone–vehicle collaborating scheme referring to delivering a customer based on the collaboration of a drone and public transportation vehicles. The fundamental characteristics including the delivery time, energy consumption and battery recharging are modelled, based on which a time-dependent scheduling problem for a single drone is formulated. It is shown to be NP-complete and a dynamic programming-based exact algorithm is presented. Since its computational complexity is exponential with respect to the number of customers, a sub-optimal algorithm is further developed. This algorithm accounts the time for delivery and recharging, and it first schedules the customer which leads to the earliest return. Its computational complexity is also discussed. Moreover, extensive computer simulations are conducted to demonstrate the scheduling performance of the proposed algorithms and the impacts of several key system parameters are investigated.

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Scheduling of a Parcel Delivery System Consisting of an Aerial Drone Interacting with Public Transportation Vehicles

Savkin

2020

Sensors

“…Kesulitan pada pendistribusian vehicle routing problem (vrp) membentuk salah satu pemecahan masalah untuk mencari rute dengan meminimumkan dari suatu gudang ke toko yang memiliki lokasi yang berbeda dengan jumlah permintaan yang berbeda-beda [5]. NN juga digunakan untuk permasalahan traveling salesman problem [6], efisiensi latensi [7] dan penentuan rute dari satu kota kemudian mendatangi kota lain [8]. Penyelesaian distribusi barang dalam penelitian ini menggunakan algoritma NN.…”

Section: Pendahuluanunclassified

Penentuan Rute Pengiriman Barang Dengan Metode Nearest Neighbor

Martono¹,

Warnars²

2020

petir

Semakin cepat barang sampai ke konsumen maka menjadi lebih mudah untuk mendapatkan barang dan keuntungan perusahaan semakin bertambah. Pada pendistribusian membentuk salah satu pemecahan masalah untuk mencari rute dengan meminimumkan jarak dari lokasi gudang ke toko dan memiliki jumlah permintaan barang yang berbeda-beda. Menggunakan metode nearest neighbor untuk menyelesaikan penentuan rute distribusi barang dari gudang ke toko, dengan tujuan mengurangi total jarak pengiriman, waktu dan beban biaya yang dibebani perusahaan. Hasil pencarian rute menggunakan metode nearest neighbor menghasilkan jumlah rute paling sedikit dibandingkan dengan sebelum menggunakan metode dan pada total jarak dengan menggunakan metode 98610 meter atau 98,61 km sedangkan jika pada rute sebelum mengunakan metode 124198 meter atau 124,198 km terjadi pengurangan jarak 25588 atau 25,588 atau sebesar 20.6026 %.

“…However, those approaches are not suitable for dealing with persistent UAV services for the following reasons. First of all, those approaches do not allow multiple trips of multiple UAVs (see [12][13][14][15][16][17][18]49,50]). In other words, the mathematical models consider a single trip of a vehicle.…”

Section: Phase I: Mathematical Optimization With Multiple Depots and Tripsmentioning

confidence: 99%

“…However, this persistence cannot be achieved using the previous mathematical models. Second, even though a target delivery area is usually large and vast, the previous mathematical models postulate that UAVs must start their services from their home depots and return to the home depots after services (see [12][13][14][15]49,50]). This home depot dependency Sustainability 2019, 11, 5932 6 of 15 limits the service flexibility and is not suitable for providing logistic services in a large area.…”

Section: Phase I: Mathematical Optimization With Multiple Depots and Tripsmentioning

confidence: 99%

Mathematical Investigation on the Sustainability of UAV Logistics

et al. 2019

Unmanned aerial vehicles (UAVs) are expected to make groundbreaking changes in the logistics industry. Leading logistics companies have been developing and testing their usage of UAVs recently as an environmentally friendly and cost-effective option. In this paper, we investigate how much the UAV delivery service is environmentally friendly compared to the traditional ground vehicle (GV) delivery service. Since there are fuel (battery) and loadable weight restrictions in the UAV delivery, multi-hopping of UAV is necessary, which may cause a large consumption of electrical energy. We present a two-phase approach. In Phase I, a new vehicle routing model to obtain optimal delivery schedules for both UAV-alone and GV-alone delivery systems is proposed, which considers each system's restrictions, such as the max loadable weight and fuel replenishment. In Phase II, CO 2 emissions are computed as a sustainability measure based on the travelling distance of the optimal route obtained from Phase I, along with various GV travel-speeds. A case study finds that the UAV-alone delivery system is much more CO 2 efficient in all ranges of the GV speeds investigated.