A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem
From MaRDI portal
Publication:2147067
DOI10.1016/j.cor.2022.105804OpenAlexW4220785664MaRDI QIDQ2147067
Ronald Pelot, Floris Goerlandt, Luana Souza Almeida, Kenneth Sörensen
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105804
Related Items (1)
Cites Work
- A note on two problems in connexion with graphs
- Network repair crew scheduling and routing for emergency relief distribution problem
- Road network emergency accessibility planning after a major earthquake
- Solution methodologies for debris removal in disaster response
- A GRASP metaheuristic to improve accessibility after a disaster
- Multi-vehicle prize collecting arc routing for connectivity problem
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- Minimizing latency in post-disaster road clearance operations
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Greedy randomized adaptive search procedures
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- Network repair crew scheduling for short-term disasters
This page was built for publication: A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem