Transportation of handicapped persons
Résumé
This work is about the intelligent transportation of handicapped persons, which is address as an Open Vehicle Routing Problem. We present an Integer Linear Programming formulation and propose a Multi Start (1+1)-Evolutionary Strategy combined with a Variable Neighborhood Search. The performance of this metaheuristic is compared to ILP formulation using a large set of instances. The computational tests show that the proposed metaheuristic outperforms the ILP in terms of solution quality and computational time. Moreover, the solution output has been implemented through web interfaces for a practical use.