Metaheuristics for the integrated operational transportation planning problem : An Overview

In this paper we present the integrated operational transportation planning probem as theextention of the traditional pick-up-and delivery-problem-with-time-windows. The extention consists inthe possibility of forwarding the requests to subcontractors on dierent terms: from the simple forwardingof single requests at the dened costs to the most complex integrated freight optimisation problem.Dierent types of approaches based on metaheuristics have been applied to the problem: from the savingsalgorithm up to the tabu search and complex memetic algorithm. They also diversify with respect todierent types of integration: hierarchical or simultaneous planning is the matter of consideration. Wepresent the comparison of existing approaches and the results that they generated.