2026-07-23T15:11:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4671 2024-03-06T10:29:28Z ddc:004 open_access

A Model-Based Heuristic to the Min Max K-Arc Routing for Connectivity Problem Akbari, Vahid Salman, Sibel Arc Routing Problem Mixed Integer Programming Heuristic Network Connectivity Road Clearance We consider the post-disaster road clearing problem with the goal of restoring network connectivity in shortest time. Given a set of blocked edges in the road network, teams positioned at depot nodes are dispatched to open a subset of them that reconnects the network. After a team finishes working on an edge, others can traverse it. The problem is to find coordinated routes for the teams. We generate a feasible solution using a constructive heuristic algorithm after solving a relaxed mixed integer program. In almost 70 percent of the instances generated both randomly and from Istanbul data, the relaxation solution turned out to be feasible, i.e. optimal for the original problem. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vahid Akbari and Sibel Salman 2014 Is Part Of OASIcs, Volume 37, 4th Student Conference on Operational Research (2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.SCOR.2014.76 urn:nbn:de:0030-drops-46714 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2014.76 eng https://creativecommons.org/licenses/by/3.0/legalcode