Team Orienteering Problem With The Specified Point Set

The orienteering problem is common and a big challenge as a special kind ofNP-hard path optimization problem in many fields of application,such as logistics,tourist industry which is made up of Traditional Orienteering Problem and Teamorienteering problem.It introduced Team Orienteering Problem with the specified pointset based on a review of the orienteering problem in the national and internationalliterature. It introduced Ant Colony Optimization based on metaheuristic,basicthought,merits and demerits. It is the theoretical foundation of Team OrienteeringProblem with the specified point set.As for Traditional Orienteering Problem and Team Orienteering Problem,the objectand a mathematic model of the orienteering problem is introduced. It improvedstimulating factor and updatepheromones strategy based on ant colony algorithm. Thenumerical examples demonstrate the improved colony algorithm has faster convergencespeed and great stability when solving the orienteering problem.This paper discusses Team orienteering problem with the specified point set basedon the nature of customers. It discussed Team orienteering problem with the specifiedpoint set in two cases,one of which starting point and ending point are fixed， and onewhich must go back to starting point. It discussed Team orienteering problem with thespecified point set with time window.As for two casese:starting point and ending point are fixed and going back tostarting point，a mathematic model the optimal object of which is to find the total profitsmaximized of Team Orienteering Problem with the specified point set which has timelimit is established. A MMAS algorithm with2-opt is developed to solve the formercase.It improved stimulating factor and updatepheromones strategy.And optimalsolution was be optimized with2-opt. It improved updatepheromones strategy based onMMAS algorithm with2-opt for the second case.It contrasted the one which hasspecified point set with the one which has no specified point set under the samesituation. The numerical examples demonstrate the algorithm is available,and it isimportant to take the specified point set into account when solving Team orienteeringproblem.As for Team Orienteering Problem with the specified point set with time window，a mathematic model the optimal object of which is to find the total profits maximized ofTeam Orienteering Problem with the specified point set with time window which has time limit is established. An ant colony algorithm which take account waiting time andtime span in probability based on the algorithm in last chapter is developed to solve thisproblem. It contrasted the one which has specified point set with the one which has nospecified point set under the same situation. The numerical examples also demonstratethe algorithm is available, and it is important to take the specified point set into accountwhen solving Team Orienteering Problem.Some customers must be distributed from the enterprise long-term interestsalthough maybe profits is less than without specified point set. It can be took as lookingfor long-term development at the expense of profits for the moment. Team orienteeringproblem with the specified point set is not only made theory abundantly, but alsosupported real problem.