Genetic Programming Hyper-Heuristic for Stochastic Team Orienteering Problem with Time Windows

This paper investigates the stochastic team orienteering problem with time windows, which is a well known problem to model personalised tourist trip design. Specifically, we consider the stochastic visit duration, which may make preplanned trip infeasible. Existing studies focus on optimising robust solutions in advance, which is not effective in adjusting the subsequent trip in real time. Decision making policies, on the other hand, are effective heuristics to this end. However, it is very challenging to manually design effective policies. In this paper, we investigate automatically evolving policies for the stochastic team orienteering problem with time windows by genetic programming hyper-heuristics. We designed novel problem-specific features for the terminal set, and a meta-algorithm for fitness evaluation. Furthermore, we developed two look-ahead features that can provide more fruitful information than the basic features for real-time decision making. The experimental studies showed that the proposed genetic programming hyper-heuristic can evolve policies that are much better than the manually designed policies. In addition, it seems that the look-ahead features are not so effective when directly included in the terminals. This suggests the requirement of more intelligent ways of incorporating lookahead information.

[1]  Mengjie Zhang,et al.  Automated Design of Production Scheduling Heuristics: A Review , 2016, IEEE Transactions on Evolutionary Computation.

[2]  Xiaodong Li,et al.  Efficient meta-heuristics for the Multi-Objective Time-Dependent Orienteering Problem , 2016, Eur. J. Oper. Res..

[3]  Charalampos Konstantopoulos,et al.  Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows , 2014, ICAA.

[4]  R. Montemanni,et al.  Objective function evaluation methods for the orienteering problem with stochastic travel and service times , 2014 .

[5]  Shih-Wei Lin,et al.  A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..

[6]  Yi Mei,et al.  Genetic programming for production scheduling: a survey with a unified framework , 2017, Complex & Intelligent Systems.

[7]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[8]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[9]  R. Ravi,et al.  Approximation algorithms for stochastic orienteering , 2012, SODA.

[10]  Dirk Van Oudheusden,et al.  The Mobile Tourist Guide: An OR Opportunity , 2007, OR Insight.

[11]  Mark S. Daskin,et al.  The orienteering problem with stochastic profits , 2008 .

[12]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

[13]  Nacima Labadie,et al.  Hybridized evolutionary local search algorithm for the team orienteering problem with time windows , 2011, J. Heuristics.

[14]  Michel Gendreau,et al.  The orienteering problem with stochastic travel and service times , 2011, Ann. Oper. Res..

[15]  Mark Johnston,et al.  A Computational Study of Representations in Genetic Programming to Evolve Dispatching Rules for the Job Shop Scheduling Problem , 2013, IEEE Transactions on Evolutionary Computation.

[16]  Yi Mei,et al.  An Efficient Feature Selection Algorithm for Evolving Job Shop Scheduling Rules With Genetic Programming , 2017, IEEE Transactions on Emerging Topics in Computational Intelligence.

[17]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[18]  Roberto Montemanni,et al.  An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.

[19]  Yi Mei,et al.  A comprehensive analysis on reusability of GP-evolved job shop dispatching rules , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[20]  Alice E. Smith,et al.  AN ANT COLONY APPROACH TO THE ORIENTEERING PROBLEM , 2006 .

[21]  R. Ravi,et al.  Running Errands in Time: Approximation Algorithms for Stochastic Orienteering , 2015, Math. Oper. Res..

[22]  Charalampos Konstantopoulos,et al.  Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows , 2013, SEA.

[23]  Bernd Scholz-Reiter,et al.  Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach , 2010, GECCO '10.

[24]  Roberto Montemanni,et al.  A sampling-based approximation of the objective function of the Orienteering problem with stochastic travel and service times , 2013 .

[25]  Zili Zhang,et al.  Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem , 2017, GECCO.

[26]  Giovanni Righini,et al.  Dynamic programming for the orienteering problem with time windows , 2006 .

[27]  Hoong Chuin Lau,et al.  Orienteering Problem: A survey of recent variants, solution approaches and applications , 2016, Eur. J. Oper. Res..

[28]  Yi Mei,et al.  Feature Selection in Evolving Job Shop Dispatching Rules with Genetic Programming , 2016, GECCO.

[29]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[30]  Jürgen Dorn,et al.  A Tabu Search approach for Multi Constrained Team Orienteering Problem and its application in touristic trip planning , 2012, 2012 12th International Conference on Hybrid Intelligent Systems (HIS).

[31]  Domagoj Jakobovic,et al.  Genetic Programming Heuristics for Multiple Machine Scheduling , 2007, EuroGP.

[32]  M. Rosenwein,et al.  Strong linear programming relaxations for the orienteering problem , 1994 .

[33]  Yi Mei,et al.  Evolving Time-Invariant Dispatching Rules in Job Shop Scheduling with Genetic Programming , 2017, EuroGP.

[34]  Richard F. Hartl,et al.  Metaheuristics for the bi-objective orienteering problem , 2009, Swarm Intelligence.

[35]  Dirk Van Oudheusden,et al.  The Multiconstraint Team Orienteering Problem with Multiple Time Windows , 2010, Transp. Sci..