A Relax-and-Fix Decomposition Strategy Based on Adjacent Nodes Applied to the Periodic Capacitated Arc Routing Problem (PCARP)
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Latin America Transactions"
DOI: 10.1109/tla.2020.9082729
Abstract: Periodic Capacitated Arc Routing Problem (PCARP) is a combinatorial problem of hard resolution and due to its intrinsic intractability, researchers have concentrated on designing heuristic methods to obtain good quality solutions. In this work, the… read more here.
Keywords: decomposition; pcarp; problem; capacitated arc ... See more keywords