Optimization of Chinese postman problem using fuzzy-based priority weighted graph

Autores:
Yadav, Jay Chandra
Rizwanullah, Mohammad
Tipo de recurso:
Article of journal
Fecha de publicación:
2024
Institución:
Universidad Pedagógica y Tecnológica de Colombia
Repositorio:
RiUPTC: Repositorio Institucional UPTC
Idioma:
OAI Identifier:
oai:repositorio.uptc.edu.co:001/20144
Acceso en línea:
https://repositorio.uptc.edu.co/handle/001/20144
https://doi.org/10.19053/uptc.01211048.17896
Palabra clave:
Priority
Eulerian tour
fleury algorithm
Dijkstra’s algorithms
Undirected Graph
Triangular Fuzzy Number
Prioridad
recorrido euleriano,
algoritmo de Fleury
algoritmo de Dijkstra
grafo no dirigido
número difuso triangular
Rights
openAccess
License
https://creativecommons.org/licenses/by-nc-nd/4.0/
id REPOUPTC2_581a856e711f8e8fd47545d9213d2124
oai_identifier_str oai:repositorio.uptc.edu.co:001/20144
network_acronym_str REPOUPTC2
network_name_str RiUPTC: Repositorio Institucional UPTC
repository_id_str
dc.title.es-ES.fl_str_mv Optimization of Chinese postman problem using fuzzy-based priority weighted graph
title Optimization of Chinese postman problem using fuzzy-based priority weighted graph
spellingShingle Optimization of Chinese postman problem using fuzzy-based priority weighted graph
Priority
Eulerian tour
fleury algorithm
Dijkstra’s algorithms
Undirected Graph
Triangular Fuzzy Number
Prioridad
recorrido euleriano,
algoritmo de Fleury
algoritmo de Dijkstra
grafo no dirigido
número difuso triangular
title_short Optimization of Chinese postman problem using fuzzy-based priority weighted graph
title_full Optimization of Chinese postman problem using fuzzy-based priority weighted graph
title_fullStr Optimization of Chinese postman problem using fuzzy-based priority weighted graph
title_full_unstemmed Optimization of Chinese postman problem using fuzzy-based priority weighted graph
title_sort Optimization of Chinese postman problem using fuzzy-based priority weighted graph
dc.creator.fl_str_mv Yadav, Jay Chandra
Rizwanullah, Mohammad
dc.contributor.author.eng.fl_str_mv Yadav, Jay Chandra
Rizwanullah, Mohammad
dc.subject.none.fl_str_mv Priority
Eulerian tour
fleury algorithm
Dijkstra’s algorithms
Undirected Graph
Triangular Fuzzy Number
Prioridad
recorrido euleriano,
algoritmo de Fleury
algoritmo de Dijkstra
grafo no dirigido
número difuso triangular
topic Priority
Eulerian tour
fleury algorithm
Dijkstra’s algorithms
Undirected Graph
Triangular Fuzzy Number
Prioridad
recorrido euleriano,
algoritmo de Fleury
algoritmo de Dijkstra
grafo no dirigido
número difuso triangular
publishDate 2024
dc.date.accessioned.none.fl_str_mv 2024-09-25 00:00:00
2026-04-16T17:28:22Z
dc.date.available.none.fl_str_mv 2024-09-25 00:00:00
dc.date.issued.none.fl_str_mv 2024-09-25
dc.type.spa.fl_str_mv Artículo de revista
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.coar.none.fl_str_mv http://purl.org/coar/resource_type/c_6501
dc.type.driver.none.fl_str_mv info:eu-repo/semantics/article
dc.type.local.eng.fl_str_mv Journal article
dc.type.version.none.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.content.none.fl_str_mv Text
dc.type.coarversion.none.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
format http://purl.org/coar/resource_type/c_6501
status_str publishedVersion
dc.identifier.issn.none.fl_str_mv 0121-1048
dc.identifier.uri.none.fl_str_mv https://repositorio.uptc.edu.co/handle/001/20144
dc.identifier.doi.none.fl_str_mv 10.19053/uptc.01211048.17896
dc.identifier.eissn.none.fl_str_mv 2422-3220
dc.identifier.url.none.fl_str_mv https://doi.org/10.19053/uptc.01211048.17896
identifier_str_mv 0121-1048
10.19053/uptc.01211048.17896
2422-3220
url https://repositorio.uptc.edu.co/handle/001/20144
https://doi.org/10.19053/uptc.01211048.17896
dc.language.iso.none.fl_str_mv
language_invalid_str_mv
dc.relation.references.none.fl_str_mv Campbell, J. F., Corberán, A., Plana, I., Sanchis, J. M., & Segura, P. (2021). Solving the length constrained K-drones rural postman problem. European Journal of Operational Research, 292(1), 60-72. https://doi.org/10.1016/j.ejor.2020.10.035
Keskin, M. E., & Triki, C. (2022). On the periodic hierarchical Chinese postman problem. Soft Computing, 26(2), 709-724. https://doi.org/10.1007/s00500-021-06213-2
Kramberger, T., & Zerovnik, J. (2005). Chinese postman problem with priorities. In Proceedings of the International Conference on Systems, Operational Research and Informatics (SOR) (Vol. 5, pp. 357-362).
Kramberger, T., & Zerovnik, J. (2007). Priority constrained Chinese postman problem. Logistics & Sustainable Transport, 1(1), 33-46.
Nilofer, M., & Rizwanullah, M. (2020). An implementation of Chinese postman problem with priorities. Journal of Intelligent & Fuzzy Systems, 38(3), 3301-3305. https://doi.org/10.3233/JIFS-190035
Sokmen, O. C., Emec, S., Yilmaz, M., & Akkaya, G. (2019, September). An overview of Chinese postman problem. In Proceeding of the 3rd International Conference on Advanced Engineering Technologies.
Tan, G., Cui, X., & Zhang, Y. (2005, October). Chinese postman problem in stochastic networks. In Proceeding in Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (pp. 78-78). IEEE. https://doi.org/10.1109/ICAS-ICNS.2005.31
Xin, J., Yu, B., D’Ariano, A., Wang, H., & Wang, M. (2022). Time-dependent rural postman problem: Time-space network formulation and genetic algorithm. Operational Research, 22(3), 2943-2972. https://doi.org/10.1007/s12351-021-00639-0
Yadav, J. C., & Rizwanullah, M. (2022, December). Combinatorial Optimization of Type-l Fuzzy Travelling Salesman Problem. In Proceeding of the 2022 International Conference on Computational Modelling, Simulation and Optimization (ICCMSO) (pp. 108-116). IEEE. https://doi.org/10.1109/ICCMSO58359.2022.00033
Yılmaz, M. (2021). Hierarchical Chinese postman problem with fuzzy travel times. Iranian Journal of Fuzzy Systems, 18(5), 87-105. https://doi.org/10.22111/ijfs.2021.6257
Yu, W., & Batta, R. (2010). Chinese Postman Problem. InWiley Encyclopedia of Operations Research and Management Science. https://doi.org/10.1002/9780470400531.eorms0142
Zhang, B., & Peng, J. (2015). Chinese Postman Problem in Unecertain Network. Proceedings of the Conference on Operations Research.
dc.relation.citationendpage.none.fl_str_mv 17
dc.relation.citationissue.eng.fl_str_mv 2
dc.relation.citationstartpage.none.fl_str_mv 1
dc.relation.citationvolume.eng.fl_str_mv 24
dc.relation.ispartofjournal.eng.fl_str_mv Inquietud Empresarial
dc.relation.bitstream.none.fl_str_mv https://revistas.uptc.edu.co/index.php/inquietud_empresarial/article/download/17896/14687
https://revistas.uptc.edu.co/index.php/inquietud_empresarial/article/download/17896/16018
dc.relation.citationedition.eng.fl_str_mv Núm. 2 , Año 2024 : Inquietud Empresarial 24(2) July-December
dc.rights.uri.none.fl_str_mv https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rights.accessrights.none.fl_str_mv info:eu-repo/semantics/openAccess
dc.rights.coar.none.fl_str_mv http://purl.org/coar/access_right/c_abf2
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/4.0/
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.mimetype.none.fl_str_mv application/pdf
text/xml
dc.publisher.eng.fl_str_mv Unidad Editorial UPTC
dc.source.none.fl_str_mv https://revistas.uptc.edu.co/index.php/inquietud_empresarial/article/view/17896
institution Universidad Pedagógica y Tecnológica de Colombia
bitstream.url.fl_str_mv https://repositorio.uptc.edu.co/bitstreams/603cc9e1-bda7-4f3e-a7a7-2e9a6015998f/download
bitstream.checksum.fl_str_mv b9c6d9c82a48db22435b63807e11404e
bitstream.checksumAlgorithm.fl_str_mv MD5
repository.name.fl_str_mv Repositorio Institucional UPTC
repository.mail.fl_str_mv bdigital@metabiblioteca.com
_version_ 1881673885710024704
spelling Yadav, Jay ChandraRizwanullah, Mohammad2024-09-25 00:00:002026-04-16T17:28:22Z2024-09-25 00:00:002024-09-250121-1048https://repositorio.uptc.edu.co/handle/001/2014410.19053/uptc.01211048.178962422-3220https://doi.org/10.19053/uptc.01211048.17896application/pdftext/xmlUnidad Editorial UPTChttps://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.http://purl.org/coar/access_right/c_abf2https://revistas.uptc.edu.co/index.php/inquietud_empresarial/article/view/17896PriorityEulerian tourfleury algorithmDijkstra’s algorithmsUndirected GraphTriangular Fuzzy NumberPrioridadrecorrido euleriano,algoritmo de Fleuryalgoritmo de Dijkstragrafo no dirigidonúmero difuso triangularOptimization of Chinese postman problem using fuzzy-based priority weighted graphArtículo de revistahttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1info:eu-repo/semantics/articleJournal articleinfo:eu-repo/semantics/publishedVersionTexthttp://purl.org/coar/version/c_970fb48d4fbd8a85Campbell, J. F., Corberán, A., Plana, I., Sanchis, J. M., & Segura, P. (2021). Solving the length constrained K-drones rural postman problem. European Journal of Operational Research, 292(1), 60-72. https://doi.org/10.1016/j.ejor.2020.10.035Keskin, M. E., & Triki, C. (2022). On the periodic hierarchical Chinese postman problem. Soft Computing, 26(2), 709-724. https://doi.org/10.1007/s00500-021-06213-2Kramberger, T., & Zerovnik, J. (2005). Chinese postman problem with priorities. In Proceedings of the International Conference on Systems, Operational Research and Informatics (SOR) (Vol. 5, pp. 357-362).Kramberger, T., & Zerovnik, J. (2007). Priority constrained Chinese postman problem. Logistics & Sustainable Transport, 1(1), 33-46.Nilofer, M., & Rizwanullah, M. (2020). An implementation of Chinese postman problem with priorities. Journal of Intelligent & Fuzzy Systems, 38(3), 3301-3305. https://doi.org/10.3233/JIFS-190035Sokmen, O. C., Emec, S., Yilmaz, M., & Akkaya, G. (2019, September). An overview of Chinese postman problem. In Proceeding of the 3rd International Conference on Advanced Engineering Technologies.Tan, G., Cui, X., & Zhang, Y. (2005, October). Chinese postman problem in stochastic networks. In Proceeding in Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (pp. 78-78). IEEE. https://doi.org/10.1109/ICAS-ICNS.2005.31Xin, J., Yu, B., D’Ariano, A., Wang, H., & Wang, M. (2022). Time-dependent rural postman problem: Time-space network formulation and genetic algorithm. Operational Research, 22(3), 2943-2972. https://doi.org/10.1007/s12351-021-00639-0Yadav, J. C., & Rizwanullah, M. (2022, December). Combinatorial Optimization of Type-l Fuzzy Travelling Salesman Problem. In Proceeding of the 2022 International Conference on Computational Modelling, Simulation and Optimization (ICCMSO) (pp. 108-116). IEEE. https://doi.org/10.1109/ICCMSO58359.2022.00033Yılmaz, M. (2021). Hierarchical Chinese postman problem with fuzzy travel times. Iranian Journal of Fuzzy Systems, 18(5), 87-105. https://doi.org/10.22111/ijfs.2021.6257Yu, W., & Batta, R. (2010). Chinese Postman Problem. InWiley Encyclopedia of Operations Research and Management Science. https://doi.org/10.1002/9780470400531.eorms0142Zhang, B., & Peng, J. (2015). Chinese Postman Problem in Unecertain Network. Proceedings of the Conference on Operations Research.172124Inquietud Empresarialhttps://revistas.uptc.edu.co/index.php/inquietud_empresarial/article/download/17896/14687https://revistas.uptc.edu.co/index.php/inquietud_empresarial/article/download/17896/16018Núm. 2 , Año 2024 : Inquietud Empresarial 24(2) July-DecemberPublicationOREORE.xmltext/xml2598https://repositorio.uptc.edu.co/bitstreams/603cc9e1-bda7-4f3e-a7a7-2e9a6015998f/downloadb9c6d9c82a48db22435b63807e11404eMD51falseAnonymousREAD001/20144oai:repositorio.uptc.edu.co:001/201442026-10-30 06:38:37.831https://creativecommons.org/licenses/by-nc-nd/4.0/metadata.onlyhttps://repositorio.uptc.edu.coRepositorio Institucional UPTCbdigital@metabiblioteca.com

Publicaciones similares