A vulnerability-based vehicle routing approach for solving capacitated arc routing problem in urban snow plowing operations
| Autor: | Lin Liu, Sixiang Lin, Binglei Xie, Lei Jin |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Operations research
Heuristic (computer science) Computer science lcsh:Biotechnology 02 engineering and technology snow and freezing event lcsh:TP248.13-248.65 0502 economics and business Vehicle routing problem 0202 electrical engineering electronic engineering information engineering capacitated arc routing problem climate-resilient transport Vulnerability (computing) urban snow plowing operations Applied Mathematics lcsh:Mathematics 05 social sciences General Medicine Snow Traffic flow lcsh:QA1-939 vulnerability evaluation Computational Mathematics risk-informed approach Modeling and Simulation Path (graph theory) 020201 artificial intelligence & image processing Routing (electronic design automation) General Agricultural and Biological Sciences Arc routing 050203 business & management |
| Zdroj: | Mathematical Biosciences and Engineering, Vol 18, Iss 1, Pp 166-181 (2021) |
| ISSN: | 1551-0018 |
| Popis: | Vehicle drivers usually perceive a higher risk when driving on snow covered roads. The city cleaning efficiency would directly influence the risk and mitigation of wintertime events, especially for snow covered roads. Under the risk-informed approach background, more attention is paid to the capacitated arc routing problem (CARP) of urban snow plowing operations. Current algorithms mainly relies on the topology of road network without considering snow covered pavement's negative effect on road capacity and traffic flow. This paper proposes a vulnerability-based parallel heuristic algorithms applied for the CARP by implementing risk-informed approach. First, a method is proposed to set service priorities based on the vulnerability evaluation by considering the added cost of travel demands. Second, a sub-process path-scanning approach is developed to avoid redundant path scans. Then verification and comparison between this newly proposed constructive heuristic and existing algorithms of whole-process path-scanning and sequential processing are conducted. Results show that the sub-process path-scanning approach obviously costs less service completion time than the existing algorithms for solving the CARP. However, this improved algorithm would also cause an increase of deadhead time upon dispatch. The balance between service completion time and deadhead time for more routing problems would be discussed in the near future. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|