Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks
type: Item
instance of: scholarly article
title: Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks
zbMATH Open document ID: 1391.90653
author: Omar Dib
author: Marie-Ange Manier
author: Laurent Moalic
author: Alexandre Caminada
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6901312
zbMATH Keywords: routing
zbMATH Keywords: road networks
zbMATH Keywords: shortest path problem
zbMATH Keywords: exact approaches
zbMATH Keywords: Dijkstra
zbMATH Keywords: integer programming
zbMATH Keywords: meta-heuristics
zbMATH Keywords: genetic algorithm
zbMATH Keywords: VNS
zbMATH Keywords: hybrid meta-heuristics
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2015.11.010
OpenAlex ID: W2184613088
cites work: A note on two problems in connexion with graphs
cites work: The Floyd-Warshall algorithm on graphs with negative cycles
cites work: Q3574261
cites work: Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
cites work: Q4414647
cites work: Variable neighborhood search
cites work: Branch-and-Bound Methods: A Survey
cites work: Q4354785
cites work: Parallel Variable Neighborhood Search
cites work: Q4667329
DOI: 10.1016/J.COR.2015.11.010
description: scientific article; zbMATH DE number 6901312