{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:30:17Z","timestamp":1730205017488,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/cec48606.2020.9185829","type":"proceedings-article","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T23:34:48Z","timestamp":1599176088000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic programming operators for the bi-objective Traveling Thief Problem"],"prefix":"10.1109","author":[{"given":"Roberto","family":"Santana","sequence":"first","affiliation":[]},{"given":"Siddhartha","family":"Shakya","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Knapsack problems: Algorithms and Computer Implementations","author":"martello","year":"1990","journal-title":"John Wiley & Sons Ltd"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7257230"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13563-2_53"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1487-2"},{"key":"ref14","article-title":"A fully polynomial time approximation scheme for packing while traveling","volume":"abs 1702 5217","author":"neumann","year":"2017","journal-title":"CoRR"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598249"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969622"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9328-y"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205488"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/2908812.2908847","article-title":"Population-based vs. single-solution heuristics for the travelling thief problem","author":"el yafrani","year":"2016","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2016)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598367"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/2739480.2754716","article-title":"Approximate approaches to the traveling thief problem","author":"faulkner","year":"2015","journal-title":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.12.011"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30698-8_3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557681"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/978-3-319-54157-0_4","article-title":"Solving the bi-objective traveling thief problem with multi-objective evolutionary algorithms","author":"blank","year":"2017","journal-title":"International Conference on Evolutionary Multi-Criterion Optimization"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.3.414"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205537"},{"key":"ref21","first-page":"137","article-title":"Multiobjective decomposition-based Mallows models estimation of distribution algorithm","volume":"397","author":"zangari-de souza","year":"2017","journal-title":"A case of study for permutation flowshop scheduling problem Information Sciences"}],"event":{"name":"2020 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2020,7,19]]},"location":"Glasgow, United Kingdom","end":{"date-parts":[[2020,7,24]]}},"container-title":["2020 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9178820\/9185488\/09185829.pdf?arnumber=9185829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:48:26Z","timestamp":1656344906000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9185829\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/cec48606.2020.9185829","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}