Heuristics forthemulti-periodorienteeringproblemwithmultipletimewindows

We presentthemulti-periodorienteeringproblemwithmultipletimewindows(MuPOPTW),anew routing problemcombiningobjectiveandconstraintsoftheorienteeringproblem(OP)andteamorien- teering problem(TOP),constraintsfromstandardvehicleroutingproblems,andoriginalconstraintsfrom a real-worldapplication.Theproblemitselfcomesfromarealindustrialcase.Specificrouteduration constraints resultinaroutefeasibilitysubproblem.Weproposeanexactalgorithmforthissubproblem, and weembeditinavariableneighborhoodsearchmethodtosolvethewholeroutingproblem.We then provideexperimentalresultsforthismethod.Wecomparethemtoacommercialsolver.Wealso adapt ourmethodtostandardbenchmarkOPandTOPinstances,andprovidecomparativetableswith state-of-the-art algorithms.