Hybrid genetic algorithm for the open capacitated arc routing problem

DOI10.1016/j.cor.2017.09.020zbMath1391.90597OpenAlexW2759104911MaRDI QIDQ1652524

Rafael Kendy Arakaki, Fábio Luiz Usberti

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.2017.09.020

zbMATH Keywords

metaheuristichybrid genetic algorithmopen capacitated arc routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ Multi-objective optimization of a nonlinear batch time-delay system with minimum system sensitivity ⋮ Pre-auction lane selection in an integrated production–distribution planning problem ⋮ A time-dependent hierarchical Chinese postman problem

Uses Software

• LEMON

Cites Work

• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• The open capacitated arc routing problem
• The arc partitioning problem
• Heuristics for a dynamic rural postman problem
• The fleet size and mix problem for capacitated arc routing
• Evolutionary algorithms for periodic arc routing problems
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Recent results on Arc Routing Problems: An annotated bibliography
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid genetic algorithm for the open capacitated arc routing problem