Researcher:
Akbari, Vahid

Profile Picture
ORCID

Job Title

Teaching Faculty

First Name

Vahid

Last Name

Akbari

Name

Name Variants

Akbari, Vahid

Email Address

Birth Date

Filters

20172

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.4daded2d-87ae-4089-bed0-4b0b0984227d

Search Results

Now showing 1 - 2 of 2
  • Placeholder
    PublicationMetadata only
    Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
    (Elsevier Science Bv, 2017) Department of Industrial Engineering; Department of Industrial Engineering; Akbari, Vahid; Salman, Fatma Sibel; Teaching Faculty; Faculty Member; Department of Industrial Engineering; College of Engineering; College of Engineering; N/A; 178838
    After a natural disaster roads can be damaged or blocked by debris, while bridges and viaducts may collapse. This commonly observed hazard causes some road sections to be closed and may even disconnect the road network. In the immediate disaster response phase work teams are dispatched to open a subset of roads to reconnect the network. Closed roads are traversable only after they are unblocked/cleared by one of the teams. The main objective of this research is to provide an efficient solution method to generate a synchronized work schedule for the road clearing teams. The solution should specify the synchronized routes of each clearing team so that: 1) connectivity of the network is regained, and 2) none of the closed roads are traversed unless their unblocking/clearing procedure is finished. In this study we develop an exact Mixed Integer Programming (MIP) formulation to solve this problem. Furthermore, we propose a matheuristic that is based on an MIP-relaxation and a local search algorithm. We prove 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. We show computationally that the matheuristic obtains optimal or near-optimal solutions. (C) 2016 Elsevier B.V. All rights reserved.
  • Placeholder
    PublicationMetadata only
    Multi-vehicle prize collecting arc routing for connectivity problem
    (Pergamon-Elsevier Science Ltd, 2017) Department of Industrial Engineering; Department of Industrial Engineering; Akbari, Vahid; Salman, Fatma Sibel; Teaching Faculty; Faculty Member; Department of Industrial Engineering; College of Engineering; College of Engineering; N/A; 178838
    For effective disaster response, roads should be cleared or repaired to provide accessibility and relief services to the affected people in shortest time. We study an arc routing problem that aims to regain the connectivity of the road network components by clearing a subset of the blocked roads. In this problem, we maximize the total prize gained by reconnecting disconnected network components within a specified time limit. The solution should determine the coordinated routes of each work troop starting at a depot node such that none of the closed roads can be traversed unless their unblocking/clearing procedure is finished. We develop an exact Mixed Integer Program (MIP) and a matheuristic method. The matheuristic solves single vehicle problems sequentially with updated prizes. To obtain an upper bound, we first relax the timing elements in the exact formulation and then solve its relaxed MIP, which decomposes into single vehicle problems, by Lagrangian Relaxation. We show the effectiveness of the proposed methods computationally on both random Euclidean and Istanbul road network data generated with respect to predicted earthquake scenarios. (C) 2017 Elsevier Ltd. All rights reserved.