论文信息 - A Hybrid Genetic Algorithm for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem

A Hybrid Genetic Algorithm for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem

We consider a HAZMAT transportation problem, which is modeled as the length-balanced two arc-disjoint shortest paths problem (LB2SP). In LB2SP, we try to find two arc-disjoint paths on a given network. We hope to reach two objectives: a minimized sum of the path lengths, and a minimized length difference between the paths. These two objectives are independent and even conflicting. Therefore, the objective function of LB2SP is expressed as a weighted sum of two terms: sum of the path lengths and the length difference between the paths. LB2SP is known to be NP-Hard, and can be formulated as an Integer Programming (IP) model. We propose a genetic algorithm (GA) and hybridize a quick Lagrangian relaxation-based heuristic (LRBH) as a module with the proposed GA. Computational experiments are conducted to compare the performance of the hybrid GA with the CPLEX solver, showing that the GA with hybridization of LRBH is efficient for LB2SP. Areas: heuristic search, industrial application of AI, genetic algorithms.

Andrew Lim | Hong Ma | Yanzhi Li

[1] Masaharu Munetomo,et al. A migration scheme for the genetic adaptive routing algorithm , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[2] Andrew Lim,et al. A Lagrangian Relaxation Based Heuristic for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem , 2005, Australian Conference on Artificial Intelligence.

[3] Shichao Zhang,et al. AI 2005: Advances in Artificial Intelligence, 18th Australian Joint Conference on Artificial Intelligence, Sydney, Australia, December 5-9, 2005, Proceedings , 2005, Australian Conference on Artificial Intelligence.

[4] Zbigniew Michalewicz,et al. Evolutionary Computation 2 , 2000 .

[5] Yee Leung,et al. A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[6] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[7] Chang Wook Ahn,et al. A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[8] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .