The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions

DOI10.1002/net.22010OpenAlexW3112624924MaRDI QIDQ6087141

Francesco Carrabs, Federica Laureana, Daniele Ferone, Ciriaco D'Ambrosio, Paola Festa

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22010

zbMATH Keywords

GRASPnetwork optimizationshortest path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

A generalized shortest path tour problem with time windows

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
• The constrained shortest path tour problem
• Complexity analysis and optimization of the shortest path tour problem
• A probabilistic heuristic for a computationally difficult set covering problem
• The edge Hamiltonian path problem is NP-complete
• A two-level metaheuristic for the all colors shortest path problem
• A heuristic approach to the overnight security service problem
• Shortest path tour problem with time windows
• Solving the shortest path tour problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• GRASP with path relinking heuristics for the antibandwidth problem
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• A GRASP for graph planarization
• An efficient exact approach for the constrained shortest path tour problem
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• Some constrained shortest-route problems

This page was built for publication: The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions