Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks

DOI10.1016/j.cor.2015.11.010zbMath1391.90653OpenAlexW2184613088MaRDI QIDQ1652107

Omar Dib, Laurent Moalic, Alexandre Caminada, Marie-Ange Manier

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.11.010

zbMATH Keywords

integer programminggenetic algorithmmeta-heuristicsVNSroutingshortest path problemhybrid meta-heuristicsroad networksDijkstraexact approaches

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Time dependent orienteering problem with time windows and service time dependent profits

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The Floyd-Warshall algorithm on graphs with negative cycles
• Variable neighborhood search
• Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
• Parallel Variable Neighborhood Search
• Branch-and-Bound Methods: A Survey

This page was built for publication: Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks