Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows

GVNS, which stands for General Variable Neighborhood Search, is an established and commonly used metaheuristic for the expeditious solution of optimization problems that belong to the NP-hard class. This paper introduces an expansion of the standard GVNS that borrows principles from quantum computing during the shaking stage. The Traveling Salesman Problem with Time Windows (TSP-TW) is a characteristic NP-hard variation in the standard Traveling Salesman Problem. One can utilize TSP-TW as the basis of Global Positioning System (GPS) modeling and routing. The focus of this work is the study of the possible advantages that the proposed unconventional GVNS may offer to the case of garbage collector trucks GPS. We provide an in-depth presentation of our method accompanied with comprehensive experimental results. The experimental information gathered on a multitude of TSP-TW cases, which are contained in a series of tables, enable us to deduce that the novel GVNS approached introduced here can serve as an effective solution for this sort of geographical problems.

[1]  Michael C. Georgiadis,et al.  A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing , 2019, Comput. Chem. Eng..

[2]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[3]  J. Monnot,et al.  The Traveling Salesman Problem and its Variations , 2014 .

[4]  Jean-Claude Muller.  Guest Editorial Latest developments in GIS/LIS , 1993 .

[5]  Roberto Wolfler Calvo,et al.  A New Heuristic for the Traveling Salesman Problem with Time Windows , 2000, Transp. Sci..

[6]  Chi-Bin Cheng,et al.  A modified ant colony system for solving the travelling salesman problem with time windows , 2007, Math. Comput. Model..

[7]  J. Frédéric Bonnans,et al.  Perturbation Analysis of Optimization Problems , 2000, Springer Series in Operations Research.

[8]  Michael Defoin-Platel,et al.  Quantum-Inspired Evolutionary Algorithm: A Multimodel EDA , 2009, IEEE Transactions on Evolutionary Computation.

[9]  Michael C. Georgiadis,et al.  Basic VNS Algorithms for Solving the Pollution Location Inventory Routing Problem , 2018, ICVNS.

[10]  Jeff Jones,et al.  Computation of the travelling salesman problem by a shrinking blob , 2013, Natural Computing.

[11]  Anthony J. G. Hey,et al.  Feynman Lectures on Computation , 1996 .

[12]  N. Mladenović,et al.  Variable neighborhood search for the economic lot sizing problem with product returns and recovery , 2015 .

[13]  Yueh-Min Huang,et al.  A quantum-inspired Tabu search algorithm for solving combinatorial optimization problems , 2013, Soft Computing.

[14]  Pierre Hansen,et al.  Variable neighborhood search: basics and variants , 2017, EURO J. Comput. Optim..

[15]  M. Batouche,et al.  A new quantum-inspired genetic algorithm for solving the travelling salesman problem , 2004, 2004 IEEE International Conference on Industrial Technology, 2004. IEEE ICIT '04..

[16]  Theodore Andronikos,et al.  Initialization methods for the TSP with Time Windows using Variable Neighborhood Search , 2015, 2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA).

[17]  Piotr Jankowski,et al.  Spatial Decision Support Systems: Three decades on , 2019, Decis. Support Syst..

[18]  Sebastián Urrutia,et al.  A General VNS heuristic for the traveling salesman problem with time windows , 2010, Discret. Optim..

[19]  Gerhard Reinelt,et al.  The Traveling Salesman , 2001, Lecture Notes in Computer Science.

[20]  Andrew W. H. Ip,et al.  Design of an improved quantum-inspired evolutionary algorithm for a transportation problem in logistics systems , 2011, Journal of Intelligent Manufacturing.

[21]  Nenad Mladenovic,et al.  Variable neighborhood search for location routing , 2013, Comput. Oper. Res..

[22]  R. Feynman.  Simulating physics with computers , 1999 .

[23]  Christos Papalitsas,et al.  A Quantum Inspired GVNS: Some Preliminary Results. , 2017, Advances in experimental medicine and biology.

[24]  Nenad Mladenovic,et al.  Less is more: Basic variable neighborhood search for minimum differential dispersion problem , 2016, Inf. Sci..

[25]  Barrett W. Thomas,et al.  A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows , 2007, INFORMS J. Comput..

[26]  Matteo Fischetti,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .

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

[28]  Nenad Mladenovic,et al.  An efficient GVNS for solving Traveling Salesman Problem with Time Windows , 2012, Electron. Notes Discret. Math..

[29]  M. Pacheco,et al.  Quantum-Inspired Evolutionary Algorithm for Numerical Optimization , 2006 .

[30]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[31]  Giannis Tzimas,et al.  Architecture and Implementation Issues, Towards a Dynamic Waste Collection Management System , 2015, WWW.

[32]  Angelo Sifaleras,et al.  General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain , 2015, Electron. Notes Discret. Math..

[33]  Theodore Andronikos,et al.  Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection , 2018, Algorithms.