Heuristics for the bi-objective path dissimilarity problem

Computers and Operations Research

Volumn 36, Issue 11, 2009, Pages 2905-2912

  Martí, Rafael ^a   Luis González Velarde, José ^b   Duarte, Abraham ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^c UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

Bi objective programming; Metaheuristics; Routing

Indexed keywords

AVERAGE LENGTHS; BI-OBJECTIVE OPTIMIZATIONS; BI-OBJECTIVE PROGRAMMING; EFFICIENT FRONTIERS; EXISTING METHODS; GRASP PROCEDURES; METAHEURISTICS; MULTI-OBJECTIVE OPTIMIZATIONS; ROUTING;

MATERIALS HANDLING; MULTIOBJECTIVE OPTIMIZATION;

TRANSPORTATION ROUTES;

EID: 64549127330     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.01.003     Document Type: Article

References (20)

1. Zitzler E. Evolutionary algorithms for multiobjective optimization: methods and applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland; 1999.
2. Zitzler E., and Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3 4 (1999) 257-271
3. Clímaco J.C., and Martins E.Q.V. A bicriterion shortest path algorithm. European Journal of Operational Research 11 (1982) 399-404
4. Martins E.Q.V. On a multicriteria shortest path problem. European Journal of Operational Research 16 (1984) 236-245
5. Johnson PE, Joy DS, Clarke DB. HIGHWAY 3.01, an enhancement routing model: program, description, methodology and revised user's manual. Technical Report, Oak Ridge National Laboratories; 1992.
6. Lombard K., and Church R.L. The gateway shortest path problem: generation of alternative routes for a corridor location problem. Geographical Systems 1 (1993) 25-45
7. Kuby M., Zhongyi X., and Xiaodong X. A minimax method for finding the k best differentiated paths. Geographical Analysis 29 4 (1997) 298-313
8. Akgün V., Erkut E., and Batta R. On finding dissimilar paths. European Journal of Operational Research 121 (2000) 232-246
9. Duarte A., and Martí R. Tabu search and GRASP for the maximum diversity problem. European Journal of Operational Research 178 11 (2007) 71-84
10. Erkut E. The discrete p-dispersion problem. European Journal of Operational Research 46 (1990) 48-60
11. Dell'Olmo P., Gentili M., and Scozzari A. On finding dissimilar Pareto-optimal paths. European Journal of Operational Research 162 (2005) 70-82
12. Glover F., Kuo C.C., and Dhir K.S. Heuristic algorithms for the maximum diversity problem. Journal of Information and Optimization Sciences 19 1 (1998) 109-132
13. Thyagarajan K., Batta R., Karwan M.H., and Szczerba R.J. Planning dissimilar paths for military units. Military Operations Research 10 1 (2005) 25-42
14. Carotenuto P., Giordani S., and Ricciardelli S. Finding minimum and equitable risk routes for hazmat shipments. Computers & Operations Research 34 (2007) 1304-1327
15. Batta R., and Chiu S.S. Optimal obnoxious paths on a network: transportation of hazardous materials. Operations Research 36 (1988) 84-92
16. Feo T.A., and Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8 (1989) 67-71
17. Feo T.A., and Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
18. Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G. (Eds). State-of-the-art handbook in metaheuristics (2003), Kluwer Academic Publishers, Boston 219-250
19. Zitzler E, Laumanns M, Thiele L. SPEA2: improving the strength Pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland; 2001.
20. Silverman B.W. Density estimation for statistics and data analysis (1986), Chapman & Hall, London