{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T04:45:36Z","timestamp":1768797936554,"version":"3.49.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004144","name":"Liverpool John Moores University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000287","name":"Royal Academy of Engineering","doi-asserted-by":"publisher","award":["NRCP1617-6-125"],"award-info":[{"award-number":["NRCP1617-6-125"]}],"id":[{"id":"10.13039\/501100000287","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Rail Safety and Standards Board","award":["COF-INP-05"],"award-info":[{"award-number":["COF-INP-05"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2948322","type":"journal-article","created":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T20:00:07Z","timestamp":1571428807000},"page":"152358-152367","source":"Crossref","is-referenced-by-count":4,"title":["The Offline Group Seat Reservation Knapsack Problem With Profit on Seats"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1955-4380","authenticated-orcid":false,"given":"Igor","family":"Deplano","sequence":"first","affiliation":[{"name":"Department of Maritime and Mechanical Engineering, Liverpool Logistics, Offshore and Marine Research Institute, Liverpool John Moores University, Liverpool, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danial","family":"Yazdani","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen Key Laboratory of Computational Intelligence, University Key Laboratory of Evolving Intelligent Systems of Guangdong Province, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3268-1790","authenticated-orcid":false,"given":"Trung Thanh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Department of Maritime and Mechanical Engineering, Liverpool John Moores University, Liverpool, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.08.005"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.3.573"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/BICTA.2010.5645211"},{"key":"ref30","year":"2016"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0337-0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.03.014"},{"key":"ref10","first-page":"43","article-title":"Neural, genetic, and neurogenetic approaches for solving the 0–1 multidimensional knapsack problem","volume":"17","author":"deane","year":"2013","journal-title":"Int J Inf Syst Manage"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0369"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90002-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"ref14","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9143-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2013.04.019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9282-1"},{"key":"ref18","article-title":"Essays on the online multiple knapsack problem & the online reservation problem","author":"goyal","year":"2018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCNT.2017.8204118"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.07.006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9162-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009286"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.06.037"},{"key":"ref29","article-title":"London termini luggage and group travel survey","author":"focus","year":"2016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.1.30"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.063"},{"key":"ref7","article-title":"A greedy adaptive search procedure for multi-dimensional multi-container packing problems","author":"crainic","year":"2012"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1985.51"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.03.016"},{"key":"ref20","first-page":"26","article-title":"Complexity versus choice: UK rail fares","volume":"37","author":"hatano","year":"2004","journal-title":"Jpn Railway Transp Rev"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90019-L"},{"key":"ref21","first-page":"1016","article-title":"Heuristic algorithm for constrained 3D container loading problem: A genetic approach","volume":"3","author":"jegadeshwari","year":"2014","journal-title":"International Journal of Computing Algorithm"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CASE.2011.6042476"},{"key":"ref23","author":"martello","year":"1990","journal-title":"Knapsack Problems Algorithms and Computer Implementations"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-6530-4"},{"key":"ref25","year":"2015","journal-title":"Intercity West Coast Overview and Vision"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08876634.pdf?arnumber=8876634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:02:54Z","timestamp":1662667374000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8876634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2948322","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}