Heuristics for Rich Profitable Tour Problems

We present a Rich variant of the Profitable Tour Problem (RPTP) arising when customer requests involve several products and multi-compartment vehicles are used. The RPTP addressed may be considered as a variant of the capacitated profitable tour problem with time windows and incompatibility constraints. We propose a Variable Neighborhood Search Algorithm embedded with an Adaptive Large Neighborhood Search for the RPTP. This method includes a perturbation phase based on the Ruin and Recreate paradigm. The efficiency of the proposed algorithm is assessed by solving the instances of the Orienteering Problem with Time Windows.

[1]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[2]  Hermann Gehring,et al.  A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .

[3]  Luc Muyldermans,et al.  On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm , 2010, Eur. J. Oper. Res..

[4]  Jacques Desrosiers,et al.  Solving a rich vehicle routing and inventory problem using column generation , 2010, Comput. Oper. Res..

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

[6]  Giovanni Righini,et al.  Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming , 2009, Comput. Oper. Res..

[7]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[8]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[9]  Jacques Renaud,et al.  Production , Manufacturing and Logistics Heuristics for the multi-depot petrol station replenishment problem with time windows , 2012 .

[10]  Richard F. Hartl,et al.  Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..

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

[12]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[13]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

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

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

[16]  Nacima Labadie,et al.  The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..

[17]  Frédéric Semet,et al.  Rich vehicle routing problems: From a taxonomy to a definition , 2015, Eur. J. Oper. Res..

[18]  Gilbert Laporte,et al.  The petrol station replenishment problem with time windows , 2009, Comput. Oper. Res..

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