Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm Bossek, Jakob Grimme, Christian Meisel, Stephan Rudolph, Günter Trautmann, Heike Deb, Kalyanmoy Goodman, Erik Coello Coello, Carlos A. Klamroth, Kathrin Miettinen, Kaisa Mostaghim, Sanaz Reed, Patrick Combinatorial optimization Dynamic optimization Metaheuristics Multi-objective optimization Vehicle routing We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. The goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies. Springer International Publishing 2019 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://ris.uni-paderborn.de/record/48841 Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In: Deb K, Goodman E, Coello Coello CA, et al., eds. <i>Evolutionary Multi-Criterion Optimization (EMO)</i>. Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528. doi:<a href="https://doi.org/10.1007/978-3-030-12598-1_41">10.1007/978-3-030-12598-1_41</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-030-12598-1_41 info:eu-repo/semantics/altIdentifier/isbn/978-3-030-12598-1 info:eu-repo/semantics/closedAccess