|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Title:||A new fast large neighbourhood search for service network design with asset balance constraints|
|Citation:||Bai R, Woodward J & Subramanian N (2017) A new fast large neighbourhood search for service network design with asset balance constraints In: 2016 IEEE Symposium Series on Computational Intelligence (SSCI), Piscataway, NJ, USA: Institute of Electrical and Electronic Engineers, Inc.. 2016 IEEE Symposium Series on Computational Intelligence (SSCI), 6.12.2016 - 9.12.2016, Athens, Greece.|
|Conference Name:||2016 IEEE Symposium Series on Computational Intelligence (SSCI)|
|Conference Location:||Athens, Greece|
|Abstract:||The service network design problem (SNDP) is a fundamental problem in consolidated freight transportation. It involves the determination of an efficient transportation network and the scheduling details of the corresponding services. Compared to vehicle routing problems, SNDP can model transfers and consolidations on a multi-modal freight network. The problem is often formulated as a mixed integer programming problem and is NP-Hard. In this research, we propose a new efficient large neighbourhood search function that can handle the constraints more efficiently. The effectiveness of this new neighbourhood is evaluated in a tabu search metaheuristic (TS) and a GLS guided local search (GLS) method. Experimental results based on a set of well-known benchmark instances show that the new neighbourhood performs significantly better than the previous arc-flipping neighbourhood. The neighbourhood function is also applicable in other optimisation problems with similar discrete constraints.|
|Status:||Book Chapter: publisher version|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|07850084.pdf||527.38 kB||Adobe PDF||Under Embargo until 31/12/2999 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.