{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:55Z","timestamp":1720640815598},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1016\/j.endm.2018.03.024","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T11:23:53Z","timestamp":1523532233000},"page":"183-190","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["A novel List-Constrained Randomized VND approach in GPU for the Traveling Thief Problem"],"prefix":"10.1016","volume":"66","author":[{"given":"Rodolfo Pereira","family":"Araujo","sequence":"first","affiliation":[]},{"given":"Eyder","family":"Rios","sequence":"additional","affiliation":[]},{"given":"Igor Machado","family":"Coelho","sequence":"additional","affiliation":[]},{"given":"Leandro A.J.","family":"Marzulo","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Clicia Castro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2018.03.024_br0010","first-page":"955","article-title":"Genetic algorithm and local search for just-in-time job shop scheduling","author":"Araujo","year":"2009","journal-title":"Congress on Evolutionary Computation"},{"key":"10.1016\/j.endm.2018.03.024_br0020","first-page":"1037","article-title":"The travelling thief problem: The first step in the transition from theoretical problems to realistic problems","author":"Bonyadi","year":"2013","journal-title":"IEEE Congress on Evolutionary Computation"},{"key":"10.1016\/j.endm.2018.03.024_br0030","article-title":"Evolutionary computation for multicomponent problems: opportunities and future directions","author":"Bonyadi","year":"2016","journal-title":"Neural and Evolutionary Computing"},{"key":"10.1016\/j.endm.2018.03.024_br0040","series-title":"Variable Neighborhood Search","first-page":"77","author":"Caporossi","year":"2016"},{"key":"10.1016\/j.endm.2018.03.024_br0050","first-page":"393","article-title":"Solution of a large-scale traveling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Operations Research"},{"key":"10.1016\/j.endm.2018.03.024_br0060","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.endm.2018.03.024_br0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2013.07.107","article-title":"Survey of green vehicle routing problem: Past and future trends","volume":"41","author":"Lin","year":"2014","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.endm.2018.03.024_br0080","series-title":"Congress on Evolutionary Computation","article-title":"Heuristic evolution with genetic programming for traveling thief problem","author":"Mei","year":"2015"},{"key":"10.1016\/j.endm.2018.03.024_br0090","article-title":"Uma heurstica busca tabu para o problema do mochileiro viajante","author":"Oliveira","year":"2015","journal-title":"Brazilian SBPO"},{"key":"10.1016\/j.endm.2018.03.024_br0100","series-title":"Algorithms for Knapsack Problems","author":"Pisinger","year":"1995"},{"key":"10.1016\/j.endm.2018.03.024_br0110","series-title":"Genetic and Evolutionary Computation Conference (GECCO)","article-title":"A comprehensive benchmark set and heuristics for the travelling thief problem","author":"Polyakovskiy","year":"2013"},{"key":"10.1016\/j.endm.2018.03.024_br0120","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.jpdc.2017.06.011","article-title":"Exploring parallel multi-gpu local search strategies in a metaheuristic framework","volume":"111","author":"Rios","year":"2018","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/j.endm.2018.03.024_br0130","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1016\/j.ejor.2010.05.031","article-title":"A hybrid heuristic algorithm for the open-pit-mining operational planning problem","volume":"207","author":"Souza","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.endm.2018.03.024_br0140","doi-asserted-by":"crossref","DOI":"10.1007\/s10732-017-9328-y","article-title":"A case study of algorithm selection for the traveling thief problem","author":"Wagner","year":"2017","journal-title":"Journal of Heuristics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300702?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300702?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T10:24:11Z","timestamp":1534933451000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065318300702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":14,"alternative-id":["S1571065318300702"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.024","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A novel List-Constrained Randomized VND approach in GPU for the Traveling Thief Problem","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.024","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}