ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.04303
  4. Cited By
A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm
  for the Bi-Objective Traveling Thief Problem
v1v2v3 (latest)

A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem

Journal of Heuristics (JH), 2020
11 February 2020
Jonatas B. C. Chagas
Julian Blank
Markus Wagner
M. Souza
Kalyanmoy Deb
ArXiv (abs)PDFHTML

Papers citing "A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem"

4 / 4 papers shown
Biased Random-Key Genetic Algorithms: A Review
Biased Random-Key Genetic Algorithms: A ReviewEuropean Journal of Operational Research (EJOR), 2023
Mariana A. Londe
Luciana S. Pessoa
Carlos E. Andrade
Mauricio G. C. Resende
208
52
0
01 Dec 2023
Generating Instances with Performance Differences for More Than Just Two
  Algorithms
Generating Instances with Performance Differences for More Than Just Two Algorithms
Jakob Bossek
Markus Wagner
229
5
0
29 Apr 2021
A weighted-sum method for solving the bi-objective traveling thief
  problem
A weighted-sum method for solving the bi-objective traveling thief problem
Jonatas B. C. Chagas
Markus Wagner
135
34
0
10 Nov 2020
The Dynamic Travelling Thief Problem: Benchmarks and Performance of
  Evolutionary Algorithms
The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary AlgorithmsInternational Conference on Neural Information Processing (ICONIP), 2020
Ragav Sachdeva
Frank Neumann
Markus Wagner
237
9
0
25 Apr 2020
1
Page 1 of 1