Dissimilar arc routing problems

DOI10.1002/NET.21763MaRDI QIDQ6496354

Miguel Fragoso Constantino, Leonor Santiago Pinto, Maria Cândida Mourão

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

arc routingmatheuristicsflow modelsmixed integer linear programming formulationdissimilar arc routingrisk constrained cash-in-transit

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The \(k\)-dissimilar vehicle routing problem
• Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
• Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
• Lower bounds for the mixed capacitated arc routing problem
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems
• On the generalized 2-peripatetic salesman problem
• A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
• A heuristic approach to the overnight security service problem
• The undirected \(m\)-capacitated peripatetic salesman problem
• A survey on matheuristics for routing problems
• Lower bounds for symmetricK-peripatetic salesman problems

This page was built for publication: Dissimilar arc routing problems