The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
The multiperiod assignment problem, a specialization of the three dimensional assignment problem, is an optimization model that describes the situation of assigning people to activities, or jobs over time. We consider the most general case which has both a cost of assigning a person to an activity in each time period, and a cost of transferring the person from one activity in each period to another activity in the next period. In general, the number of time periods need not equal the number of persons and activities. We present a new formulation of the multiperiod assignment problem, that of an integer, multicommodity network flow model. The special structure of the model allows us to find a good feasible solution relatively quickly by a shortest path heuristic algorithm. We discuss a new branch and bound algorithm for solving this problem to optimality. The subproblems of the branch and bound tree are evaluated by solving a set of special-structured, shortest path problems all of which can be solved in order \(n^ 2T\) time, where n is the number of persons and activities, and T is the number of time periods. We present computational tests of the algorithm on moderately sized problems.
integer, multicommodity network flow model
scientific article; zbMATH DE number 3932793
scientific article