A Software Solution for Package Delivery Optimization in Courier Business Using an Elliptic Intuitionistic Fuzzy Knapsack Problem
摘要
The goal of the NP-hard combinatorial optimization problem known as the “Knapsack problem” (KP) is to decide what items to place in the knapsack in order to maximize its total value while staying within its carrying capacity. The uncertainty in the environment is not taken into consideration by traditional approaches of handling this problem. Elliptic Intuitionistic Fuzzy Set (E-IFS), developed by Atanassov in 2021, is a model for the increased level of environmental uncertainty. In our earlier work [37], we expand the standard dynamic optimization method by presenting an index-matrix approach to a knapsack-based portfolio selection model (E-IFKP) with parameters that are defined by elliptic intuitionistic fuzzy values. Here, we create a software solution and algorithm, related to an E-IFKP to maximize package delivery in the Bulgarian company for courier services. Experts recommend the priority and duration of request fulfillment, and the suggested method takes their rating coefficients into consideration. Using the algorithm’s efficiency, a team of couriers servicing a certain area can maximize the number of requests they can complete in a day by considering the urgency and time of each request. The decision-maker is presented with three options from which to select.