{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:59:50Z","timestamp":1761490790461,"version":"3.41.2"},"reference-count":49,"publisher":"Emerald","issue":"5","license":[{"start":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T00:00:00Z","timestamp":1560124800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IMDS"],"published-print":{"date-parts":[[2019,6,10]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The purpose of this paper is to study the impacts of time segment modeling approach for berth allocation and quay crane (QC) assignment on container terminal operations efficiency.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>The authors model the small time segment modeling approach, based on minutes, which can be a minute, 15\u2009min, etc. Moreover, the authors divided the problem into three sub-problems and proposed a novel three-level genetic algorithm (3LGA) with QC shifting heuristics to deal with the problem. The objective function here is to minimize the total service time by using different time segments for comparison and analysis.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>First, the study shows that by reducing the time segment, the complexity of the problem increases dramatically. Traditional meta-heuristic, such as genetic algorithm, simulated annealing, etc., becomes not very promising. Second, the proposed 3LGA with QC shifting heuristics outperforms the traditional ones. In addition, by using a smaller time segment, the idling time of berth and QC can be reduced significantly. This greatly benefits the container terminal operations efficiency, and customer service level.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title>\n<jats:p>Nowadays, transshipment becomes the main business to many container terminals, especially in Southeast Asia (e.g. Hong Kong and Singapore). In these terminals, vessel arrivals are usually very frequent with small handling volume and very short staying time, e.g. 1.5\u2009h. Therefore, a traditional hourly based modeling approach may cause significant berth and QC idling, and consequently cannot meet their practical needs. In this connection, a small time segment modeling approach is requested by industrial practitioners.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>In the existing literature, berth allocation and QC assignment are usually in an hourly based approach. However, such modeling induces much idling time and consequently causes low utilization and poor service quality level. Therefore, a novel small time segment modeling approach is proposed with a novel optimization algorithm.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/imds-08-2018-0335","type":"journal-article","created":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T09:46:38Z","timestamp":1554889598000},"page":"968-992","source":"Crossref","is-referenced-by-count":4,"title":["The impacts of time segment modeling in berth allocation and quay crane assignment on terminal efficiency"],"prefix":"10.1108","volume":"119","author":[{"given":"Hoi-Lam","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengxu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.H.","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix T.S.","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"issue":"3","key":"key2020092308503151300_ref001","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","article-title":"A survey of berth allocation and quay crane scheduling problems in container terminals","volume":"202","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"key2020092308503151300_ref002","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","article-title":"Models for the discrete berth allocation problem: a computational comparison","volume":"47","year":"2011","journal-title":"Transportation Research Part E"},{"issue":"6","key":"key2020092308503151300_ref003","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.tre.2010.05.008","article-title":"Integrating berth allocation and quay crane assignments","volume":"46","year":"2010","journal-title":"Transportation Research Part E"},{"issue":"4","key":"key2020092308503151300_ref004","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1108\/IMDS-06-2015-0222","article-title":"Big data analytics with swarm intelligence","volume":"116","year":"2016","journal-title":"Industrial Management and Data Systems"},{"issue":"16","key":"key2020092308503151300_ref005","doi-asserted-by":"crossref","first-page":"4820","DOI":"10.1080\/00207543.2013.774489","article-title":"A workload balancing genetic algorithm for the quay crane scheduling problem","volume":"51","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"1","key":"key2020092308503151300_ref006","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TIE.2011.2130498","article-title":"A two-level genetic algorithm to determine production frequencies for economic lot scheduling problem","volume":"59","year":"2012","journal-title":"IEEE Transactions on Industrial Electronics"},{"issue":"8","key":"key2020092308503151300_ref007","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1108\/IMDS-04-2015-0155","article-title":"Managing disruption risk in express logistics via proactive planning","volume":"115","year":"2015","journal-title":"Industrial Management and Data Systems"},{"issue":"4","key":"key2020092308503151300_ref008","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1287\/trsc.1050.0120","article-title":"Models and tabu search heuristics for the berth-allocation problem","volume":"39","year":"2005","journal-title":"Transportation Science"},{"issue":"2","key":"key2020092308503151300_ref009","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1504\/EJIE.2009.023605","article-title":"Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms","volume":"3","year":"2009","journal-title":"European Journal of Industrial Engineering"},{"issue":"2","key":"key2020092308503151300_ref010","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.trb.2009.07.003","article-title":"Modeling and solving the tactical berth allocation problem","volume":"44","year":"2010","journal-title":"Transportation Research Part B"},{"issue":"4","key":"key2020092308503151300_ref011","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1057\/mel.2011.21","article-title":"A bi-objective berth allocation formulation to account for vessel handling time uncertainty","volume":"13","year":"2011","journal-title":"Journal of Maritime Economics and Logistics"},{"issue":"2","key":"key2020092308503151300_ref012","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1057\/mel.2011.4","article-title":"Berth scheduling with variable cost functions","volume":"13","year":"2011","journal-title":"Journal of Maritime Economics and Logistics"},{"issue":"1","key":"key2020092308503151300_ref013","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00291-003-0140-8","article-title":"The berth allocation problem: models and solution methods","volume":"26","year":"2004","journal-title":"OR Spectrum"},{"issue":"3","key":"key2020092308503151300_ref014","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","article-title":"Variable neighborhood search for minimum cost berth allocation","volume":"191","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"key2020092308503151300_ref015","first-page":"265","article-title":"The dynamic berth allocation problem for a container port","volume":"41","year":"2001","journal-title":"Transportation Research Part B"},{"issue":"5","key":"key2020092308503151300_ref016","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0191-2615(02)00023-1","article-title":"Berth allocation with service priority","volume":"37","year":"2003","journal-title":"Transportation Research Part B"},{"issue":"1","key":"key2020092308503151300_ref017","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.tre.2006.05.002","article-title":"Berthing ships at a multi-user container terminal with a limited quay capacity","volume":"44","year":"2008","journal-title":"Transportation Research Part E"},{"issue":"4","key":"key2020092308503151300_ref018","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1057\/palgrave.mel.9100186","article-title":"The berth allocation problem with service time and delay time objectives","volume":"9","year":"2007","journal-title":"Maritime Economics & Logistics"},{"issue":"2","key":"key2020092308503151300_ref019","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/j.tre.2011.09.004","article-title":"Terminal and yard allocation problem for a container transshipment hub with multiple terminals","volume":"48","year":"2012","journal-title":"Transportation Research Part E"},{"issue":"1","key":"key2020092308503151300_ref020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/EJIE.2014.059348","article-title":"A method for effective yard template design in container terminals","volume":"8","year":"2014","journal-title":"European Journal of Industrial Engineering"},{"issue":"10","key":"key2020092308503151300_ref021","doi-asserted-by":"crossref","first-page":"3143","DOI":"10.1080\/00207543.2012.760852","article-title":"Joint planning for yard storage space and home berths in container terminals","volume":"51","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"3","key":"key2020092308503151300_ref022","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10845-009-0304-8","article-title":"Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning","volume":"22","year":"2011","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"6","key":"key2020092308503151300_ref023","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1007\/s10845-011-0566-9","article-title":"A berth allocation planning problem with direct transshipment consideration","volume":"23","year":"2012","journal-title":"Journal of Intelligence Manufacturing"},{"issue":"3","key":"key2020092308503151300_ref024","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1016\/j.cie.2008.09.024","article-title":"A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning","volume":"56","year":"2009","journal-title":"Computer and Industrial Engineering"},{"issue":"8","key":"key2020092308503151300_ref025","doi-asserted-by":"crossref","first-page":"2253","DOI":"10.1080\/00207543.2012.718452","article-title":"Minimising earliness and tardiness by integrating production scheduling with shipping information","volume":"51","year":"2013","journal-title":"International Journal of Production Research"},{"key":"key2020092308503151300_ref026","first-page":"2076","article-title":"A fast approach for the integrated berth allocation and quay crane assignment problem","volume-title":"Proceedings of The IMechE Part B: Journal of Engineering Manufacture","year":"2014"},{"issue":"2","key":"key2020092308503151300_ref027","first-page":"273","article-title":"A GRASP-based metaheuristic for the berth allocation problem and the quay crane assignment problem by managing vessel cargo holds","volume":"40","year":"2013","journal-title":"Applied Intelligence"},{"first-page":"110","article-title":"A hybrid column generation approach for the berth allocation problem","year":"2008","key":"key2020092308503151300_ref028"},{"first-page":"105","article-title":"Integration of berth allocation and crane assignment to improve the resource utilization at a seaport container terminal","year":"2006","key":"key2020092308503151300_ref029"},{"issue":"1","key":"key2020092308503151300_ref030","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tre.2008.03.001","article-title":"Heuristics for the integration of crane productivity in the berth allocation problem","volume":"45","year":"2009","journal-title":"Transportation Research Part E"},{"issue":"2","key":"key2020092308503151300_ref031","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/trsc.1120.0419","article-title":"A framework for integrated berth allocation and crane operations planning in seaport container terminals","volume":"47","year":"2013","journal-title":"Transportation Science"},{"issue":"2","key":"key2020092308503151300_ref032","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(00)00128-4","article-title":"Berth allocation planning in the public berth system by genetic algorithms","volume":"131","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"key2020092308503151300_ref033","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-002-0109-z","article-title":"A scheduling method for berth and quay cranes","volume":"25","year":"2003","journal-title":"OR Spectrum"},{"key":"key2020092308503151300_ref034","unstructured":"Queensland Government (2014), \u201cVessel at berth\u201d, available at: www.qships.transport.qld.gov.au\/Public\/VesselsAtBerth.aspx (accessed May 15, 2014)."},{"issue":"11","key":"key2020092308503151300_ref035","first-page":"14136","article-title":"An enriched model for the integrated berth allocation and quay crane assignment problem","volume":"38","year":"2011","journal-title":"Expert Systems with Application"},{"issue":"1\/4","key":"key2020092308503151300_ref036","first-page":"377","article-title":"The berth scheduling problem with customer differentiation: a new methodological approach based on hierarchical optimization","volume":"46","year":"2010","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"key2020092308503151300_ref037","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","article-title":"Container terminal operation and operations research \u2013 a classification and literature review","volume":"26","year":"2004","journal-title":"OR Spectrum"},{"issue":"7","key":"key2020092308503151300_ref038","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1108\/02635571211255032","article-title":"Future of transshipment in Singapore","volume":"112","year":"2012","journal-title":"Industrial Management and Data Systems"},{"issue":"1","key":"key2020092308503151300_ref039","doi-asserted-by":"crossref","first-page":"22","DOI":"10.3141\/2100-03","article-title":"Container terminal berth planning: critical review of research approaches and practical challenges","volume":"2100","year":"2009","journal-title":"Transportation Research Record"},{"issue":"2","key":"key2020092308503151300_ref040","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/trsc.1120.0428","article-title":"An exact algorithm for the integrated planning of berth allocation and quay crane assignment","volume":"47","year":"2013","journal-title":"Transportation Science"},{"issue":"4","key":"key2020092308503151300_ref041","doi-asserted-by":"crossref","first-page":"2186","DOI":"10.1016\/j.dss.2006.06.008","article-title":"A stochastic beam search for the berth allocation problem","volume":"42","year":"2007","journal-title":"Decision Support Systems"},{"issue":"9","key":"key2020092308503151300_ref042","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.1108\/IMDS-07-2014-0215","article-title":"A decision support method for internal truck employment","volume":"114","year":"2014","journal-title":"Industrial Management and Data Systems"},{"issue":"1","key":"key2020092308503151300_ref043","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.cie.2012.03.004","article-title":"An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal","volume":"63","year":"2012","journal-title":"Computer & Industrial Engineering"},{"issue":"1","key":"key2020092308503151300_ref044","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cie.2009.08.002","article-title":"The allocation of berths and quay crane by using a sub-gradient optimization technique","volume":"58","year":"2010","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"key2020092308503151300_ref045","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/trsc.1100.0364","article-title":"An integrated model for berth template and yard template planning in transshipment hubs","volume":"45","year":"2011","journal-title":"Transportation Science"},{"issue":"1","key":"key2020092308503151300_ref046","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S1874-8651(09)60001-6","article-title":"Study on berth and quay-crane allocation under stochastic environments in container terminal","volume":"28","year":"2008","journal-title":"Systems Engineering-Theory & Practice"},{"first-page":"7297","article-title":"A dynamic berth allocation model based on stochastic consideration","year":"2006","key":"key2020092308503151300_ref047"},{"issue":"3","key":"key2020092308503151300_ref048","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1108\/IMDS-05-2015-0165","article-title":"Genetic algorithm based fuzzy time series tourism demand forecast model","volume":"116","year":"2016","journal-title":"Industrial Management and Data Systems"},{"key":"key2020092308503151300_ref049","unstructured":"UNCTAD (2012), \u201cReview of maritime transport\u201d, technical report, United Nations, New York, NY and Geneva."}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-08-2018-0335\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-08-2018-0335\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:53:03Z","timestamp":1753393983000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/119\/5\/968-992\/174611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,10]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,6,10]]}},"alternative-id":["10.1108\/IMDS-08-2018-0335"],"URL":"https:\/\/doi.org\/10.1108\/imds-08-2018-0335","relation":{},"ISSN":["0263-5577"],"issn-type":[{"type":"print","value":"0263-5577"}],"subject":[],"published":{"date-parts":[[2019,6,10]]}}}