首页 | 本学科首页   官方微博 | 高级检索  
     


A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem
Authors:Chagas  Jonatas B. C.  Blank  Julian  Wagner  Markus  Souza  Marcone J. F.  Deb  Kalyanmoy
Affiliation:1.Departamento de Computa??o, Universidade Federal de Ouro Preto, Ouro Prêto, Brazil
;2.Departamento de Informàtica, Universidade Federal de Vi?osa, Vi?osa, Brazil
;3.Michigan State University, East Lansing, MI, USA
;4.School of Computer Science, The University of Adelaide, Adelaide, Australia
;
Abstract:
Journal of Heuristics - In this paper, we propose a method to solve a bi-objective variant of the well-studied traveling thief problem (TTP). The TTP is a multi-component problem that combines two...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号