Multiobjective Modeling and Optimization of the Routing and Sequencing Problem of Inspection Teams

This paper proposes a multiobjective mixed-integer linear programming model for routing and scheduling inspection crews in power distribution networks, balancing logistical efficiency (makespan and total flow time) and operational safety (waiting time weighted by criticality). The NP-Hard problem was evaluated on the IEEE 123-node system under multiple fault scenarios. Resolution via the NSGA-II metaheuristic was compared to an exact method (ϵ-constraint via Gurobi). In the experiments conducted, NSGA-II statistically outperformed the exact method in terms of Hypervolume (p < 0.05). This highlights the algorithm’s ability to map strictly efficient solutions, overcoming the generation of weakly Pareto-optimal solutions inherent to classical scalarization, validating it as an effective operational tool.