Now showing items 1-1 of 1

  • The capacitated arc routing problem. A heuristic algorithm 

    Benavent, Enrique; Campos, V.; Corberán, Ángel; Mota, Enrique (Universitat Politècnica de Catalunya. Centre de Càlcul, 1990)
    Open Access
    In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, ...