Impact Factor
7.883
Call For Paper
Volume 12 Issue 07
July 2026
Author(s)
Ayesha Misbah Dr. Aishwarya P
Abstract
This Paper Proposes A Heuristic Algorithm Based On Dijkstra And Divide-and-Conquer Algorithm. Firstly, The Sub-problem Blocks Are Constructed. Existing Methods To Solve This Problem, Such As Genetic Algorithm Or Simulated Annealing Algorithm, Require Long
Keywords
Warehouse Location; Dijkstra; Divide-and Conquer Algorithms; Heuristic Algorithm.
Paper ID
IJSARTV5I532562
Publication Date
May 25, 2019
Research Area
Computer Science Engineering