Caixeiro viajante elétrico com passageiros

Abstract

The logistics research field has observed the growing use of electric vehicles in different branches, including passenger transport. The PCVEP is a logistics problem that mixes elements of the well-known Traveling Salesman Problem (PCV), the Traveling Salesman with Passengers Problem (PCVP) and the Traveling Time Electric Salesman Problem (PCVEJT), in addition to also considering, restrictions for increasing or recharging travel autonomy and the fact that the autonomy is sensitive to the number of passengers loaded in the vehicle, all intrinsic to the problem itself and which further hamper the ability to solve the problem. The accomplishment of this work consisted of the research and the study of Problems of Routing of Electric Vehicles (PRVE) and of problems that address issues of ridesharing. In the first moment, a bibliographic survey of the works that addressed and solved the issues mentioned above was carried out for the proper formulation and description of the PCVEP. Therefore, because it is an unprecedented problem, a bank of Euclidean instances was created for the problem, a random part and an adapted part of TSPLIB. As solving methods for PCVEP, a set of heuristic, naive and hybridized algorithms was developed, for the proper anchoring of the experiments. Yet another set of meta-heuristic algorithms was developed for PCVEP, a randomized greedy procedure, improved through a search in descending variable neighborhood, and a colony algorithm of multi-ant ants, with ants that admit in their solving process , characteristics specific to PCVEP, such as charging stations, distance between locations and passenger loading. The PCVEP is a PRVE, which brings up important sustainability issues, promoting the minimization of greenhouse gas emissions into the atmosphere, reducing traffic in large cities, and also encouraging socialization among people.