Answers are grounded in this paper and cite their sources.
Automated Guided Vehicles (AGVs) operating in flexible manufacturing systems are exposed to uncertain travel conditions and random failures that significantly affect system performance. Traditional AGV routing methods often rely on additive cost models or deterministic reliability measures, which may fail to capture the probabilistic nature of failure events and the trade‐off between efficiency and survivability. This paper proposes a unified stochastic fractional routing algorithm for AGV networks in which arc failures are modelled as exponential random processes. Each arc traversal is associated with an expected travel time and an expected cumulative hazard representing failure risk. Path reliability is interpreted probabilistically through a survival function, leading to a fractional objective that minimises expected travel time per unit of expected hazard. Based on this formulation, a new labelling‐based algorithm is developed that incrementally constructs feasible paths, applies deterministic Pareto dominance on expectations rules to eliminate suboptimal partial routes and identifies the optimal solution without exhaustive enumeration. Computational experiments on randomly generated AGV networks demonstrate that the proposed algorithm consistently identifies the optimal fractional path whilst significantly reducing computational effort compared with complete Pareto enumeration and other benchmark approaches. Sensitivity analyses further illustrate the algorithm's robustness to variations in failure rates and network density. The results confirm that the proposed stochastic formulation provides a physically consistent and computationally efficient framework for reliability‐aware AGV routing in manufacturing environments.
No takes yet. Share an insight, caveat, or question.
Hamed Fazlollahtabar (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: