Influence of shortest route approximation on relegating urban area’s transportation network priorities

Vehicle routing instances designed for a proficient distribution network strategizing at maximizing traversal coverage had been consistently investigated for resolving dominant logistics scheduling issues involving cost reduction characteristics aside from emulating optimal travel patterns for minim...

Full description

Bibliographic Details
Main Authors: Farid Morsidi, Haldi Budiman
Format: Article
Language:English
Published: Penerbit Universiti Kebangsaan Malaysia 2023
Online Access:http://journalarticle.ukm.my/23315/
http://journalarticle.ukm.my/23315/1/05%20-.pdf
_version_ 1848815813960663040
author Farid Morsidi,
Haldi Budiman,
author_facet Farid Morsidi,
Haldi Budiman,
author_sort Farid Morsidi,
building UKM Institutional Repository
collection Online Access
description Vehicle routing instances designed for a proficient distribution network strategizing at maximizing traversal coverage had been consistently investigated for resolving dominant logistics scheduling issues involving cost reduction characteristics aside from emulating optimal travel patterns for minimizing possible traveling ranges while maximizing resource allocations. The purpose of this research is to highlight the incorporation of shortest path routing heuristics for maximizing traversable nodes of a round trip distribution cycle, to stretch the qualities of sentient pathfinding capabilities from prominent intelligent graph traversal algorithm specimens to produce prudent output in terms of addressing cost optimality constraints. This greedy pathfinding algorithm is regarded as proactive for application in several known neighboring routing characteristics, including customer clustering aspects in vehicle routing and location-allocation instances for optimal resource allocation.
first_indexed 2025-11-15T00:55:57Z
format Article
id oai:generic.eprints.org:23315
institution Universiti Kebangasaan Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T00:55:57Z
publishDate 2023
publisher Penerbit Universiti Kebangsaan Malaysia
recordtype eprints
repository_type Digital Repository
spelling oai:generic.eprints.org:233152024-04-03T01:03:17Z http://journalarticle.ukm.my/23315/ Influence of shortest route approximation on relegating urban area’s transportation network priorities Farid Morsidi, Haldi Budiman, Vehicle routing instances designed for a proficient distribution network strategizing at maximizing traversal coverage had been consistently investigated for resolving dominant logistics scheduling issues involving cost reduction characteristics aside from emulating optimal travel patterns for minimizing possible traveling ranges while maximizing resource allocations. The purpose of this research is to highlight the incorporation of shortest path routing heuristics for maximizing traversable nodes of a round trip distribution cycle, to stretch the qualities of sentient pathfinding capabilities from prominent intelligent graph traversal algorithm specimens to produce prudent output in terms of addressing cost optimality constraints. This greedy pathfinding algorithm is regarded as proactive for application in several known neighboring routing characteristics, including customer clustering aspects in vehicle routing and location-allocation instances for optimal resource allocation. Penerbit Universiti Kebangsaan Malaysia 2023-12-01 Article PeerReviewed application/pdf en http://journalarticle.ukm.my/23315/1/05%20-.pdf Farid Morsidi, and Haldi Budiman, (2023) Influence of shortest route approximation on relegating urban area’s transportation network priorities. Asia-Pacific Journal of Information Technology and Multimedia, 12 (2). pp. 240-257. ISSN 2289-2192 https://www.ukm.my/apjitm
spellingShingle Farid Morsidi,
Haldi Budiman,
Influence of shortest route approximation on relegating urban area’s transportation network priorities
title Influence of shortest route approximation on relegating urban area’s transportation network priorities
title_full Influence of shortest route approximation on relegating urban area’s transportation network priorities
title_fullStr Influence of shortest route approximation on relegating urban area’s transportation network priorities
title_full_unstemmed Influence of shortest route approximation on relegating urban area’s transportation network priorities
title_short Influence of shortest route approximation on relegating urban area’s transportation network priorities
title_sort influence of shortest route approximation on relegating urban area’s transportation network priorities
url http://journalarticle.ukm.my/23315/
http://journalarticle.ukm.my/23315/
http://journalarticle.ukm.my/23315/1/05%20-.pdf