ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 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

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

11 February 2020
Jonatas B. C. Chagas
Julian Blank
Markus Wagner
M. Souza
Kalyanmoy Deb
ArXivPDFHTML

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

4 / 4 papers shown
Title
Biased Random-Key Genetic Algorithms: A Review
Biased Random-Key Genetic Algorithms: A Review
Mariana A. Londe
Luciana S. Pessoa
Carlos E. Andrade
Mauricio G. C. Resende
14
13
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
14
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
13
28
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 Algorithms
Ragav Sachdeva
Frank Neumann
Markus Wagner
16
8
0
25 Apr 2020
1