We present an Integer Linear Programming (ILP) formulation and an Evolutionary Algorithm (EA) to solve the vehicle relocation problem in free floating carsharing. In this system, users rent cars and may leave them anywhere on a designated area. After a while, a set of vehicles must be relocated to a discrete set of weighted spots, where other users may rent them again. In order to do it, some shuttles drive a set of operators to vehicles to be relocated and then collect the operators back. The objective is to maximize the weighted sum of served spots on a given time. The ILP model could solve the small instances and gave an upper (UB) and a lower bound (LB) for the others. The UB and LB values were used to evaluate the solution found by EA and showed that EA indeed found good solutions, even optimal ones.
