Mijnarends, J.

network movement parcel solution depot problem vehicle service route dh /hd fl ows algorithm column generation algorithm number column transportation location solution approach movement scheme origin fl ow node destination movement scheduling problem iteration transportation cost model generation variable design network 1 approach destination depot service provider scheme origin depot fl ow nodes result graph constraint vehicle type search algorithm origin hub provider cut-o ff times search capacity scheduling formulation research destination hub network 2 hd-composite cut-o iterative procedure fi rst iteration transportation science column generation hd-route hh-problem table section concern transport index pricing problem source fferent dh-composite network loading problem decrease paper movement schemes account hh-route vehicle types subproblem path problem node n depot j threshold