Service delivery management : multi-node path optimization

No Thumbnail Available

Date

2023

Journal Title

Journal ISSN

Volume Title

Publisher

Université M’hamed Bougara de Boumerdes : Institut de Genie Electrique et Electronique

Abstract

In an era marked by growing demands for efficie ntservi cedelive rya ndt heubiqui tyof advanced technologies, effectiv eservic emanagemen tha sbecom e apivota lconcer nfo rbusi- nesses across diverse sectors. The ability to optimize service routes not only drives customer satisfaction but also holds the promise of significan tcos tsavings .Thi sthesi sdelve sinto the heart of service delivery management, tackling the central challenge of Multi-node Path Optimization through the application and evaluation of two distinct yet complementary al- gorithms: the brute force algorithm and the heuristic algorithm. Rooted in the renowned Traveling Salesman Problem (TSP), this research endeavors to fin dth eshortes tpat hthat visits multiple destinations—a task of immense practical significance. The objectives of this study encompass a multifaceted exploration of these algorithms, en- compassing theoretical investigation, practical implementation, and comprehensive analysis. We aim to investigate the adaptability of both the brute force and heuristic algorithms to address Multi-node Path Optimization challenges, elucidate the computational intricacies associated with the TSP and its implications for service delivery management, craft a de- livery application using the versatile Flutter framework to provide a tangible manifestation of algorithmic efficienc y,a ndsubsequentl y,evalua tet hereal-wor ldperforman ce ofthe seal- gorithms in the realm of service delivery management. This research seeks to bridge the gap between theoretical optimization and practical application, offerin ginsight stha tcan empower businesses to make informed decisions in their pursuit of enhanced service delivery management. The finding so fthi sstud ypresen ta nopportunit yt orevolutioniz eservic edeliver yopera- tions across industries, offerin g apotentia lroa dma ptowar dincrease defficie ncy andcost- effectiveness .Throug h arigorou sexploratio no fMulti-nod ePat hOptimization ,thi sthesis contributes to the growing body of knowledge in the field ,offeri ngvaluab leperspectiv eson the intersection of theory and practice in service management.

Description

60 p.

Keywords

Traveling Salesman Problem (TSP), Multi-Node

Citation

Collections

Endorsement

Review

Supplemented By

Referenced By