A two-level metaheuristic for the all colors shortest path problem

DOI10.1007/s10589-018-0014-2zbMath1409.90213OpenAlexW2806379636WikidataQ129712912 ScholiaQ129712912MaRDI QIDQ1616945

Francesco Carrabs, Rosa Pentangelo, Raffaele Cerulli, Andrea Raiconi

Publication date: 7 November 2018

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

Full work available at URL: https://doi.org/10.1007/s10589-018-0014-2

zbMATH Keywords

shortest pathcolored graphvariable neighboord search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions, Shortest paths with exclusive-disjunction arc pairs conflicts, An exact reduction technique for the k-colour shortest path problem

Cites Work

• Unnamed Item
• A random-key genetic algorithm for the generalized traveling salesman problem
• A tabu search heuristic for the generalized minimum spanning tree problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• Class Steiner trees and VLSI-design
• An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
• Generalized spanning trees
• Solving the shortest path tour problem
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• A new relaxation method for the generalized minimum spanning tree problem
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
• On the generalized minimum spanning tree problem
• The symmetric generalized traveling salesman polytope