Local search effects in bi-objective orienteering-Reference-Cited by-同舟云学术

Local search effects in bi-objective orienteering

Published:2018-07-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference
language:
Short-container-title:

Author:

Bossek Jakob¹,Grimme Christian¹,Meisel Stephan¹,Rudolph Günter²,Trautmann Heike¹

Affiliation:

1. University of Münster, Germany

2. TU Dortmund Univ., Germany

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3205455.3205548

Reference23 articles.

1. An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits

2. Jakob Bossek. 2015. netgen: Network Generator for Combinatorial Graph Problems. https://github.com/jakobbossek/netgen R package version 1.0. Jakob Bossek. 2015. netgen: Network Generator for Combinatorial Graph Problems. https://github.com/jakobbossek/netgen R package version 1.0.

3. A fast and elitist multiobjective genetic algorithm: NSGA-II

4. Traveling Salesman Problems with Profits

5. Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning to Simultaneously Converge and Diversify Better: UIP Operator;Genetic and Evolutionary Computation;2024

2. Solution-Based Knowledge Discovery for Multi-objective Optimization;Lecture Notes in Computer Science;2024

3. Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art;European Journal of Operational Research;2022-01

4. Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization;IEEE Transactions on Evolutionary Computation;2022

5. Dynamic bi-objective routing of multiple vehicles;Proceedings of the 2020 Genetic and Evolutionary Computation Conference;2020-06-25