A traveling salesman problem with time windows for the last mile delivery in online shopping. Issue 16 (17th August 2020)

• Record Type: Journal Article
• Authors: Jiang, Li; Dhiaf, Mohamed; Dong, Junfeng; Liang, Changyong; Zhao, Shuping
• Is Part Of: International journal of production research. Volume 58:Issue 16(2020)
• Page Start: 5077
• Page End: 5088
• Publication Date: 2020-08-17
• Subjects: Traveling salesman problem -- time windows -- last mile delivery -- GVNS -- shared delivery facility; Factory management -- Periodicals; 658.57
• DOI: 10.1080/00207543.2019.1656842
• Languages: English
• ISSNs: 0020-7543

Abstract

Abstract : With the fast growth of the parcel volume of online shopping, home delivery (delivering parcels to customers' homes or workplaces) has accentuated the pressure on last mile delivery actors. Customer pickup, which allows customers to pick up their parcels from shared delivery facilities near them, has become widely popular. This study introduces a novel travelling salesman problem with time windows for the last mile delivery in online shopping. The purpose is to find a minimum cost tour over given customers and/or shared delivery facilities (SDFs) in which unvisited customers are assigned to the SDFs. A general variable neighbourhood search heuristic is developed to solve the problem. Computational results corroborate that the proposed heuristic is competitive relative to well-known algorithms.