Combinatorial Optimization Problems in Transportation Systems
Overview
Background & policy context:
The costs generated by transportation systems represent a significant portion of total logistic cost. Optimal exploitation of transportation capacities is the key task for sustainability of logistic systems. Various problems arising in the practise can be formulated as combinatorial optimization problems. Various models are built with the tools of graph theory and integer linear programming and research is focused to appropriate solution methods of combinatorial problems. Several problems formulated theoretically are analogous to practical problems of transportation.
Objectives:
The project aims at solving the optimization problems derived from arc routing and vehicle routing problems. The handled problems belong to the NP-hard class thus metaheuristic methods such as tabu search or evolutionary algorithms shall be applied to solve problems of a real size. The proposed methods will be tested on available benchmark instances or other data sets generated randomly. The main target of the project is to treat newly formulated problems, and propose and test effective metaheuristics.
Share this page