A scheme for determining vehicle routes based on Arc-based service network design

Jiang, Xiaoping, Bai, Ruibin, Atkin, Jason and Kendall, Graham (2017) A scheme for determining vehicle routes based on Arc-based service network design. INFOR: Information Systems and Operational Research, 55 (1). pp. 16-37. ISSN 1916-0615 (In Press)

Full text not available from this repository.


In freight transportation, less-than-truckload carriers often need to assign each vehicle a cyclic route so that drivers can come back home after a certain period of time. However, the Node-Arc model for service network design addresses decisions on each arc and does not determine routes directly, although the vehicle balancing constraint ensures that the number of outgoing vehicles equals the number of incoming vehicles at each node. How to transform the optimized service network into a set of vehicle routes remains an important problem that has not yet been studied. In this paper, we propose a three-phase scheme to address this problem. In the first stage, we present an algorithm based on the depth-first search to find all of the different cyclic routes in a service network design solution. In the second stage, we propose to prune poor cyclic routes using real-life constraints so that a collection of acceptable vehicle routes can be obtained before route assignment. Some of the pruning can also be done in the first stage to speed up the proposed algorithm. In the third stage, we formulate the problem of selecting a set of cyclic routes to cover the entire network as a weighted set covering problem. The resulting model is formulated as an integer program and solved with IBM ILOG CPLEX solver. Experimental results on benchmark instances for service network design indicate the effectiveness of the proposed scheme which gives high-quality solutions in an efficient way.

Item Type: Article
RIS ID: https://nottingham-repository.worktribe.com/output/838344
Additional Information: Needs bib details and 12-month embargo upon publication. TJJ 19.10.16
Keywords: Service network design, depth first serach, pruning, set covering, integer programming
Schools/Departments: University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer Science
University of Nottingham, Malaysia > Faculty of Science and Engineering — Science > School of Computer Science
University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1080/03155986.2016.1262580
Depositing User: Eprints, Support
Date Deposited: 19 Oct 2016 10:59
Last Modified: 04 May 2020 18:28
URI: https://eprints.nottingham.ac.uk/id/eprint/37728

Actions (Archive Staff Only)

Edit View Edit View