Loading…

Designing an Energy-Efficient Transportation Network to Transport Perishable Crops: An Aggregated VRP and X-means Clustering Approach

Almost all perishable crops deteriorate due to improper and tardy transportation and storage. Vehicle Routing Problem, or VRP, might be of great aid since it takes into account a number of aspects of any transportation and storage issues and optimizes them in such a way as to reduce the overall cost...

Full description

Saved in:
Bibliographic Details
Published in:Heliyon 2023-09, Vol.9 (9), p.e19692-e19692, Article e19692
Main Authors: Rahul, Joydev Karmakar, Chakraborty, Souvik, Khayer, Nabila, Uddin, Md. Foysal, Haque, Maliha Rajwana
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c459t-705859fce6ce803394b80d94fb33a0db573f4c272758d2a5902c0773d4538d3e3
container_end_page e19692
container_issue 9
container_start_page e19692
container_title Heliyon
container_volume 9
creator Rahul, Joydev Karmakar
Chakraborty, Souvik
Khayer, Nabila
Uddin, Md. Foysal
Haque, Maliha Rajwana
description Almost all perishable crops deteriorate due to improper and tardy transportation and storage. Vehicle Routing Problem, or VRP, might be of great aid since it takes into account a number of aspects of any transportation and storage issues and optimizes them in such a way as to reduce the overall cost of the carrier. This study attempts to widen the scope of the commonly used VRP model by including traffic and energy consumption features and transforming it into the Aggregated Vehicle Routing Problem (AVRP). Traditional VRP focuses on minimizing distance. Generally, it is unable to find out the optimal number of aggregation points required to serve a system. So, cost optimization of the AVRP approach was designed with two specialized steps. Firstly, the destination data are divided into multiple clusters employing the X-means clustering. And then the best route was found to execute the delivery thus minimizing cost, required time, and carbon footprint. The study was implemented on the Chattogram zone and discovered that the optimal number of aggregation points (AP) required to serve Chattogram is only three namely- AP 1, AP 2, and AP 3. VRP analysis was stretched further with AVRP model using AP 1 and found to reduce the operating cost by 10.96%.
doi_str_mv 10.1016/j.heliyon.2023.e19692
format article
fullrecord <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_f3e3882f9aac473da19af5084245f7c9</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S2405844023069001</els_id><doaj_id>oai_doaj_org_article_f3e3882f9aac473da19af5084245f7c9</doaj_id><sourcerecordid>2874835418</sourcerecordid><originalsourceid>FETCH-LOGICAL-c459t-705859fce6ce803394b80d94fb33a0db573f4c272758d2a5902c0773d4538d3e3</originalsourceid><addsrcrecordid>eNqFks9uEzEQxlcIJKq2j4DkI5cNXv_J2lxQFFKoVEGFCuJmeb3jjcPGXmynKA_Ae9chEaUnTh55vvmNPfNV1asGzxrczN9sZmsY3T74GcGEzqCRc0meVWeEYV4LxvDzf-KX1WVKG4xxw8VctvSs-v0ekhu88wPSHq08xGFfr6x1xoHP6C5qn6YQs84uePQJ8q8Qf6AcHjPoFqJLa92NgJYxTOktWni0GIYIg87Qo29fbgu7R9_rLZQatBx3KZea0nIxTTFos76oXlg9Jrg8nefV16vV3fJjffP5w_VycVMbxmWuW8wFl9bA3IDAlErWCdxLZjtKNe473lLLDGlJy0VPNJeYGNy2tGecip4CPa-uj9w-6I2aotvquFdBO_XnIsRB6ZidGUHZIheCWKm1YQWhG6ktx4IRxm1rZGG9O7KmXbeF3pRxRT0-gT7NeLdWQ7hXDeZcSM4L4fWJEMPPHaSsti4ZGEftIeySIqJlgnLWiCLlR6mJIaUI9m-fBquDD9RGnXygDj5QRx88PhLKVO8dRJUOizXQuwgml2-7_xAeACdXwO0</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2874835418</pqid></control><display><type>article</type><title>Designing an Energy-Efficient Transportation Network to Transport Perishable Crops: An Aggregated VRP and X-means Clustering Approach</title><source>Open Access: PubMed Central</source><source>ScienceDirect Journals</source><creator>Rahul, Joydev Karmakar ; Chakraborty, Souvik ; Khayer, Nabila ; Uddin, Md. Foysal ; Haque, Maliha Rajwana</creator><creatorcontrib>Rahul, Joydev Karmakar ; Chakraborty, Souvik ; Khayer, Nabila ; Uddin, Md. Foysal ; Haque, Maliha Rajwana</creatorcontrib><description>Almost all perishable crops deteriorate due to improper and tardy transportation and storage. Vehicle Routing Problem, or VRP, might be of great aid since it takes into account a number of aspects of any transportation and storage issues and optimizes them in such a way as to reduce the overall cost of the carrier. This study attempts to widen the scope of the commonly used VRP model by including traffic and energy consumption features and transforming it into the Aggregated Vehicle Routing Problem (AVRP). Traditional VRP focuses on minimizing distance. Generally, it is unable to find out the optimal number of aggregation points required to serve a system. So, cost optimization of the AVRP approach was designed with two specialized steps. Firstly, the destination data are divided into multiple clusters employing the X-means clustering. And then the best route was found to execute the delivery thus minimizing cost, required time, and carbon footprint. The study was implemented on the Chattogram zone and discovered that the optimal number of aggregation points (AP) required to serve Chattogram is only three namely- AP 1, AP 2, and AP 3. VRP analysis was stretched further with AVRP model using AP 1 and found to reduce the operating cost by 10.96%.</description><identifier>ISSN: 2405-8440</identifier><identifier>EISSN: 2405-8440</identifier><identifier>DOI: 10.1016/j.heliyon.2023.e19692</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Aggregated Vehicle Routing Problem ; Aggregation Points ; Cost Optimization ; Perishable Crops ; X-means Clustering</subject><ispartof>Heliyon, 2023-09, Vol.9 (9), p.e19692-e19692, Article e19692</ispartof><rights>2023 The Authors</rights><rights>2023 The Authors 2023</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c459t-705859fce6ce803394b80d94fb33a0db573f4c272758d2a5902c0773d4538d3e3</cites><orcidid>0000-0002-6926-1204 ; 0000-0002-1291-9255</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC10558955/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S2405844023069001$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>230,314,727,780,784,885,3549,27924,27925,45780,53791,53793</link.rule.ids></links><search><creatorcontrib>Rahul, Joydev Karmakar</creatorcontrib><creatorcontrib>Chakraborty, Souvik</creatorcontrib><creatorcontrib>Khayer, Nabila</creatorcontrib><creatorcontrib>Uddin, Md. Foysal</creatorcontrib><creatorcontrib>Haque, Maliha Rajwana</creatorcontrib><title>Designing an Energy-Efficient Transportation Network to Transport Perishable Crops: An Aggregated VRP and X-means Clustering Approach</title><title>Heliyon</title><description>Almost all perishable crops deteriorate due to improper and tardy transportation and storage. Vehicle Routing Problem, or VRP, might be of great aid since it takes into account a number of aspects of any transportation and storage issues and optimizes them in such a way as to reduce the overall cost of the carrier. This study attempts to widen the scope of the commonly used VRP model by including traffic and energy consumption features and transforming it into the Aggregated Vehicle Routing Problem (AVRP). Traditional VRP focuses on minimizing distance. Generally, it is unable to find out the optimal number of aggregation points required to serve a system. So, cost optimization of the AVRP approach was designed with two specialized steps. Firstly, the destination data are divided into multiple clusters employing the X-means clustering. And then the best route was found to execute the delivery thus minimizing cost, required time, and carbon footprint. The study was implemented on the Chattogram zone and discovered that the optimal number of aggregation points (AP) required to serve Chattogram is only three namely- AP 1, AP 2, and AP 3. VRP analysis was stretched further with AVRP model using AP 1 and found to reduce the operating cost by 10.96%.</description><subject>Aggregated Vehicle Routing Problem</subject><subject>Aggregation Points</subject><subject>Cost Optimization</subject><subject>Perishable Crops</subject><subject>X-means Clustering</subject><issn>2405-8440</issn><issn>2405-8440</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>DOA</sourceid><recordid>eNqFks9uEzEQxlcIJKq2j4DkI5cNXv_J2lxQFFKoVEGFCuJmeb3jjcPGXmynKA_Ae9chEaUnTh55vvmNPfNV1asGzxrczN9sZmsY3T74GcGEzqCRc0meVWeEYV4LxvDzf-KX1WVKG4xxw8VctvSs-v0ekhu88wPSHq08xGFfr6x1xoHP6C5qn6YQs84uePQJ8q8Qf6AcHjPoFqJLa92NgJYxTOktWni0GIYIg87Qo29fbgu7R9_rLZQatBx3KZea0nIxTTFos76oXlg9Jrg8nefV16vV3fJjffP5w_VycVMbxmWuW8wFl9bA3IDAlErWCdxLZjtKNe473lLLDGlJy0VPNJeYGNy2tGecip4CPa-uj9w-6I2aotvquFdBO_XnIsRB6ZidGUHZIheCWKm1YQWhG6ktx4IRxm1rZGG9O7KmXbeF3pRxRT0-gT7NeLdWQ7hXDeZcSM4L4fWJEMPPHaSsti4ZGEftIeySIqJlgnLWiCLlR6mJIaUI9m-fBquDD9RGnXygDj5QRx88PhLKVO8dRJUOizXQuwgml2-7_xAeACdXwO0</recordid><startdate>20230901</startdate><enddate>20230901</enddate><creator>Rahul, Joydev Karmakar</creator><creator>Chakraborty, Souvik</creator><creator>Khayer, Nabila</creator><creator>Uddin, Md. Foysal</creator><creator>Haque, Maliha Rajwana</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-6926-1204</orcidid><orcidid>https://orcid.org/0000-0002-1291-9255</orcidid></search><sort><creationdate>20230901</creationdate><title>Designing an Energy-Efficient Transportation Network to Transport Perishable Crops: An Aggregated VRP and X-means Clustering Approach</title><author>Rahul, Joydev Karmakar ; Chakraborty, Souvik ; Khayer, Nabila ; Uddin, Md. Foysal ; Haque, Maliha Rajwana</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c459t-705859fce6ce803394b80d94fb33a0db573f4c272758d2a5902c0773d4538d3e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Aggregated Vehicle Routing Problem</topic><topic>Aggregation Points</topic><topic>Cost Optimization</topic><topic>Perishable Crops</topic><topic>X-means Clustering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rahul, Joydev Karmakar</creatorcontrib><creatorcontrib>Chakraborty, Souvik</creatorcontrib><creatorcontrib>Khayer, Nabila</creatorcontrib><creatorcontrib>Uddin, Md. Foysal</creatorcontrib><creatorcontrib>Haque, Maliha Rajwana</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>Heliyon</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rahul, Joydev Karmakar</au><au>Chakraborty, Souvik</au><au>Khayer, Nabila</au><au>Uddin, Md. Foysal</au><au>Haque, Maliha Rajwana</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Designing an Energy-Efficient Transportation Network to Transport Perishable Crops: An Aggregated VRP and X-means Clustering Approach</atitle><jtitle>Heliyon</jtitle><date>2023-09-01</date><risdate>2023</risdate><volume>9</volume><issue>9</issue><spage>e19692</spage><epage>e19692</epage><pages>e19692-e19692</pages><artnum>e19692</artnum><issn>2405-8440</issn><eissn>2405-8440</eissn><abstract>Almost all perishable crops deteriorate due to improper and tardy transportation and storage. Vehicle Routing Problem, or VRP, might be of great aid since it takes into account a number of aspects of any transportation and storage issues and optimizes them in such a way as to reduce the overall cost of the carrier. This study attempts to widen the scope of the commonly used VRP model by including traffic and energy consumption features and transforming it into the Aggregated Vehicle Routing Problem (AVRP). Traditional VRP focuses on minimizing distance. Generally, it is unable to find out the optimal number of aggregation points required to serve a system. So, cost optimization of the AVRP approach was designed with two specialized steps. Firstly, the destination data are divided into multiple clusters employing the X-means clustering. And then the best route was found to execute the delivery thus minimizing cost, required time, and carbon footprint. The study was implemented on the Chattogram zone and discovered that the optimal number of aggregation points (AP) required to serve Chattogram is only three namely- AP 1, AP 2, and AP 3. VRP analysis was stretched further with AVRP model using AP 1 and found to reduce the operating cost by 10.96%.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.heliyon.2023.e19692</doi><orcidid>https://orcid.org/0000-0002-6926-1204</orcidid><orcidid>https://orcid.org/0000-0002-1291-9255</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2405-8440
ispartof Heliyon, 2023-09, Vol.9 (9), p.e19692-e19692, Article e19692
issn 2405-8440
2405-8440
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_f3e3882f9aac473da19af5084245f7c9
source Open Access: PubMed Central; ScienceDirect Journals
subjects Aggregated Vehicle Routing Problem
Aggregation Points
Cost Optimization
Perishable Crops
X-means Clustering
title Designing an Energy-Efficient Transportation Network to Transport Perishable Crops: An Aggregated VRP and X-means Clustering Approach
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T21%3A57%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Designing%20an%20Energy-Efficient%20Transportation%20Network%20to%20Transport%20Perishable%20Crops:%20An%20Aggregated%20VRP%20and%20X-means%20Clustering%20Approach&rft.jtitle=Heliyon&rft.au=Rahul,%20Joydev%20Karmakar&rft.date=2023-09-01&rft.volume=9&rft.issue=9&rft.spage=e19692&rft.epage=e19692&rft.pages=e19692-e19692&rft.artnum=e19692&rft.issn=2405-8440&rft.eissn=2405-8440&rft_id=info:doi/10.1016/j.heliyon.2023.e19692&rft_dat=%3Cproquest_doaj_%3E2874835418%3C/proquest_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c459t-705859fce6ce803394b80d94fb33a0db573f4c272758d2a5902c0773d4538d3e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2874835418&rft_id=info:pmid/&rfr_iscdi=true