Willemse, Elias J.Joubert, Johannes Willem2016-08-182016-09Willemse, EJ & Joubert, JW 2016, 'Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities', Operations Research Letters, vol. 44, no. 5, pp. 569-574.0167-637710.1016/j.orl.2016.06.001http://hdl.handle.net/2263/56379This paper develops optimal and quick near-optimal splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities. Splitting procedures are a key component of giant tour-based solution methods for Arc Routing Problems. The optimal and near-optimal splitting procedures are tested within a multi-start constructive heuristic, and a fixed execution-time limit is imposed. Results on benchmark instances show that the constructive-heuristic linked with the new optimal splitting algorithm performs better than the near-optimal versions.en© 2016 Elsevier B.V. All rights reserved. Notice : this is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, vol. 44, no. 5, pp. 569-574, 2016. doi : 10.1016/j.orl.2016.06.001.Waste collectionIntermediate facilitiesMixed networkSplitting proceduresCapacitated arc routing problem (CARP)Capacitated arc routing problem under time restrictions with intermediate facilities (CARPTIF)Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilitiesPostprint Article