An efficient exact approach for the constrained shortest path tour problem

DOI10.1080/10556788.2018.1548015zbMath1433.90177OpenAlexW2909366371WikidataQ128555904 ScholiaQ128555904MaRDI QIDQ4972542

Daniele Ferone, Paola Festa, Francesca Guerriero

Publication date: 25 November 2019

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2018.1548015

zbMATH Keywords

capacity constraintsbranch \& boundshortest path problemsshortest path tour problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (9)

Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ Constrained shortest path tour problem: branch-and-price algorithm ⋮ Analyzing the reachability problem in choice networks ⋮ Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics ⋮ The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions ⋮ Reachability in choice networks ⋮ Shortest paths with exclusive-disjunction arc pairs conflicts ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ A generalized shortest path tour problem with time windows

Uses Software

• GRASP
• MersenneTwister

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• The constrained shortest path tour problem
• Complexity analysis and optimization of the shortest path tour problem
• Network survivability modeling
• A probabilistic heuristic for a computationally difficult set covering problem
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
• Greedy randomized adaptive search procedures
• Solving the shortest path tour problem
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
• A survey of resource constrained shortest path problems: Exact solution approaches
• Hybridizations of GRASP with path relinking for the far from most string problem
• An algorithm for the resource constrained shortest path problem
• A dual algorithm for the constrained shortest path problem
• Mersenne twister
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Some constrained shortest-route problems

This page was built for publication: An efficient exact approach for the constrained shortest path tour problem