Urban bicycles renting systems: Modelling and optimization using nature-inspired search methods

Urban Bicycles Renting Systems (UBRS) are becoming a common and useful component in growing modern cities. For an efficient management and support, the UBRS infrastructure requires the optimation of vehicle routes connecting several bicycle base stations and storage centers. In this study, we model this real-world optimization problem as a capacitated Vehicle Routing Problem (VRP) with multiple depots and the simultaneous need for pickup and delivery at each base station location. Based on the VRP model specification, two nature-inspired computational techniques, evolutionary algorithms and ant colony systems, are presented and their performance in tackling the UBRS problem is investigated. In the evolutionary approach, individuals are encoded as permutations of base stations and then translated to a set of routes subject to the constraints related to vehicle capacity and node demands. In the ant-based approach, ants build complete solutions formed of several subtours servicing a subset of base stations using a single vehicle based on both apriori (the attractiveness of a move based on the known distance or other factors) and aposteriori (pheromone levels accumulated on visited edges) knowledge. Both algorithms are engaged for the UBRS problem using real data from the cities of Barcelona and Valencia. Computational experiments for several scenarios support a good performance of both population-based search methods. Comparative results indicate that better solutions are obtained on the average by the ant colony system approach for both considered cities.

[1]  Roberto Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems , 2007, Swarm Intelligence.

[2]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[3]  Lúcia Maria de A. Drummond,et al.  Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem , 2006, Neurocomputing.

[4]  Leandro Nunes de Castro,et al.  Neuro-immune approach to solve routing problems , 2009, Neurocomputing.

[5]  Roberto Montemanni,et al.  Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

[6]  Dariusz Barbucha,et al.  Search modes for the cooperative multi-agent system solving the vehicle routing problem , 2012, Neurocomputing.

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

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

[10]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[11]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[12]  Xuerong Feng,et al.  An overall-regional competitive self-organizing map neural network for the Euclidean traveling salesman problem , 2012, Neurocomputing.

[13]  Zhang Yi,et al.  A modified pulse coupled neural network for shortest-path problem , 2009, Neurocomputing.

[14]  Xiangpei Hu,et al.  An improved ant colony optimization and its application to vehicle routing problem with time windows , 2012, Neurocomputing.

[15]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[16]  L Hongbo,et al.  An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems , 2007 .

[17]  Michel Gendreau,et al.  Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[18]  Abdul Razak Hamdan,et al.  Ant Colony System , 2013 .

[19]  Chung-Ho Wang,et al.  A hybrid genetic algorithm that optimizes capacitated vehicle routing problems , 2009, Expert Syst. Appl..

[20]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[21]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[22]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[23]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[24]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

[25]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[26]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[27]  Paolo Toth,et al.  Recent advances in vehicle routing exact algorithms , 2007, 4OR.

[28]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[29]  Petrica C. Pop,et al.  An improved hybrid algorithm for solving the generalized vehicle routing problem , 2013, Neurocomputing.

[30]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.