Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm

Delivering and collecting problems concern to situations where goods are delivered (or collected) in practical cases. For example, solid waste collection, postal services and snow removing. It can be modelled as the well-known Chinese Postman Problem on mixed graphs (MCPP). The MCPP is a fair model...

Full description

Bibliographic Details
Main Authors: Victor Hugo Resende Lima, Elias de Oliveira Lima, Hassan Sherafat
Format: Article
Language:English
Published: Universidade de Passo Fundo (UPF) 2020-03-01
Series:Revista Brasileira de Computação Aplicada
Subjects:
Online Access:http://seer.upf.br/index.php/rbca/article/view/9317
_version_ 1818512823494377472
author Victor Hugo Resende Lima
Elias de Oliveira Lima
Hassan Sherafat
author_facet Victor Hugo Resende Lima
Elias de Oliveira Lima
Hassan Sherafat
author_sort Victor Hugo Resende Lima
collection DOAJ
description Delivering and collecting problems concern to situations where goods are delivered (or collected) in practical cases. For example, solid waste collection, postal services and snow removing. It can be modelled as the well-known Chinese Postman Problem on mixed graphs (MCPP). The MCPP is a fair model for the delivering and collecting problem because its goal is to cover all links of a mixed graph with minimal cost. The objective of this paper is to develop an algorithm based on Ant Colony Optimization and apply it to MCPP solution. The MCPP is initially converted into an equivalent Travelling Salesman Problem (TSP) and then tackled on this second instance. The results were promising and comparable to some other algorithms. It was found results near of optimal solutions in some cases.
first_indexed 2024-12-10T23:52:27Z
format Article
id doaj.art-b0ad8bafb7cd48c1af38d3a20fc03925
institution Directory Open Access Journal
issn 2176-6649
language English
last_indexed 2024-12-10T23:52:27Z
publishDate 2020-03-01
publisher Universidade de Passo Fundo (UPF)
record_format Article
series Revista Brasileira de Computação Aplicada
spelling doaj.art-b0ad8bafb7cd48c1af38d3a20fc039252022-12-22T01:28:43ZengUniversidade de Passo Fundo (UPF)Revista Brasileira de Computação Aplicada2176-66492020-03-01121445310.5335/rbca.v12i1.93179317Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony AlgorithmVictor Hugo Resende LimaElias de Oliveira LimaHassan SherafatDelivering and collecting problems concern to situations where goods are delivered (or collected) in practical cases. For example, solid waste collection, postal services and snow removing. It can be modelled as the well-known Chinese Postman Problem on mixed graphs (MCPP). The MCPP is a fair model for the delivering and collecting problem because its goal is to cover all links of a mixed graph with minimal cost. The objective of this paper is to develop an algorithm based on Ant Colony Optimization and apply it to MCPP solution. The MCPP is initially converted into an equivalent Travelling Salesman Problem (TSP) and then tackled on this second instance. The results were promising and comparable to some other algorithms. It was found results near of optimal solutions in some cases.http://seer.upf.br/index.php/rbca/article/view/9317problema de roteamento de arcosproblema do carteiro chinêsproblema do caixeiro viajantemetaheurística
spellingShingle Victor Hugo Resende Lima
Elias de Oliveira Lima
Hassan Sherafat
Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm
Revista Brasileira de Computação Aplicada
problema de roteamento de arcos
problema do carteiro chinês
problema do caixeiro viajante
metaheurística
title Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm
title_full Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm
title_fullStr Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm
title_full_unstemmed Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm
title_short Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm
title_sort roteirization of vehicles in the delivery collection problems application of a modifed ant colony algorithm
topic problema de roteamento de arcos
problema do carteiro chinês
problema do caixeiro viajante
metaheurística
url http://seer.upf.br/index.php/rbca/article/view/9317
work_keys_str_mv AT victorhugoresendelima roteirizationofvehiclesinthedeliverycollectionproblemsapplicationofamodifedantcolonyalgorithm
AT eliasdeoliveiralima roteirizationofvehiclesinthedeliverycollectionproblemsapplicationofamodifedantcolonyalgorithm
AT hassansherafat roteirizationofvehiclesinthedeliverycollectionproblemsapplicationofamodifedantcolonyalgorithm