An integrated CPU–GPU heuristic inspired on variable neighbourhood search for the single vehicle routing problem with deliveries and selective pickups

Environmental issues have become increasingly important to industry and business in recent days. This trend forces the companies to take responsibility for product recovery, and proper recycling and disposal, moving towards the design of sustainable green supply chains. This paper addresses the backward stream in transportation of products, by means of reverse logistics applied to vehicle routing. This problem, called single vehicle routing problem with deliveries and selective pickups, consists in finding a route that starts from the depot and visits all delivery customers. Some pickup customers may also be visited, since the capacity of the truck is not exceeded, and there is also a revenue associated with each pickup. We develop an algorithm inspired on the variable neighbourhood search metaheuristic that explores the power of modern graphics processing unit (GPU) to provide routes in reasonable computational time. The proposed algorithm called four-neighbourhood variable neighbourhood search (FN-VNS) includes a novel high-quality initial solution generator, a CPU–GPU integrated perturbation strategy and four different neighbourhood searches implemented purely in GPU for the local search phase. Our experimental results show that FN-VNS is able to improve the quality of the solution for 51 instances out of 68 instances taken from the literature. Finally, we obtained speedups up to 14.49 times, varying from 17.42 up to 76.84 for each local search, measured over a set of new large-size instances.

[1]  G. Hogg,et al.  SHAPE: a construction algorithm for area placement evaluation , 1986 .

[2]  Igor Machado Coelho,et al.  The Single Vehicle Routing Problem with Deliveries and Selective Pickups in a CPU-GPU Heterogeneous Environment , 2012, 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems.

[3]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[4]  Nevin Aydin,et al.  Green Supply Chain Management Practices , 2015 .

[5]  Sameer Kumar,et al.  A green supply chain is a requirement for profitability , 2012 .

[6]  Børge Obel,et al.  A heuristic solution to the warehouse location-routing problem , 1994 .

[7]  C. Carter,et al.  REVERSE LOGISTICS: A REVIEW OF THE LITERATURE AND FRAMEWORK FOR FUTURE INVESTIGATION , 1998 .

[8]  Rrk Sharma,et al.  A review of different approaches to the facility layout problems , 2006 .

[9]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[10]  Lúcia Maria de A. Drummond,et al.  A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Comput. Oper. Res..

[11]  Askiner Gungor,et al.  Issues in environmentally conscious manufacturing and product recovery: a survey , 1999 .

[12]  Peter B. Hansen,et al.  Analysis of Sustainability Incorporation by Industrial Supply Chain in Rio Grande do Sul State (Brazil) , 2011 .

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

[14]  Bert Bras,et al.  Product, process, and organizational design for remanufacture – an overview of research , 1999 .

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

[16]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[17]  Thi Van Ha Nguyen.  Development of Reverse Logistics – Adaptability and Transferability , 2012 .

[18]  L. Wein,et al.  Inventory Management of Remanufacturable Products , 2000 .

[19]  Harilaos N. Psaraftis,et al.  k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .

[20]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[21]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[22]  Samir K. Srivastava,et al.  Green Supply-Chain Management: A State-of-the-Art Literature Review , 2007 .

[23]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[24]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[25]  Ruddell Reed,et al.  An applied model for the facilities design problem , 1976 .

[26]  Haldun Süral,et al.  The single‐vehicle routing problem with unrestricted backhauls , 2003, Networks.

[27]  El-Ghazali Talbi,et al.  GPU Computing for Parallel Local Search Metaheuristic Algorithms , 2013, IEEE Transactions on Computers.

[28]  R. V. Hoek,et al.  From reversed logistics to green supply chains , 1999 .

[29]  El-Ghazali Talbi,et al.  A GPU-based iterated tabu search for solving the quadratic 3-dimensional assignment problem , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

[30]  R. Dekker,et al.  A Framework for Reverse Logistics , 2003 .

[31]  Braden Allenby,et al.  Supporting environmental quality: Developing an infrastructure for design , 1993 .

[32]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[33]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[34]  P. Beullens,et al.  RELOOP: reverse logistics chain optimisation in a multi-user trading environment , 1999, Proceedings of the 1999 IEEE International Symposium on Electronics and the Environment (Cat. No.99CH36357).

[35]  Richard D. Berry.  Responding to the Environmental Challenge , 2008 .

[36]  Christian Prins,et al.  A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs , 2005, J. Heuristics.

[37]  Reza Ghodsi,et al.  A Variable Neighborhood Search Algorithm for Continuous Location Routing Problem with Pickup and Delivery , 2010, 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation.

[38]  Joseph Sarkis,et al.  Greening the manufacturing function , 1995 .

[39]  Rommert Dekker,et al.  A characterisation of logistics networks for product recovery , 2000 .

[40]  L. N. Wassenhove,et al.  Collection and Vehicle Routing Issues in Reverse Logistics , 2004 .

[41]  Peter J. Byrne,et al.  A case analysis of a sustainable food supply chain distribution system—A multi-objective approach , 2014 .

[42]  Gilbert Laporte,et al.  The single vehicle routing problem with deliveries and selective pickups , 2008, Comput. Oper. Res..

[43]  Pamela J. Zelbst,et al.  Green supply chain management practices: impact on performance , 2012 .

[44]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[45]  R. Dekker,et al.  Reverse logistics : quantitative models for closed-loop supply chains , 2004 .

[46]  Gabriel Gutiérrez-Jarpa,et al.  A single vehicle routing problem with fixed delivery and optional collections , 2009 .

[47]  Ulrich Guntram,et al.  Responding to the environmental challenge , 1992 .

[48]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..

[49]  Qinghua Zhu,et al.  The moderating effects of institutional pressures on emergent green supply chain practices and performance , 2007 .

[50]  Igor Machado Coelho,et al.  A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups , 2012, Electron. Notes Discret. Math..

[51]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[52]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[53]  Christian Prins,et al.  A survey of recent research on location-routing problems , 2014, Eur. J. Oper. Res..

[54]  Anand Subramanian,et al.  A hybrid algorithm for a class of vehicle routing problems , 2013, Comput. Oper. Res..

[55]  Ronald S. Tibben-Lembke,et al.  AN EXAMINATION OF REVERSE LOGISTICS PRACTICES , 2001 .

[56]  Gilbert Laporte,et al.  Solving a vehicle-routing problem arising in soft-drink distribution , 2006, J. Oper. Res. Soc..

[57]  Tien-Tsin Wong,et al.  Implementation of parallel genetic algorithms on graphics processing units , 2009 .

[58]  Christian Schulz,et al.  Efficient local search on the GPU - Investigations on the vehicle routing problem , 2013, J. Parallel Distributed Comput..

[59]  Peter J. Byrne,et al.  Integrated low-carbon distribution system for the demand side of a product distribution supply chain: a DoE-guided MOPSO optimiser-based solution approach , 2014 .

[60]  Michel Gendreau,et al.  Heuristics for multi-attribute vehicle routing problems: A survey and synthesis , 2013, Eur. J. Oper. Res..

[61]  Bruno Petrato Bruck,et al.  Hybrid metaheuristic for the single vehicle routing problem with deliveries and selective pickups , 2012, 2012 IEEE Congress on Evolutionary Computation.

[62]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[63]  Nenad Mladenovic,et al.  A variable neighborhood search for the capacitated location-routing problem , 2011, 2011 4th International Conference on Logistics.

[64]  Egon Balas.  The Prize Collecting Traveling Salesman Problem and its Applications , 2007 .

[65]  Adam Janiak,et al.  Tabu Search on GPU , 2008, J. Univers. Comput. Sci..

[66]  G. Laporte,et al.  An exact algorithm for minimizing routing and operating costs in depot location , 1981 .

[67]  ScienceDirect.  Robotics and computer-integrated manufacturing , 1984 .