A guided local search heuristic for the capacitated arc routing problem-Reference-Cited by-同舟云学术

A guided local search heuristic for the capacitated arc routing problem

Published:2003-06 Issue:3 Volume:147 Page:629-643
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Beullens Patrick,Muyldermans Luc,Cattrysse Dirk,Van Oudheusden Dirk

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference30 articles.

1. Multiple center capacitated arc routing problems: A Tabu search algorithm using capacitated trees;Amberg;European Journal of Operational Research,2000

2. Arc routing methods and applications;Assad,1995

3. The capacitated arc routing problem: Valid inequalities and facets;Belenguer;Computational Optimization and Applications,1998

4. Belenguer, J.M., Benavent, E., 2000. A Cutting Plane Algorithm for the Capacitated Arc Routing Problem. Working paper, Departemento de Estadı́stica e Investigación Operativa, Universidad de Valencia

5. Benavent, E., 1997. ftp://indurain.estadi.uv.es/pub/CARP

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

1. Drone Arc Routing Problems and Metaheuristic Solution Approach;Drones;2024-08-03

2. A bilevel hybrid iterated search approach to soft-clustered capacitated arc routing problems;Transportation Research Part B: Methodological;2024-06

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

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

5. An improved multi-objective framework for the Rich arc routing problem;Computers & Operations Research;2023-11