The Multiple Criteria Optimization Problem of Joint Matching Carpoolers and Common Route Planning
2016; Springer Nature; Linguagem: Inglês
10.1007/978-3-319-46589-0_18
ISSN2194-5357
Autores Tópico(s)Urban and Freight Transport Logistics
ResumoThe 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.
Referência(s)