An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands-Reference-Cited by-同舟云学术

An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Published:2010-02 Issue:1 Volume:44 Page:125-135
ISSN:0041-1655
Container-title:Transportation Science
language:en
Short-container-title:Transportation Science

Author:

Laporte Gilbert,Musmanno Roberto,Vocaturo Francesca

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.1090.0290

Reference35 articles.

1. Amberg A., Voss S. A hierarchical relaxation lower bound for the capacitated arc routing problemProc. 35th Annual Hawaii Internat. Conf. System Sci.2002

2. Exact methods based on node-routing formulations for undirected arc-routing problems

3. A cutting plane algorithm for the capacitated arc routing problem

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

1. A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search;Computers & Operations Research;2024-12

2. Optimizing Delhivery’s Midmile Logistics Network Using a Hybrid Evolutionary Search Algorithm;INFORMS Journal on Applied Analytics;2024-09-04

3. Hyper-heuristics: A survey and taxonomy;Computers & Industrial Engineering;2024-01

4. Air cargo network planning and scheduling problem with minimum stay time: A matrix-based ALNS heuristic;Transportation Research Part C: Emerging Technologies;2023-11

5. A two-stage stochastic location–routing problem for electric vehicles fast charging;Computers & Operations Research;2023-10