| dc.description.abstract | The surge in e-commerce has brought about a rise in logistical challenges for shipping
companies engaged with these digital marketplaces. This research aims to maximize
profit for the company by optimizing the assignment of delivery routes, with a keen
focus on weight and timing restrictions, especially considering that orders can be
reassigned within a two-day window. This adjustment makes the classic Vehicle
Routing Problem (VRP) more aligned with the practical realities of order reassignments.
Utilizing data from an actual firm offers genuine insights into these challenges. By
employing mathematical model such as Mixed Integer Linear Programming (MILP)
alongside metaheuristic methods like Genetic Algorithms and Tabu Search, the study
seeks to effectively manage larger operations. The research underscores how the boom
in online shopping has escalated logistical expenses for supermarket chains and how the
demand for swift deliveries complicates the coordination of order preparation and
dispatch. It proposes a systematic method for distributing online orders, factoring in the
available resources and costs, to enhance the decision-making process. The ultimate
objective is to deliver superior service while lowering the overall costs associated with
e-commerce fulfillment, moving from reliance on anecdotal evidence to an analytical
approach. | en_US |
