A Metaheuristic Approach for Parcel Delivery System Optimization: A Case Study in Bangladesh

Dhaka is among the most densely populated cities in Bangladesh. People frequently engage in Internet ordering as a means to circumvent the chaotic flow of vehicles and conserve valuable time. Furthermore, as online commerce grows, delivery businesses must manage substantial volumes of packages to various client destinations. Operating a parcel distribution system efficiently is becoming increasingly challenging. Delivering merchandise to many destinations in a single trip while considering the fastest route and minimum cost is a challenging task. Delivery firms are constantly seeking the most efficient methods to reduce both cost and time. We classify the delivery hurdle as an NP-hard issue, indicating its difficulty to solve in polynomial time using non-deterministic algorithms. Our study aims to identify the most efficient route and minimize expenses for a real-life case study located in Dhaka, Bangladesh. In this study, we conducted a comparison between two metaheuristic techniques, specifically Ant-Colony Optimization (ACO) and Genetic Algorithm (GA).

Authors

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/iccit64611.2024.11021903
Primary Topic
Smart Parking Systems Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Metaheuristic Approach for Parcel Delivery System Optimization: A Case Study in Bangladesh

Md. Manzurul Hasan, Md. Ariful Islam, Amit Roy Chowdhury
Smart Parking Systems Research
article

A Metaheuristic Approach for Parcel Delivery System Optimization: A Case Study in Bangladesh

Md. Manzurul Hasan, Md. Ariful Islam, Amit Roy Chowdhury
article en

Abstract

Dhaka is among the most densely populated cities in Bangladesh. People frequently engage in Internet ordering as a means to circumvent the chaotic flow of vehicles and conserve valuable time. Furthermore, as online commerce grows, delivery businesses must manage substantial volumes of packages to various client destinations. Operating a parcel distribution system efficiently is becoming increasingly challenging. Delivering merchandise to many destinations in a single trip while considering the fastest route and minimum cost is a challenging task. Delivery firms are constantly seeking the most efficient methods to reduce both cost and time. We classify the delivery hurdle as an NP-hard issue, indicating its difficulty to solve in polynomial time using non-deterministic algorithms. Our study aims to identify the most efficient route and minimize expenses for a real-life case study located in Dhaka, Bangladesh. In this study, we conducted a comparison between two metaheuristic techniques, specifically Ant-Colony Optimization (ACO) and Genetic Algorithm (GA).

Openalex Percentile: Top 69%
Smart Parking Systems Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Metaheuristic Approach for Parcel Delivery System Optimization: A Case Study in Bangladesh — Md. Manzurul Hasan, Md. Ariful Islam, et al. · (2024) | TGRS Research Map | TGRS