A template‐based adaptive large neighborhood search for the consistent vehicle routing problem. Issue 1 (1st October 2013)

• Record Type: Journal Article
• Authors: Kovacs, Attila A.; Parragh, Sophie N.; Hartl, Richard F.; Parragh, Sophie N.
• Is Part Of: Networks. Volume 63:Issue 1(2014:Jan.)
• Page Start: 60
• Page End: 81
• Publication Date: 2013-10-01
• Subjects: Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21522
• Languages: English
• ISSNs: 0028-3045

Abstract

<abstract abstract-type="main"> <title>Abstract–</title> <p>The importance of customer satisfaction was identified by many industries as a key factor of competitive advantage. So, for companies in the small package shipping industry, it can be reasonable to increase the service quality even at the expense of transportation cost to gain customer loyalty. These companies noticed that customer satisfaction can be increased by providing consistent service in the form of visiting customers with the same driver at approximately the same time of the day over a certain time period. Motivated by this real‐world problem, the consistent vehicle routing problem (ConVRP) combines traditional vehicle routing constraints with the requirements for service consistency. This article presents a fast solution method called template‐based adaptive large neighborhood search for the described problem. Compared to state‐of‐the‐art heuristics, the developed algorithm is highly competitive on the available benchmark instances. Additionally, new test instances are provided. These seem to be more challenging due to the variation of different model parameters and consequently help to identify interesting effects. Finally, a relaxed variant of the original ConVRP is presented. In this variant, the departure times from the depot can be delayed to adjust the service times of the customers. Experiments show that allowing later departure times considerably improves the solution quality under tight consistency requirements. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(1), 60–81 2014</p> </abstract>