Heuristic methods for the sectoring arc routing problem-Reference-Cited by-同舟云学术

Heuristic methods for the sectoring arc routing problem

Published:2009-08 Issue:3 Volume:196 Page:856-868
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Mourão Maria Cândida,Nunes Ana Catarina,Prins Christian

Publisher

Elsevier BV

Subject

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

Reference32 articles.

1. Arc routing methods and applications;Assad,1995

2. Lower and upper bounds for the mixed capacitated arc routing problem;Belenguer;Computers & Operations Research,2006

3. Networks and vehicle routing for municipal waste collection;Beltrami;Networks,1974

4. The arc partitioning problem;Bodin;European Journal of Operational Research,1991

5. A tabu search heuristic and adaptive memory procedure for political districting;Bozkaya;European Journal of Operational Research,2003

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

1. Line Coverage With Multiple Robots: Algorithms and Experiments;IEEE Transactions on Robotics;2024

2. Territory Design;International Series in Operations Research & Management Science;2024

3. Dynamic community partitioning for e-commerce last mile delivery with time window constraints;Computers & Operations Research;2023-12

4. Optimized Planning and Management of Domiciliary and Selective Solid Waste: Results of Application in Brazilian Cities (SisRot^®Lix);Solid Waste and Landfills Management - Recent Advances;2023-06-21

5. Approximation schemes for districting problems with probabilistic constraints;European Journal of Operational Research;2023-05