On the periodic hierarchical Chinese postman problem

<p dir="ltr">This paper presents a mathematical formulation and a heuristic approach for a new variant of the Hierarchical Chinese Postman Problem (HCPP). Indeed, we introduce the concept of periodicity, and we define and solve, for the first time, the Periodic-HCPP, denoted as P-HCP...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Muhammed Emre Keskin (19457413) (author)
مؤلفون آخرون: Chefi Triki (14158860) (author)
منشور في: 2021
الموضوعات:
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513506178498560
author Muhammed Emre Keskin (19457413)
author2 Chefi Triki (14158860)
author2_role author
author_facet Muhammed Emre Keskin (19457413)
Chefi Triki (14158860)
author_role author
dc.creator.none.fl_str_mv Muhammed Emre Keskin (19457413)
Chefi Triki (14158860)
dc.date.none.fl_str_mv 2021-11-01T00:00:00Z
dc.identifier.none.fl_str_mv 10.1007/s00500-021-06213-2
dc.relation.none.fl_str_mv https://figshare.com/articles/journal_contribution/On_the_periodic_hierarchical_Chinese_postman_problem/26889394
dc.rights.none.fl_str_mv CC BY 4.0
info:eu-repo/semantics/openAccess
dc.subject.none.fl_str_mv Information and computing sciences
Artificial intelligence
Computer vision and multimedia computation
Data management and data science
Hierarchical Chinese postman problem
Periodicity restrictions
Layer algorithm
Simulated annealing
Etc
dc.title.none.fl_str_mv On the periodic hierarchical Chinese postman problem
dc.type.none.fl_str_mv Text
Journal contribution
info:eu-repo/semantics/publishedVersion
text
contribution to journal
description <p dir="ltr">This paper presents a mathematical formulation and a heuristic approach for a new variant of the Hierarchical Chinese Postman Problem (HCPP). Indeed, we introduce the concept of periodicity, and we define and solve, for the first time, the Periodic-HCPP, denoted as P-HCPP. Given that the resulting integer programming model makes use of a big number of binary variables and given the extended time horizon considered, 30 days in our case, the problem is characterized by a high level of complexity. However, our developed heuristic is able to solve instances having up to 40 nodes, 520 arcs and 5 hierarchies, whereas a general-purpose solver like Gurobi was not able to provide solutions for instances having more than 10 nodes. While the collected results are very encouraging, we provide at the end of this paper a set of possible future extensions of this work.</p><h2>Other Information</h2><p dir="ltr">Published in: Soft Computing<br>License: <a href="https://creativecommons.org/licenses/by/4.0" target="_blank">https://creativecommons.org/licenses/by/4.0</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1007/s00500-021-06213-2" target="_blank">https://dx.doi.org/10.1007/s00500-021-06213-2</a></p>
eu_rights_str_mv openAccess
id Manara2_c1e40afa5a4fb920c99969a9613db366
identifier_str_mv 10.1007/s00500-021-06213-2
network_acronym_str Manara2
network_name_str Manara2
oai_identifier_str oai:figshare.com:article/26889394
publishDate 2021
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
rights_invalid_str_mv CC BY 4.0
spelling On the periodic hierarchical Chinese postman problemMuhammed Emre Keskin (19457413)Chefi Triki (14158860)Information and computing sciencesArtificial intelligenceComputer vision and multimedia computationData management and data scienceHierarchical Chinese postman problemPeriodicity restrictionsLayer algorithmSimulated annealingEtc<p dir="ltr">This paper presents a mathematical formulation and a heuristic approach for a new variant of the Hierarchical Chinese Postman Problem (HCPP). Indeed, we introduce the concept of periodicity, and we define and solve, for the first time, the Periodic-HCPP, denoted as P-HCPP. Given that the resulting integer programming model makes use of a big number of binary variables and given the extended time horizon considered, 30 days in our case, the problem is characterized by a high level of complexity. However, our developed heuristic is able to solve instances having up to 40 nodes, 520 arcs and 5 hierarchies, whereas a general-purpose solver like Gurobi was not able to provide solutions for instances having more than 10 nodes. While the collected results are very encouraging, we provide at the end of this paper a set of possible future extensions of this work.</p><h2>Other Information</h2><p dir="ltr">Published in: Soft Computing<br>License: <a href="https://creativecommons.org/licenses/by/4.0" target="_blank">https://creativecommons.org/licenses/by/4.0</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1007/s00500-021-06213-2" target="_blank">https://dx.doi.org/10.1007/s00500-021-06213-2</a></p>2021-11-01T00:00:00ZTextJournal contributioninfo:eu-repo/semantics/publishedVersiontextcontribution to journal10.1007/s00500-021-06213-2https://figshare.com/articles/journal_contribution/On_the_periodic_hierarchical_Chinese_postman_problem/26889394CC BY 4.0info:eu-repo/semantics/openAccessoai:figshare.com:article/268893942021-11-01T00:00:00Z
spellingShingle On the periodic hierarchical Chinese postman problem
Muhammed Emre Keskin (19457413)
Information and computing sciences
Artificial intelligence
Computer vision and multimedia computation
Data management and data science
Hierarchical Chinese postman problem
Periodicity restrictions
Layer algorithm
Simulated annealing
Etc
status_str publishedVersion
title On the periodic hierarchical Chinese postman problem
title_full On the periodic hierarchical Chinese postman problem
title_fullStr On the periodic hierarchical Chinese postman problem
title_full_unstemmed On the periodic hierarchical Chinese postman problem
title_short On the periodic hierarchical Chinese postman problem
title_sort On the periodic hierarchical Chinese postman problem
topic Information and computing sciences
Artificial intelligence
Computer vision and multimedia computation
Data management and data science
Hierarchical Chinese postman problem
Periodicity restrictions
Layer algorithm
Simulated annealing
Etc