This paper investigates a meta-heuristic (MH) for the Pareto-optimal dissimilar path problem (DPP) (PDPP) whose solution is a set composed of at least two different paths. The objective vector of a PDPP includes some conflicting objectives: on the one hand, the average path measures such as the length and risk of paths in a solution must be kept low and, on the other hand, the dissimilarity among these paths should be kept high. The dissimilarity of the DPP is a measure of a paths set with cardinality no less than two. However, just one path can be extracted from a chromosome in the existing MHs for various path problems. This results in a great difficulty to evaluate the chromosome in the existing MHs when we apply them to solve DPP and, consequently, there exists no MH for solving the DPP so far. In this paper, a new decoding approach of a chromosome is first explored and, with this approach, a set of paths can be extracted from a chromosome. By combining the simulated annealing (SA), in which the new decoding approach is adopted, with the well-known greedy randomized adaptive search procedure (GRASP), a SA-based GRASP for the PDPP is proposed. The proposed algorithm is compared against a most recent heuristic, whose performance is better than all of the early approaches, for the PDPP and the experimental results show that the proposed algorithm is able to quickly create superior approximation of the efficient set of the PDPP than the existing solution approaches for the PDPP.
Network Evolutionary algorithm (EA) Shortest path problem (SPP) Dissimilar path problem (DPP) Probability and risk
This is a preview of subscription content, log in to check access.
This research is supported by National Natural Science Foundation of China (Nos. 71361018, 61563029).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
Ahn CW, Ramakrishna R (2002) A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput 6:566–579CrossRefGoogle Scholar
Baker JE (1985) Adaptive selection methods for genetic algorithm. In: Proceedings of 1st international conference on genetic algorithms. Lawrence Erlbaum Associates Inc, Hillsdale, NJ, pp 101–111Google Scholar
Batta R, Chiu SS (1988) Optimal obnoxious paths on a network: transportation of hazardous materials. Oper Res 36:84–92CrossRefGoogle Scholar
Bianchi L, Dorigo M, Gambardella LM, Gutjahr WJ (2009) A survey on metaheuristics for stochastic combinatorial optimization. Nat Comput Int J 8(2):239–287MathSciNetCrossRefMATHGoogle Scholar
Carotenuto P, Giordani S, Ricciardelli S (2007) Finding minimum and equitable risk routes for hazmat shipments. Comput Oper Res 34:1304–1327CrossRefMATHGoogle Scholar
Fonseca C, Fleming PJ (1993) Genetic algorithm for multiobjective optimization: formulation, discussion and generalization. In: Forrest S (ed) Proceedings of 5th international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 17–22Google Scholar
Fonseca C, Fleming PJ (1996) An overview of evolutionary algorithms in multiobjective optimzation. Evol Comput 3:1–16CrossRefGoogle Scholar
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New YorkMATHGoogle Scholar
Gen M, Cheng R (2000) Genetic algorithms & engineering optimization. Wiley, New YorkGoogle Scholar
Ghosh JB (1996) Computational aspects of the maximum diversity problem. Oper Res Lett 19:175–181Google Scholar
Goldberg D (1989) Genetic algorithm in search. Optimization and machine learning. Addison-Wesley, MAMATHGoogle Scholar