The Bi-Objective k-Dissimilar Vehicle Routing Problem
This paper deals with the k-dissimilar vehicle routing problem in which a set of k dissimilar alternatives for a Capacitated Vehicle Routing Problem (CVRP) has to be determined for a single instance. The tradeoff between minimizing the longest routing alternative and maximizing the minimum dissimilarity between two routing alternatives is investigated. Since short vehicle routings tend to be similar to each other, a conflict of objectives arises. The developed heuristic approach approximates the Pareto set with respect to this tradeoff using a dissimilarity metric based on a grid. The method is tested on benchmark instances of the CVRP and findings are reported.
KeywordsBi-objective k-dissimilar vehicle routing problem Pareto set approximation
- 2.Bock, F.: An algorithm for solving ‘Traveling Salesman’ and related network optimization problems. Technical report, 14th National Meeting of the Operations Research Society of America (ORSA), St Louis (1958)Google Scholar
- 9.Johnson, P., Joy, D., Clarke, D.: HIGHWAY 3.01, an enhancement routing model: program, description, methodology and revised user’s manual. Technical report, Oak Ridge National Laboratories, Washington, D.C. (1992)Google Scholar
- 12.Lombard, K., Church, R.L.: The gateway shortest path problem: generating alternative routes for a corridor location problem. Geogr. Syst. 1, 25–45 (1993)Google Scholar