Tabu assisted guided local search approaches for freight service network design

Bai, Ruibin and Kendall, Graham and Qu, Rong and Atkin, Jason A.D. (2012) Tabu assisted guided local search approaches for freight service network design. Information Sciences, 189 . pp. 266-281. ISSN 1872-6291

[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 (1MB) | Preview

Abstract

The service network design problem (SNDP) is a core problem in freight transportation. It involves the determination of the most cost-effective transportation network and the character- istics of the corresponding services, subject to various constraints. The scale of the problem in real-world applications is usually very large, especially when the network contains both the geographical information and the temporal constraints which are necessary for modelling mul- tiple service-classes and dynamic events. The development of time-efficient algorithms for this problem is, therefore, crucial for successful real-world applications. Earlier research indicated that guided local search (GLS) was a promising solution method for this problem. One of the advantages of GLS is that it makes use of both the information collected during the search as well as any special structures which are present in solutions. Building upon earlier research, this paper carries out in-depth investigations into several mechanisms that could potentially speed up the GLS algorithm for the SNDP. Specifically, the mechanisms that we have looked at in this paper include a tabu list (as used by tabu search), short-term memory, and an aspiration crite- rion. An efficient hybrid algorithm for the SNDP is then proposed, based upon the results of these experiments. The algorithm combines a tabu list within a multi-start GLS approach, with an efficient feasibility-repairing heuristic. Experimental tests on a set of 24 well-known service network design benchmark instances have shown that the proposed algorithm is superior to a previously proposed tabu search method, reducing the computation time by over a third. In ad- dition, we also show that far better results can be obtained when a faster linear program solver is adopted for the sub-problem solution. The contribution of this paper is an efficient algorithm, along with detailed analyses of effective mechanisms which can help to increase the speed of the GLS algorithm for the SNDP.

Item Type: Article
Keywords: Logistics, Freight Transportation, Guided Local Search, Service Network Design, Linear Programming
Schools/Departments: University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer Science
University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1016/j.ins.2011.11.028
Depositing User: YUAN, Ziqi
Date Deposited: 31 Jan 2018 14:52
Last Modified: 02 Jul 2018 09:18
URI: http://eprints.nottingham.ac.uk/id/eprint/49407

Actions (Archive Staff Only)

Edit View Edit View