Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks

详细信息    查看全文

• 作者：Omar Dib^a ; ^b ; ^{omar.dib@irt-systemx.fr} ; ^{omar.dib@utbm.fr} ; Marie-Ange Manier^b ; ^{marie-ange.manier@utbm.fr} ; Laurent Moalic^b ; ^{laurent.moalic@utbm.fr} ; Alexandre Caminada^b ; ^{alexandre.caminada@utbm.fr}
• 关键词：Routing ; Road networks ; Shortest path problem ; Exact approaches ; Dijkstra ; Integer Programming ; Meta-heuristics ; Genetic Algorithm ; VNS ; Hybrid meta-heuristics
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：420-430
• 全文大小：3119 K
• 卷排序：78

文摘

We solve the shortest path problem using hybrid metaheuristic. We combine Genetic Algorithm with VNS. We compare our approach with two exact approaches (Dijkstra and Integer Programming). We compare our approach with other metaheuristics Genetic Algorithm and VNS. The hybrid meta-heuristics we used outperforms other approaches.