A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem-Reference-Cited by-同舟云学术

A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem

Published:2019-03-15 Issue:2 Volume:27 Page:312-326
ISSN:1134-5764
Container-title:TOP
language:en
Short-container-title:TOP

Author:

Corberán Ángel,Plana Isaac,Reula Miguel^ORCID,Sanchis José M.

Funder

Ministerio de Economía, Industria y Competitividad, Gobierno de España

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Statistics and Probability,Management Science and Operations Research,Information Systems and Management,Modelling and Simulation

Link

http://link.springer.com/content/pdf/10.1007/s11750-019-00507-3.pdf

Reference13 articles.

1. Aráoz J, Fernández E, Franquesa C (2017) The generalized arc routing problem. TOP 25:497–525

2. Ávila T, Corberán Á, Plana I, Sanchis JM (2016) A new branch-and-cut algorithm for the generalized directed rural postman problem. Transportation Science 50:750–761

3. Ávila T, Corberán Á, Plana I, Sanchis JM (2017) Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. EURO Journal on Computational Optimization 5:339–365

4. Cerrone C, Cerulli R, Golden B, Pentangelo R (2017) A flow formulation for the close-enough arc routing problem. In Sforza A. and Sterle C., editors, Optimization and Decision Science: Methodologies and Applications. ODS 2017., volume 217 of Springer Proceedings in Mathematics & Statistics, pages 539–546

5. Corberán Á, Laporte G (editors) (2014) Arc Routing: Problems,Methods, and Applications. MOS-SIAM Series on Optimization,Philadelphia

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

1. VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem;Lecture Notes in Computer Science;2024

2. New Models for Close Enough Facility Location Problems;2024

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

4. Heuristics for the Profitable Close-Enough Arc Routing Problem;Expert Systems with Applications;2023-11

5. Metro track geometry car routing problem with periodic demands: a case study in Beijing, China;Engineering Optimization;2023-09-27