V
Vahid Akbari
Researcher at University of Nottingham
Publications - 13
Citations - 307
Vahid Akbari is an academic researcher from University of Nottingham. The author has contributed to research in topics: Competitive analysis & Heuristic (computer science). The author has an hindex of 5, co-authored 13 publications receiving 139 citations. Previous affiliations of Vahid Akbari include Koç University.
Papers
More filters
Journal ArticleDOI
Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
Vahid Akbari,F. Sibel Salman +1 more
TL;DR: It is proved that the optimality gap of the relaxation solution is bounded by K times the lower bound obtained from the relaxed model, where K is the number of teams and the matheuristic obtains optimal or near-optimal solutions.
Journal ArticleDOI
Multi-vehicle prize collecting arc routing for connectivity problem
Vahid Akbari,F. Sibel Salman +1 more
TL;DR: An arc routing problem that aims to regain the connectivity of the road network components by clearing a subset of the blocked roads by maximizing the total prize gained by reconnecting disconnected network components within a specified time limit is studied.
Journal ArticleDOI
Minimizing latency in post-disaster road clearance operations
TL;DR: The post-disaster road clearing problem is studied with the aim of providing a fast and effective method to determine the route of a work troop responsible for clearing blocked roads and a heuristic that solves a mixed integer program on a transformed network and a lower bounding method to evaluate the optimality gaps is developed.
Journal ArticleDOI
An online optimization approach to post-disaster road restoration
TL;DR: This article studies a post-disaster road restoration problem modeled on an undirected edge-weighted graph with k blocked edges, where the unblocking time of a blocked edge is revealed online once the road restoration team visits an end-node of that blocked edge.
Journal ArticleDOI
Online routing and scheduling of search-and-rescue teams
TL;DR: This work follows the theoretical competitive analysis approach that takes a worst-case perspective and proves lower bounds on the competitive ratio of the two variants of the defined online problem with makespan and weighted latency objectives.