A continuous‐time service network design and vehicle routing problem

He, Y. ORCID: 0000-0002-9982-7491, Hewitt, M., Lehuédé, F., Medina, J. and Péton, O., 2023. A continuous‐time service network design and vehicle routing problem. Networks. ISSN 0028-3045

Text 1834339_He.pdf - Post-print Full-text access embargoed until 7 November 2024. Download (556kB)

Abstract

This paper considers the integrated planning of goods transportation through a multi-echelon supply chain consisting of a nationwide network and regional distribution system. The previously studied Service Network Design and Routing Problem considered similar planning decisions, albeit with multiple restrictions regarding the transportation of goods that can eliminate the opportunities for transportation savings. It also does not explicitly model the opportunity to increase vehicle utilization by having vehicles serve multiple purposes within the supply chain. We propose a mathematical model of the problem we consider that is inspired by the operations of an industrial partner. We present an adaptation of the Dynamic Discretization Discovery algorithm to solve this problem and illustrate its computational effectiveness on instances derived from the operations of a retail distribution network in France. Finally, we illustrate the potential savings enabled by solving the proposed model.

Item Type:	Journal article
Publication Title:	Networks
Creators:	He, Y., Hewitt, M., Lehuédé, F., Medina, J. and Péton, O.
Publisher:	Wiley
Date:	7 November 2023
ISSN:	0028-3045
Identifiers:	Number Type 10.1002/net.22194 DOI 1834339 Other
Divisions:	Schools > Nottingham Business School
Record created by:	Jeremy Silvester
Date Added:	24 Nov 2023 10:47
Last Modified:	24 Nov 2023 10:47
URI:	https://irep.ntu.ac.uk/id/eprint/50429

Actions (login required)

Edit View

Views

Downloads