The Multi Constraint Team Orienteering Problem with Multiple Time Windows

摘要

This abstract introduces the Multi Constraint Team Orienteering Problem with Multiple Time Windows (MCTOPMTW)as an extension of the Orienteering Problem, which is a combinatorial routing problem of whichthe goal is to and a tour that maximises the total score earned by visiting vertices. The MCTOPMTW isdefined mathematically. A fast GRASP - Iterated Local Search hybrid metaheuristic algorithm is proposed.Computational experiments present promising results.