A new ant colony optimization algorithm to solve the periodic capacitated arc routing problem with continuous moves

DOI10.1155/2019/3201656zbMath1435.90150OpenAlexW2964779613MaRDI QIDQ2298280

Guilherme V. Batista, Cassius T. Scarpin, Angel Ruiz, José Eduardo jun. Pécora

Publication date: 20 February 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/3201656

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ An improved multi-objective framework for the rich arc routing problem

Uses Software

• VRP

Cites Work

• Location arc routing problem with inventory constraints
• Inventory routing with continuous moves
• Evolutionary algorithms for periodic arc routing problems
• The periodic capacitated arc routing problem with irregular services
• Industrial aspects and literature survey: Combined inventory management and routing
• An optimization algorithm for the inventory routing problem with continuous moves
• Road network monitoring: algorithms and a case study
• A scatter search for the periodic capacitated arc routing problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

This page was built for publication: A new ant colony optimization algorithm to solve the periodic capacitated arc routing problem with continuous moves