A covering traveling salesman problem with profit in the last mile delivery

2021 ◽  
Author(s):  
Li Jiang ◽  
Xiaoning Zang ◽  
Junfeng Dong ◽  
Changyong Liang
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Last Mile ◽  
Last Mile Delivery

A traveling salesman problem with time windows for the last mile delivery in online shopping

2019 ◽  
Vol 58 (16) ◽  
pp. 5077-5088 ◽  
Author(s):  
Li Jiang ◽  
Mohamed Dhiaf ◽  
Junfeng Dong ◽  
Changyong Liang ◽  
Shuping Zhao
Keyword(s):  
Traveling Salesman Problem ◽  
Online Shopping ◽  
Time Windows ◽  
Traveling Salesman ◽  
Last Mile ◽  
Last Mile Delivery

scholarly journals New model of flying sidekick traveling salesman problem with a charge-station

2017 ◽  
Author(s):  
◽  
Pengkun Zhou
Keyword(s):  
Transportation Cost ◽  
Traveling Salesman ◽  
Delivery Problem ◽  
Time Consumption ◽  
Consumption Data ◽  
Last Mile ◽  
A Charge ◽  
Last Mile Delivery ◽  
Future Work ◽  
First Time

Cooperation between a truck and a drone for last-mile delivery has been viewed as a way to help make more efficient ways of delivery of packages because of the great advantage of drones delivery. This problem was described and formulated a as FSTSP by Maurry and Chu. Because of the weakness concerning drones' batteries lifespan, this paper proposed a new delivery scenario in which a charge-station will be applied in the truck-drone delivery network to increase the performance of the last-mile delivery. This new delivery problem is formulated for the first time in this thesis as a multi-objective problem. The purpose of this is to address both transportation cost and total time consumption. Data analysis is conducted to explore the relation between factors and the overall objective. The analysis shows that a charge-station will significantly increase the performance of the last-mile delivery. Lastly, future work is discussed that will enhance the model even more and possibly lead to better ways to use drones for delivery.

scholarly journals Exact Methods for the Traveling Salesman Problem with Drone

2021 ◽  
Vol 55 (2) ◽  
pp. 315-335
Author(s):  
Roberto Roberti ◽  
Mario Ruthmair
Keyword(s):  
Dynamic Programming ◽  
Traveling Salesman Problem ◽  
State Of The Art ◽  
The State ◽  
Set Partitioning ◽  
Traveling Salesman ◽  
Mixed Integer ◽  
Branch And Price ◽  
Last Mile ◽  
The Traveling Salesman Problem

Efficiently handling last-mile deliveries becomes more and more important nowadays. Using drones to support classical vehicles allows improving delivery schedules as long as efficient solution methods to plan last-mile deliveries with drones are available. We study exact solution approaches for some variants of the traveling salesman problem with drone (TSP-D) in which a truck and a drone are teamed up to serve a set of customers. This combination of truck and drone can exploit the benefits of both vehicle types: the truck has a large capacity but usually low travel speed in urban areas; the drone is faster and not restricted to street networks, but its range and carrying capacity are limited. We propose a compact mixed-integer linear program (MILP) for several TSP-D variants that is based on timely synchronizing truck and drone flows; such an MILP is easy to implement but nevertheless leads to competitive results compared with the state-of-the-art MILPs. Furthermore, we introduce dynamic programming recursions to model several TSP-D variants. We show how these dynamic programming recursions can be exploited in an exact branch-and-price approach based on a set partitioning formulation using ng-route relaxation and a three-level hierarchical branching. The proposed branch-and-price can solve instances with up to 39 customers to optimality outperforming the state-of-the-art by more than doubling the manageable instance size. Finally, we analyze different scenarios and show that even a single drone can significantly reduce a route’s completion time when the drone is sufficiently fast.

scholarly journals Identifying the Optimal Packing and Routing to Improve Last-Mile Delivery Using Cargo Bicycles

Energies ◽  
2021 ◽  
Vol 14 (14) ◽  
pp. 4132
Author(s):  
Vitalii Naumov ◽  
Michał Pawluś
Keyword(s):  
Supply Chain ◽  
Traveling Salesman ◽  
Optimal Packing ◽  
Python Programming Language ◽  
Last Mile ◽  
Different Types ◽  
Urbanized Areas ◽  
Efficient Packing ◽  
Last Mile Delivery ◽  
Python Programming

Efficient vehicle routing is a major concern for any supply chain, especially when dealing with last-mile deliveries in highly urbanized areas. In this paper problems considering last-mile delivery in areas with the restrictions of motorized traffic are described and different types of cargo bikes are reviewed. The paper describes methods developed in order to solve a combination of problems for cargo bicycle logistics, including efficient packing, routing and load-dependent speed constraints. Proposed models apply mathematical descriptions of problems, including the Knapsack Problem, Traveling Salesman Problem and Traveling Thief Problem. Based on synthetically generated data, we study the efficiency of the proposed algorithms. Models described in this paper are implemented in Python programming language and will be further developed and used for solving the problems of electric cargo bikes’ routing under real-world conditions.

Grafos hamiltonianos aplicado al turismo de Panamá

2019 ◽  
Vol 7 (1) ◽  
pp. 109-113
Author(s):  
Julio Trujillo
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman

Un problema clásico de Teoría de Grafos es encontrar un camino que pase por varios puntos, sólo una vez, empezando y terminando en un lugar (camino hamiltoniano). Al agregar la condición de que sea la ruta más corta, el problema se convierte uno de tipo TSP (Traveling Salesman Problem). En este trabajo nos centraremos en un problema de tour turístico por la ciudad de Panamá, transformándolo a un problema de grafo de tal manera que represente la situación planteada.

Sign in / Sign up

Export Citation Format

Share Document