Minimizing latency in post-disaster road clearance operations
type: Item
instance of: scholarly article
title: Minimizing latency in post-disaster road clearance operations
zbMATH Open document ID: 1430.90043
author: Meraj Ajam
author: Vahid Akbari
author: F. Sibel Salman
published in: European Journal of Operational Research
publication date: 2019-04-30T00:00:00Z
full work available at URL: https://nottingham-repository.worktribe.com/output/2472459
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7049435
zbMATH Keywords: humanitarian logistics
zbMATH Keywords: road clearance
zbMATH Keywords: arc routing
zbMATH Keywords: minimum latency
zbMATH Keywords: heuristics
MaRDI profile type: Publication
OpenAlex ID: W2921829131
cites work: Multi-vehicle prize collecting arc routing for connectivity problem
cites work: Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
cites work: Two improved formulations for the minimum latency problem
cites work: Solution methodologies for debris removal in disaster response
cites work: The Post-Disaster Debris Clearance Problem Under Incomplete Information
cites work: Heuristics for the traveling repairman problem with profits
cites work: Network repair crew scheduling and routing for emergency relief distribution problem
cites work: A GRASP metaheuristic to improve accessibility after a disaster
cites work: Greedy randomized adaptive search procedures
cites work: An improved approximation ratio for the minimum latency problem
cites work: Locating temporary shelter areas after an earthquake: a case for Turkey
cites work: A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics
cites work: Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
cites work: A new formulation for the traveling deliveryman problem
cites work: Variable neighborhood search
cites work: Variable neighborhood search for the travelling deliveryman problem
cites work: A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: P-Complete Approximation Problems
cites work: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
cites work: Integrated optimal scheduling of repair crew and relief vehicle after disaster
cites work: A simple and effective metaheuristic for the minimum latency problem
cites work: Optimal scheduling of emergency roadway repair and subsequent relief distribution
DOI: 10.1016/J.EJOR.2019.03.024
description: scientific article; zbMATH DE number 7049435