Metaheuristics for the bi-objective orienteering problem |
| |
Authors: | Michael Schilde Karl F Doerner Richard F Hartl Guenter Kiechle |
| |
Institution: | (1) Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria;(2) Salzburg Research Forschungsgesellschaft m.b.H., Mobile and Web-based Information Systems, Jakob-Haringer-Strasse 5/3, 5020 Salzburg, Austria |
| |
Abstract: | In this paper, heuristic solution techniques for the multi-objective orienteering problem are developed. The motivation stems
from the problem of planning individual tourist routes in a city. Each point of interest in a city provides different benefits
for different categories (e.g., culture, shopping). Each tourist has different preferences for the different categories when
selecting and visiting the points of interests (e.g., museums, churches). Hence, a multi-objective decision situation arises.
To determine all the Pareto optimal solutions, two metaheuristic search techniques are developed and applied. We use the Pareto
ant colony optimization algorithm and extend the design of the variable neighborhood search method to the multi-objective
case. Both methods are hybridized with path relinking procedures. The performances of the two algorithms are tested on several
benchmark instances as well as on real world instances from different Austrian regions and the cities of Vienna and Padua.
The computational results show that both implemented methods are well performing algorithms to solve the multi-objective orienteering
problem. |
| |
Keywords: | Ant colony optimization Variable neighborhood search Multiobjective optimization Orienteering problem |
本文献已被 SpringerLink 等数据库收录! |
|