Article ID: | iaor200969540 |
Country: | United States |
Volume: | 55 |
Issue: | 6 |
Start Page Number: | 493 |
End Page Number: | 515 |
Publication Date: | Sep 2008 |
Journal: | Naval Research Logistics |
Authors: | Campbell Ann Melissa, Chen Hui, Thomas Barrett W |
Keywords: | networks: path, vehicle routing & scheduling |
To meet customer demand, delivery companies are offering an increasing number of time-definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree-structured networks. As it may not be possible to identify a tree-structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures.