An efficient exact approach for the constrained shortest path tour problem

DOI10.1080/10556788.2018.1548015MaRDI QIDQ4972542zbMATH OpenOpenAlexWikidataFDO

Authors Daniele Ferone, Paola Festa, Francesca Guerriero

Publication date 25 November 2019

Published in Optimization Methods \& 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)

Recommendations

• The constrained shortest path tour problem
• Constrained shortest path tour problem: branch-and-price algorithm
• Solving the shortest path tour problem
• Complexity analysis and optimization of the shortest path tour problem
• On an exact method for the constrained shortest path problem

Cites work

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

Cited in

(20)

• Approximating corridors and tours via restriction and relaxation techniques
• Reachability in choice networks
• Solving the shortest path tour problem
• Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
• Reliable production process design problem: compact MILP model and ALNS-based primal heuristic
• Shortest paths with exclusive-disjunction arc pairs conflicts
• An exact bidirectional pulse algorithm for the constrained shortest path
• New formulations for the elementary shortest-path problem visiting a given set of nodes
• On an exact method for the constrained shortest path problem
• The ripple-spreading algorithm for shortest path tour problems
• An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
• A generalized shortest path tour problem with time windows
• 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
• The constrained shortest path tour problem
• Complexity analysis and optimization of the shortest path tour problem
• Solution approaches for the vehicle routing problem with occasional drivers and time windows
• A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization
• Constrained shortest path tour problem: branch-and-price algorithm

Describes a project that uses

Uses Software

• MersenneTwister
• GRASP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972542)