A generalized shortest path tour problem with time windows

DOI10.1007/s10589-022-00405-8zbMath1502.90181OpenAlexW4292565479MaRDI QIDQ2082551

Paola Festa, Luigi Di Puglia Pugliese, Daniele Ferone, Francesca Guerriero

Publication date: 4 October 2022

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-022-00405-8

zbMATH Keywords

dynamic programmingtime windowsdisjoint subsetsgeneralized shortest path tour problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Dimensionality reduction in multiobjective shortest path search
• The constrained shortest path tour problem
• Complexity analysis and optimization of the shortest path tour problem
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
• An efficient transformation of the generalized vehicle routing problem
• A dynamic programming algorithm for solving the \(k\)-color shortest path problem
• Constrained shortest path tour problem: branch-and-price algorithm
• Shortest path tour problem with time windows
• Solving the shortest path tour problem
• An improved multiobjective shortest path algorithm
• A survey of resource constrained shortest path problems: Exact solution approaches
• Plus court chemin avec contraintes d'horaires
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Robust constrained shortest path problems under budgeted uncertainty
• An efficient exact approach for the constrained shortest path tour problem
• A rollout algorithm for the resource constrained elementary shortest path problem
• Some constrained shortest-route problems
• Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics
• The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions