Solving Heterogenous Fleet Capacitated Vehicle Routing Problem with Time Windows Using Cooperative Hybrid Firefly Algorithm Article Swipe
Defri Ananda
,
Eri Wirdianto
,
Rahmad Alfandi
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.25077/aijaset.v5i3.154
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.25077/aijaset.v5i3.154
The Vehicle Routing Problem with Time Windows (VRPTW) is a widely studied logistics optimization problem, and its complexity increases when heterogeneous fleets are considered. This study proposes the application of the Cooperative Hybrid Firefly Algorithm (CHFA), an extension of the Firefly Algorithm, to solve the Heterogeneous Vehicle Routing Problem with Soft Time Windows (HVRPSTW). The mathematical model was implemented in Python, tested on benchmark datasets, and adapted to a fleet consisting of three vehicle types with different capacities to serve 100 customers. The proposed CHFA achieved feasible routing solutions with a total transportation cost of IDR 17.58 million and a computation time of only 30 seconds. These results demonstrate that CHFA can provide fast and efficient solutions for complex routing problems, making it highly applicable in logistics operations that demand quick decision-making and cost efficiency.
Related Topics
Concepts
Vehicle routing problem
Benchmark (surveying)
Firefly algorithm
Computer science
Mathematical optimization
Routing (electronic design automation)
Firefly protocol
Computation
Hybrid algorithm (constraint satisfaction)
Extension (predicate logic)
Optimization problem
Hybrid system
Total cost
Distributed computing
Metadata
- Type
- article
- Landing Page
- https://doi.org/10.25077/aijaset.v5i3.154
- https://aijaset.lppm.unand.ac.id/index.php/aijaset/article/download/154/161
- OA Status
- diamond
- OpenAlex ID
- https://openalex.org/W7105740213
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W7105740213Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.25077/aijaset.v5i3.154Digital Object Identifier
- Title
-
Solving Heterogenous Fleet Capacitated Vehicle Routing Problem with Time Windows Using Cooperative Hybrid Firefly AlgorithmWork title
- Type
-
articleOpenAlex work type
- Publication year
-
2025Year of publication
- Publication date
-
2025-11-15Full publication date if available
- Authors
-
Defri Ananda, Eri Wirdianto, Rahmad AlfandiList of authors in order
- Landing page
-
https://doi.org/10.25077/aijaset.v5i3.154Publisher landing page
- PDF URL
-
https://aijaset.lppm.unand.ac.id/index.php/aijaset/article/download/154/161Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://aijaset.lppm.unand.ac.id/index.php/aijaset/article/download/154/161Direct OA link when available
- Concepts
-
Vehicle routing problem, Benchmark (surveying), Firefly algorithm, Computer science, Mathematical optimization, Routing (electronic design automation), Firefly protocol, Computation, Hybrid algorithm (constraint satisfaction), Extension (predicate logic), Optimization problem, Hybrid system, Total cost, Distributed computingTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W7105740213 |
|---|---|
| doi | https://doi.org/10.25077/aijaset.v5i3.154 |
| ids.doi | https://doi.org/10.25077/aijaset.v5i3.154 |
| ids.openalex | https://openalex.org/W7105740213 |
| fwci | 0.0 |
| type | article |
| title | Solving Heterogenous Fleet Capacitated Vehicle Routing Problem with Time Windows Using Cooperative Hybrid Firefly Algorithm |
| biblio.issue | 3 |
| biblio.volume | 5 |
| biblio.last_page | 250 |
| biblio.first_page | 241 |
| topics[0].id | https://openalex.org/T10567 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9652503728866577 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Vehicle Routing Optimization Methods |
| topics[1].id | https://openalex.org/T12176 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.0044572679325938225 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Optimization and Packing Problems |
| topics[2].id | https://openalex.org/T10100 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.004371210932731628 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Metaheuristic Optimization Algorithms Research |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C123784306 |
| concepts[0].level | 3 |
| concepts[0].score | 0.743869423866272 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q944041 |
| concepts[0].display_name | Vehicle routing problem |
| concepts[1].id | https://openalex.org/C185798385 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6941216588020325 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1161707 |
| concepts[1].display_name | Benchmark (surveying) |
| concepts[2].id | https://openalex.org/C154982244 |
| concepts[2].level | 3 |
| concepts[2].score | 0.675114095211029 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q5451844 |
| concepts[2].display_name | Firefly algorithm |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.6690994501113892 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C126255220 |
| concepts[4].level | 1 |
| concepts[4].score | 0.5627086758613586 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[4].display_name | Mathematical optimization |
| concepts[5].id | https://openalex.org/C74172769 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5481474995613098 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1446839 |
| concepts[5].display_name | Routing (electronic design automation) |
| concepts[6].id | https://openalex.org/C107477482 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4999696612358093 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q22570039 |
| concepts[6].display_name | Firefly protocol |
| concepts[7].id | https://openalex.org/C45374587 |
| concepts[7].level | 2 |
| concepts[7].score | 0.47204825282096863 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q12525525 |
| concepts[7].display_name | Computation |
| concepts[8].id | https://openalex.org/C62469222 |
| concepts[8].level | 5 |
| concepts[8].score | 0.36146223545074463 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q17092103 |
| concepts[8].display_name | Hybrid algorithm (constraint satisfaction) |
| concepts[9].id | https://openalex.org/C2778029271 |
| concepts[9].level | 2 |
| concepts[9].score | 0.35283714532852173 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q5421931 |
| concepts[9].display_name | Extension (predicate logic) |
| concepts[10].id | https://openalex.org/C137836250 |
| concepts[10].level | 2 |
| concepts[10].score | 0.2922024428844452 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[10].display_name | Optimization problem |
| concepts[11].id | https://openalex.org/C50897621 |
| concepts[11].level | 2 |
| concepts[11].score | 0.2803095877170563 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2665508 |
| concepts[11].display_name | Hybrid system |
| concepts[12].id | https://openalex.org/C182299520 |
| concepts[12].level | 2 |
| concepts[12].score | 0.2726079821586609 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q1289588 |
| concepts[12].display_name | Total cost |
| concepts[13].id | https://openalex.org/C120314980 |
| concepts[13].level | 1 |
| concepts[13].score | 0.2531929612159729 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[13].display_name | Distributed computing |
| keywords[0].id | https://openalex.org/keywords/vehicle-routing-problem |
| keywords[0].score | 0.743869423866272 |
| keywords[0].display_name | Vehicle routing problem |
| keywords[1].id | https://openalex.org/keywords/benchmark |
| keywords[1].score | 0.6941216588020325 |
| keywords[1].display_name | Benchmark (surveying) |
| keywords[2].id | https://openalex.org/keywords/firefly-algorithm |
| keywords[2].score | 0.675114095211029 |
| keywords[2].display_name | Firefly algorithm |
| keywords[3].id | https://openalex.org/keywords/routing |
| keywords[3].score | 0.5481474995613098 |
| keywords[3].display_name | Routing (electronic design automation) |
| keywords[4].id | https://openalex.org/keywords/firefly-protocol |
| keywords[4].score | 0.4999696612358093 |
| keywords[4].display_name | Firefly protocol |
| keywords[5].id | https://openalex.org/keywords/computation |
| keywords[5].score | 0.47204825282096863 |
| keywords[5].display_name | Computation |
| language | |
| locations[0].id | doi:10.25077/aijaset.v5i3.154 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210236363 |
| locations[0].source.issn | 2797-0442 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2797-0442 |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Andalasian International Journal of Applied Science Engineering and Technology |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].source.host_organization_lineage | |
| locations[0].license | cc-by-sa |
| locations[0].pdf_url | https://aijaset.lppm.unand.ac.id/index.php/aijaset/article/download/154/161 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by-sa |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Andalasian International Journal of Applied Science, Engineering and Technology |
| locations[0].landing_page_url | https://doi.org/10.25077/aijaset.v5i3.154 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A3196398163 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Defri Ananda |
| authorships[0].countries | ID |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I55892964 |
| authorships[0].affiliations[0].raw_affiliation_string | Universitas Andalas, Indonesia |
| authorships[0].institutions[0].id | https://openalex.org/I55892964 |
| authorships[0].institutions[0].ror | https://ror.org/https://ror.org/04ded0672 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I55892964 |
| authorships[0].institutions[0].country_code | ID |
| authorships[0].institutions[0].display_name | Andalas University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Defri Ananda |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | Universitas Andalas, Indonesia |
| authorships[1].author.id | https://openalex.org/A2734352186 |
| authorships[1].author.orcid | https://orcid.org/0009-0007-4082-1961 |
| authorships[1].author.display_name | Eri Wirdianto |
| authorships[1].countries | ID |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I55892964 |
| authorships[1].affiliations[0].raw_affiliation_string | Universitas Andalas, Indonesia |
| authorships[1].institutions[0].id | https://openalex.org/I55892964 |
| authorships[1].institutions[0].ror | https://ror.org/https://ror.org/04ded0672 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I55892964 |
| authorships[1].institutions[0].country_code | ID |
| authorships[1].institutions[0].display_name | Andalas University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Eri Wirdianto |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Universitas Andalas, Indonesia |
| authorships[2].author.id | |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Rahmad Alfandi |
| authorships[2].countries | ID |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I55892964 |
| authorships[2].affiliations[0].raw_affiliation_string | Universitas Andalas, Indonesia |
| authorships[2].institutions[0].id | https://openalex.org/I55892964 |
| authorships[2].institutions[0].ror | https://ror.org/https://ror.org/04ded0672 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I55892964 |
| authorships[2].institutions[0].country_code | ID |
| authorships[2].institutions[0].display_name | Andalas University |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Rahmad Alfandi |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Universitas Andalas, Indonesia |
| has_content.pdf | True |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://aijaset.lppm.unand.ac.id/index.php/aijaset/article/download/154/161 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-11-15T00:00:00 |
| display_name | Solving Heterogenous Fleet Capacitated Vehicle Routing Problem with Time Windows Using Cooperative Hybrid Firefly Algorithm |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-16T23:07:24.559242 |
| primary_topic.id | https://openalex.org/T10567 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9652503728866577 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Vehicle Routing Optimization Methods |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.25077/aijaset.v5i3.154 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210236363 |
| best_oa_location.source.issn | 2797-0442 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2797-0442 |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Andalasian International Journal of Applied Science Engineering and Technology |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.source.host_organization_lineage | |
| best_oa_location.license | cc-by-sa |
| best_oa_location.pdf_url | https://aijaset.lppm.unand.ac.id/index.php/aijaset/article/download/154/161 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by-sa |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Andalasian International Journal of Applied Science, Engineering and Technology |
| best_oa_location.landing_page_url | https://doi.org/10.25077/aijaset.v5i3.154 |
| primary_location.id | doi:10.25077/aijaset.v5i3.154 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210236363 |
| primary_location.source.issn | 2797-0442 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2797-0442 |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Andalasian International Journal of Applied Science Engineering and Technology |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.source.host_organization_lineage | |
| primary_location.license | cc-by-sa |
| primary_location.pdf_url | https://aijaset.lppm.unand.ac.id/index.php/aijaset/article/download/154/161 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by-sa |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Andalasian International Journal of Applied Science, Engineering and Technology |
| primary_location.landing_page_url | https://doi.org/10.25077/aijaset.v5i3.154 |
| publication_date | 2025-11-15 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 9, 68, 90, 99 |
| abstract_inverted_index.30 | 104 |
| abstract_inverted_index.an | 36 |
| abstract_inverted_index.in | 59, 125 |
| abstract_inverted_index.is | 8 |
| abstract_inverted_index.it | 122 |
| abstract_inverted_index.of | 29, 38, 71, 94, 102 |
| abstract_inverted_index.on | 62 |
| abstract_inverted_index.to | 42, 67, 78 |
| abstract_inverted_index.100 | 80 |
| abstract_inverted_index.IDR | 95 |
| abstract_inverted_index.The | 0, 54, 82 |
| abstract_inverted_index.and | 15, 65, 98, 114, 132 |
| abstract_inverted_index.are | 22 |
| abstract_inverted_index.can | 111 |
| abstract_inverted_index.for | 117 |
| abstract_inverted_index.its | 16 |
| abstract_inverted_index.the | 27, 30, 39, 44 |
| abstract_inverted_index.was | 57 |
| abstract_inverted_index.CHFA | 84, 110 |
| abstract_inverted_index.Soft | 50 |
| abstract_inverted_index.This | 24 |
| abstract_inverted_index.Time | 5, 51 |
| abstract_inverted_index.cost | 93, 133 |
| abstract_inverted_index.fast | 113 |
| abstract_inverted_index.only | 103 |
| abstract_inverted_index.that | 109, 128 |
| abstract_inverted_index.time | 101 |
| abstract_inverted_index.when | 19 |
| abstract_inverted_index.with | 4, 49, 75, 89 |
| abstract_inverted_index.17.58 | 96 |
| abstract_inverted_index.These | 106 |
| abstract_inverted_index.fleet | 69 |
| abstract_inverted_index.model | 56 |
| abstract_inverted_index.quick | 130 |
| abstract_inverted_index.serve | 79 |
| abstract_inverted_index.solve | 43 |
| abstract_inverted_index.study | 25 |
| abstract_inverted_index.three | 72 |
| abstract_inverted_index.total | 91 |
| abstract_inverted_index.types | 74 |
| abstract_inverted_index.Hybrid | 32 |
| abstract_inverted_index.demand | 129 |
| abstract_inverted_index.fleets | 21 |
| abstract_inverted_index.highly | 123 |
| abstract_inverted_index.making | 121 |
| abstract_inverted_index.tested | 61 |
| abstract_inverted_index.widely | 10 |
| abstract_inverted_index.(CHFA), | 35 |
| abstract_inverted_index.(VRPTW) | 7 |
| abstract_inverted_index.Firefly | 33, 40 |
| abstract_inverted_index.Problem | 3, 48 |
| abstract_inverted_index.Python, | 60 |
| abstract_inverted_index.Routing | 2, 47 |
| abstract_inverted_index.Vehicle | 1, 46 |
| abstract_inverted_index.Windows | 6, 52 |
| abstract_inverted_index.adapted | 66 |
| abstract_inverted_index.complex | 118 |
| abstract_inverted_index.million | 97 |
| abstract_inverted_index.provide | 112 |
| abstract_inverted_index.results | 107 |
| abstract_inverted_index.routing | 87, 119 |
| abstract_inverted_index.studied | 11 |
| abstract_inverted_index.vehicle | 73 |
| abstract_inverted_index.achieved | 85 |
| abstract_inverted_index.feasible | 86 |
| abstract_inverted_index.problem, | 14 |
| abstract_inverted_index.proposed | 83 |
| abstract_inverted_index.proposes | 26 |
| abstract_inverted_index.seconds. | 105 |
| abstract_inverted_index.Algorithm | 34 |
| abstract_inverted_index.benchmark | 63 |
| abstract_inverted_index.datasets, | 64 |
| abstract_inverted_index.different | 76 |
| abstract_inverted_index.efficient | 115 |
| abstract_inverted_index.extension | 37 |
| abstract_inverted_index.increases | 18 |
| abstract_inverted_index.logistics | 12, 126 |
| abstract_inverted_index.problems, | 120 |
| abstract_inverted_index.solutions | 88, 116 |
| abstract_inverted_index.(HVRPSTW). | 53 |
| abstract_inverted_index.Algorithm, | 41 |
| abstract_inverted_index.applicable | 124 |
| abstract_inverted_index.capacities | 77 |
| abstract_inverted_index.complexity | 17 |
| abstract_inverted_index.consisting | 70 |
| abstract_inverted_index.customers. | 81 |
| abstract_inverted_index.operations | 127 |
| abstract_inverted_index.Cooperative | 31 |
| abstract_inverted_index.application | 28 |
| abstract_inverted_index.computation | 100 |
| abstract_inverted_index.considered. | 23 |
| abstract_inverted_index.demonstrate | 108 |
| abstract_inverted_index.efficiency. | 134 |
| abstract_inverted_index.implemented | 58 |
| abstract_inverted_index.mathematical | 55 |
| abstract_inverted_index.optimization | 13 |
| abstract_inverted_index.Heterogeneous | 45 |
| abstract_inverted_index.heterogeneous | 20 |
| abstract_inverted_index.transportation | 92 |
| abstract_inverted_index.decision-making | 131 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile.value | 0.82777983 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |