{"title":"A contextual framework for learning routing experiences in last-mile delivery","authors":"Huai Jun (Norina) Sun, Okan Arslan","doi":"10.1016/j.trb.2025.103172","DOIUrl":null,"url":null,"abstract":"<div><div>This paper presents a contextual framework for solving the experience-driven traveling salesman problem in last-mile delivery. The objective of the framework is to generate routes similar to historic high-quality ones as classified by operational experts by considering the unstructured and complex features of the last-mile delivery operations. The framework involves learning a transition weight matrix and using it in a TSP solver to generate high quality routes. In order to learn this matrix, we use descriptive analytics to extract and select important features of the high-quality routes from the data. We present a <em>rule-based method</em> using such extracted features. We then introduce a factorization of the transition weight matrix by features, which reduces the dimensions of the information to be learned. In the predictive analytics stage, we develop (1) <em>Score Guided Coordinate Search</em> as a derivative-free optimization algorithm, and (2) <em>label-guided methods</em> inspired by supervised learning algorithms for learning the routing preferences from the data. Any hidden preferences that are not obtained in the descriptive analytics are captured at this stage. Our approach allows us to blend the advantages of different facets of data science in a single collaborative framework, which is effective in generating high-quality solutions for a last-mile delivery problem. We test the efficiency of the methods using a case study based on Amazon Last-Mile Routing Challenge organized in 2021. A preliminary version of our rule-based method received the third place and a $25,000 award in the challenge. In this paper, we improve the learning performance of our previous methods through predictive analytics, while ensuring that the methods are effective, interpretable and flexible. Our best performing algorithm improves the performance of our rule-based method on an out-of-sample testing dataset by more than 23.1%.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"194 ","pages":"Article 103172"},"PeriodicalIF":5.8000,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0191261525000219","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents a contextual framework for solving the experience-driven traveling salesman problem in last-mile delivery. The objective of the framework is to generate routes similar to historic high-quality ones as classified by operational experts by considering the unstructured and complex features of the last-mile delivery operations. The framework involves learning a transition weight matrix and using it in a TSP solver to generate high quality routes. In order to learn this matrix, we use descriptive analytics to extract and select important features of the high-quality routes from the data. We present a rule-based method using such extracted features. We then introduce a factorization of the transition weight matrix by features, which reduces the dimensions of the information to be learned. In the predictive analytics stage, we develop (1) Score Guided Coordinate Search as a derivative-free optimization algorithm, and (2) label-guided methods inspired by supervised learning algorithms for learning the routing preferences from the data. Any hidden preferences that are not obtained in the descriptive analytics are captured at this stage. Our approach allows us to blend the advantages of different facets of data science in a single collaborative framework, which is effective in generating high-quality solutions for a last-mile delivery problem. We test the efficiency of the methods using a case study based on Amazon Last-Mile Routing Challenge organized in 2021. A preliminary version of our rule-based method received the third place and a $25,000 award in the challenge. In this paper, we improve the learning performance of our previous methods through predictive analytics, while ensuring that the methods are effective, interpretable and flexible. Our best performing algorithm improves the performance of our rule-based method on an out-of-sample testing dataset by more than 23.1%.
期刊介绍:
Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.