2018/08/31 by Felipe F. Müller, Luís A. A. Meira, Müller, Felipe F. +1
Decision Sciences · Engineering · #Business and Management Studies #FOS: Computer and information sciences #Neural and Evolutionary Computing (cs.NE) #Operations Management Techniques #Urban and Freight Transport Logistics
paper · pdf · doi:10.48550/arxiv.1808.10866
openalex publication_date 2018/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Routing problems are often faced by companies who serve costumers through vehicles. Such problems have a challenging structure to optimize, despite the recent advances in combinatorial optimization. The goal of this project is to study and propose optimization algorithms to the vehicle routing problems (VRP). Focus will be on the problem variant in which the length of the route is restricted by a constant. A real problem will be tackled: optimization of postmen routes. Such problem was modeled as multi-objective in a roadmap with 25 vehicles and 30,000 deliveries per day.