This　paper　investigates　an　optimal　lane　reservation　problem　with　dynamic　link　travel　times　via　a　lane　reservation　strategy.　This　strategy　is　to　select　some　existing　general-purpose　lanes　from　a　transportation　network　and　convert　them　to　reserved　lanes　for　some　special　road　users　only　so　that　a　time-guaranteed　transportation　can　be　ensured.　However,　such　conversion　may　cause　traffic　impact　such　as　an　increase　of　link　travel　times　on　adjacent　lanes　due　to　the　disallowing　utilisation　of　reserved　lanes　by　general-purpose　vehicles.　Thus,　the　considered　problem　aims　to　design　reserved　lane-based　paths　for　the　time-guaranteed　transportation　with　the　objective　of　minimising　the　total　traffic　impact　caused　by　the　conversion.　Different　from　lane　reservation　problems　with　constant　link　travel　times　in　the　literature,　the　considered　problem　assumes　dynamic　link　travel　times,　which　is　proved　NP-hard.　The　problem　is　initially　formulated　as　a　mixed　integer　non-linear　programming　model.　In　order　to　solve　it,　the　non-linear　model　is　reformulated　as　an　equivalent　linear　model　and　a　cut-and-solve-based　algorithm　is　proposed　to　obtain　optimal　solutions.　Experimental　tests　on　randomly　generated　instances　show　that　the　overall　performance　of　the　proposed　algorithm　outperforms　a　direct　use　of　a　commercial　CPLEX　MIP　solver.　©　2013　Taylor　&　Francis.