Vehicle routing on road networks: How good is Euclidean approximation?-Reference-Cited by-同舟云学术

Vehicle routing on road networks: How good is Euclidean approximation?

Published:2021-05 Issue: Volume:129 Page:105197
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Boyacı Burak,Dang Thu Huong,Letchford Adam N.

Funder

Engineering and Physical Sciences Research Council

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference41 articles.

1. A note on computational aspects of the Steiner traveling salesman problem;Álvarez-Miranda;Int. Trans. Oper. Res.,2019

2. The Traveling Salesman Problem: A Computational Study;Applegate,2006

3. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems;Arora;J. ACM,1998

4. Ball, M.O., Magnantiz, T.L., Monma, C.L., Nemhauser, G.L. (Eds.), 1995. Network Routing. Handbooks in Operations Research and Management Science, vol. 8. Elsevier.

5. Selected country circuity factors for road travel distance estimation;Ballou;Transp. Res. A,2002

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

1. Decision support framework for home health caregiver allocation using optimally tuned spectral clustering and genetic algorithm;Healthcare Analytics;2024-06

2. Integrated optimisation of strategic planning and service operations for urban air mobility systems;Transportation Research Part A: Policy and Practice;2024-05

3. The hiking tourist problem;Central European Journal of Operations Research;2024-01-17

4. Navigating the Maps: Euclidean vs. Road Network Distances in Spatial Queries;Algorithms;2024-01-10

5. Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport;EURO Journal on Transportation and Logistics;2024