To search, Click below search items.


All Published Papers Search Service


Population Metaheuristics to solve the Professional Staff Transportation Problem


Rachida Abounacer, Ghizlane Bencheikh, Jaouad Boukachour, Btissam Dkhissi, Ahmed Elhilali Alaoui


Vol. 9  No. 7  pp. 22-36


The Professional Staff Transportation Problem (PSTP) consists to build the vehicle routing for transporting the staff of one or several companies, in order to minimize the total cost of transport, and taking into account the level of service offered to users. In this paper, we care about the quality of service given by the professional transporter in addition to the transportation cost. The first section presents an overview of recent works on Dial-a-Ride Problem (DARP) which is a generalization of our problem. The second section is dedicated to the mathematical modeling of the (PSTP) by introducing a measure of performance corresponding to the level of service provided to users. In the third section, we present two evolutionary metaheuristics to solve the problem, namely: Ant Colony Algorithm (ACO) and Genetic Algorithm (GA). The last section of this work is devoted to experimental results.


Staff transportation, vehicle routing problem with time window, Dial-a-Ride problem, Ant Colony Algorithm, Genetic Algorithm