The multiple criteria optimization problem of joint matching carpoolers and common route planning: Modeling and the concept of solution procedure

Abstract

The paper concerns a joint problem of matching carpoolers and planning common routes as a multiple criteria optimization problem. The model of the optimization problem, as well as the concept of solution procedure, is presented. The solution algorithm uses dynamic programming method and Dijkstra algorithm to obtain matches of the carpoolers and routes. The solution is evaluated by aggregated quality index taking into account preferences of carpoolers equally, concerning all the criteria. Preferences are obtained by AHP method.