A generalized shortest path tour problem with time windows-Reference-Cited by-同舟云学术

A generalized shortest path tour problem with time windows

Published:2022-08-10 Issue:2 Volume:83 Page:593-614
ISSN:0926-6003
Container-title:Computational Optimization and Applications
language:en
Short-container-title:Comput Optim Appl

Author:

Di Puglia Pugliese L.,Ferone D.,Festa P.,Guerriero F.^ORCID

Abstract

AbstractThis paper studies a generalization of the shortest path tour problem with time windows (GSPTPTW). The aim is to find a single-origin single-destination shortest path, which has to pass through an ordered sequence of not necessarily disjoint node-subsets. Each node has a time window for each node-subset to which it belongs. We investigate the theoretical properties of GSPTPTW and propose a dynamic programming approach to solve it. Numerical results collected on a large set of new benchmark instances highlight the effectiveness of the proposed solution approach.

Funder

Universit├á della Calabria

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Control and Optimization

Link

https://link.springer.com/content/pdf/10.1007/s10589-022-00405-8.pdf

Reference27 articles.

1. Bajaj, C.P.: Some constrained shortest-route problems. Math. Methods Oper. Res. 15(1), 287–301 (1971). https://doi.org/10.1007/BF01939836

2. Festa, P.: Complexity analysis and optimization of the shortest path tour problem. Optim. Lett. 6, 163–175 (2012). https://doi.org/10.1007/s11590-010-0258-y

3. Festa, P., Guerriero, F., Laganà, D., Musmanno, R.: Solving the shortest path tour problem. Eur. J. Oper. Res. 230, 464–474 (2013). https://doi.org/10.1016/j.ejor.2013.04.029

4. Bhat, S., Rouskas, G.N.: Service-concatenation routing with applications to network functions virtualization. In: 2017 26th International Conference on Computer Communication and Networks (ICCCN), pp. 1–9. (2017). https://doi.org/10.1109/icccn.2017.8038463

5. Carrabs, F., Cerulli, R., Festa, P., Laureana, F.: On the forward shortest path tour problem. In: Sforza, A., Sterle, C. (eds.) Optimization and Decision Science: Methodologies and Applications, pp. 529–537. Springer, Berlin (2017). https://doi.org/10.1007/978-3-319-67308-0_53

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

1. Shortest Path Tour Problems;Encyclopedia of Optimization;2022-12-21