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 A Disruption Recovery Problem with Time Windows Change in the Last Mile Delivery of Online Shopping

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Li Jiang ◽  
Changyong Liang ◽  
Junfeng Dong ◽  
Wenxing Lu ◽  
Marko Mladenovic
Keyword(s):  
Online Shopping ◽  
Time Window ◽  
Time Windows ◽  
Home Delivery ◽  
Delivery Mode ◽  
Variable Neighborhood Descent ◽  
Last Mile ◽  
Last Mile Delivery ◽  
Disruption Recovery ◽  
Recovery Problem

Frequent time window changing disruptions result in high secondary delivery rates in the last mile delivery. With the rapid growth of parcel volumes in online shopping, the time window changing disruptions could translate to substantial delivery cost-wastes. In recent years, customer pickup (CP), a new delivery mode that allows customers to pick up their parcels from shared delivery facilities, has provided a new way to deal with such disruptions. This study proposed a disruption recovery problem with time windows change in the last mile delivery in which customers can be served through home delivery (HD) or CP. A variant variable neighborhood descent (VVND) algorithm was presented to solve the problem. Computational experiments based on a set of instances were tested, and results were compared with other heuristics in the literature, which have affirmed the competitiveness of the model and algorithm.

scholarly journals An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

1995 ◽  
Vol 43 (2) ◽  
pp. 367-371 ◽  
Author(s):  
Yvan Dumas ◽  
Jacques Desrosiers ◽  
Eric Gelinas ◽  
Marius M. Solomon
Keyword(s):  
Traveling Salesman Problem ◽  
Optimal Algorithm ◽  
Time Windows ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

1998 ◽  
Vol 46 (3) ◽  
pp. 330-335 ◽  
Author(s):  
Michel Gendreau ◽  
Alain Hertz ◽  
Gilbert Laporte ◽  
Mihnea Stan
Keyword(s):  
Traveling Salesman Problem ◽  
Time Windows ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem ◽  
Insertion Heuristic

scholarly journals Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows

Technologies ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 61 ◽  
Author(s):  
Christos Papalitsas ◽  
Theodore Andronikos
Keyword(s):  
Traveling Salesman Problem ◽  
Optimization Problems ◽  
Time Windows ◽  
Experimental Information ◽  
Traveling Salesman ◽  
Neighborhood Search ◽  
Np Hard ◽  
The Novel ◽  
Global Positioning ◽  
The Traveling Salesman Problem

GVNS, which stands for General Variable Neighborhood Search, is an established and commonly used metaheuristic for the expeditious solution of optimization problems that belong to the NP-hard class. This paper introduces an expansion of the standard GVNS that borrows principles from quantum computing during the shaking stage. The Traveling Salesman Problem with Time Windows (TSP-TW) is a characteristic NP-hard variation in the standard Traveling Salesman Problem. One can utilize TSP-TW as the basis of Global Positioning System (GPS) modeling and routing. The focus of this work is the study of the possible advantages that the proposed unconventional GVNS may offer to the case of garbage collector trucks GPS. We provide an in-depth presentation of our method accompanied with comprehensive experimental results. The experimental information gathered on a multitude of TSP-TW cases, which are contained in a series of tables, enable us to deduce that the novel GVNS approached introduced here can serve as an effective solution for this sort of geographical problems.

Sign in / Sign up

Export Citation Format

Share Document