An algorithm based on granular tabu search for the problem of balancing public bikes by using multiple vehicles

The use of public bicycle systems has gained great importance in European countries and around the globe; this has led to the need to seek advanced techniques to help decision making. A public bicycle system consists of a set of points where you can pick up and deliver bicycles; a headquarters where a group of vehicles taking leftover bikes and transported to the points where a deficit (the demand exceeds supply) exists. One of the major problems that arise in systems of public bike is balanced, which involves sending bikes from the point where an offer (bicycles left over) to the point where there is a demand (bikes missing) occurs. The way to model this problem is with an adaptation of the vehicle routing problem with pickup and delivery (VRPPD), allowing each route make partial deliveries to customers and limiting the number of customers to visit by each route. In this paper an integer linear programming model is introduced and a metaheuristic based on granular tabu search to find a local optimum. Instances from 15 to 500 customers adapted from the literature are used. The computational results show that the proposed algorithm finds solutions in short computational time.

• Autores: Linfati, Rodrigo; Escobar, John Willmer; Cuevas, Bernardo
• Tipo de recurso: Article of journal
• Fecha de publicación: 2014
• Institución: Universidad Nacional de Colombia
• Repositorio: Universidad Nacional de Colombia
• Idioma: spa
• OAI Identifier: oai:repositorio.unal.edu.co:unal/49358
• Acceso en línea: https://repositorio.unal.edu.co/handle/unal/49358; http://bdigital.unal.edu.co/42815/
• Palabra clave: Bike Sharing Problem; Routing; Tabu Search
• Rights: openAccess
• License: Atribución-NoComercial 4.0 Internacional