Optimisation of transportation service network using κ-node large neighbourhood search

Bai, Ruibin and Woodward, John R. and Subramanian, Nachiappan and Cartlidge, John (2018) Optimisation of transportation service network using κ-node large neighbourhood search. Computers & Operations Research, 89 . pp. 193-205. ISSN 0305-0548

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (782kB) | Preview
[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution Non-commercial No Derivatives.
Download (888kB) | Preview

Abstract

The Service Network Design Problem (SNDP) is generally considered as a fundamental problem in transportation logistics and involves the determination of an efficient transportation network and corresponding schedules. The problem is extremely challenging due to the complexity of the constraints and the scale of real-world applications. Therefore, efficient solution methods for this problem are one of the most important research issues in this field. However, current research has mainly focused on various sophisticated high-level search strategies in the form of different local search metaheuristics and their hybrids. Little attention has been paid to novel neighbourhood structures which also play a crucial role in the performance of the algorithm. In this research, we propose a new efficient neighbourhood structure that uses the SNDP constraints to its advantage and more importantly appears to have better reachability than the current ones. The effectiveness of this new neighbourhood is evaluated in a basic Tabu Search (TS) metaheuristic and a basic Guided Local Search (GLS) method. Experimental results based on a set of well-known benchmark instances show that the new neighbourhood performs better than the previous arc-flipping neighbourhood. The performance of the TS metaheuristic based on the proposed neighbourhood is further enhanced through fast neighbourhood search heuristics and hybridisation with other approaches.

Item Type: Article
Keywords: Logistics; Transportation network; Service network design; Metaheuristics; Large neighbourhood search
Schools/Departments: University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer Science
Identification Number: https://doi.org/10.1016/j.cor.2017.06.008
Depositing User: LIN, Zhiren
Date Deposited: 24 Jan 2018 12:06
Last Modified: 02 Jul 2018 08:40
URI: http://eprints.nottingham.ac.uk/id/eprint/48891

Actions (Archive Staff Only)

Edit View Edit View