A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem-Reference-Cited by-同舟云学术

A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

Published:2001-11 Issue:4 Volume:35 Page:425-434
ISSN:0041-1655
Container-title:Transportation Science
language:en
Short-container-title:Transportation Science

Author:

Hertz Alain,Mittaz Michel

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Transportation,Civil and Structural Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/trsc.35.4.425.10431

Reference19 articles.

1. Belenguer J. M., Benavent E. A cutting plane algorithm for the capacitated arc routing problem. (1997) (University of Valencia, Spain) . Unpublished manuscript

2. Belenguer J. M., Benavent E., Cognata F. A metaheuristic for the capacitated arc routing problem. (1997) (University of Valencia, Spain) . Unpublished manuscript

3. The optimum traversal of a graph

4. Arc Routing

Cited by 85 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques;Information Technology & Tourism;2024-08-12

2. Learning heuristics for arc routing problems;Intelligent Systems with Applications;2024-03

3. Hybrid Metaheuristic Approaches for the Multi-Depot Rural Postman Problem With Rechargeable and Reusable Vehicles;IEEE Access;2024

4. A Novel Dual-Stage Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs;2024

5. The multiobjective traveling salesman–repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario;International Transactions in Operational Research;2023-11-20