Publication:
A model-based heuristic to the min max K-arc routing for connectivity problem

Thumbnail Image

School / College / Institute

Program

KU Authors

Co-Authors

Akbari, Vahid

Publication Date

Language

Embargo Status

NO

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

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.

Source

Publisher

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Subject

Industrial engineering, Heuristic algorithms

Citation

Has Part

Source

OpenAccess Series in Informatics

Book Series Title

Edition

DOI

10.4230/OASIcs.SCOR.2014.76

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

5

Downloads

View PlumX Details