{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:31:08Z","timestamp":1776889868886,"version":"3.51.2"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0377-2217(00)00128-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:54:50Z","timestamp":1027630490000},"page":"282-292","source":"Crossref","is-referenced-by-count":256,"title":["Berth allocation planning in the public berth system by genetic algorithms"],"prefix":"10.1016","volume":"131","author":[{"given":"Etsuko","family":"Nishimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akio","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stratos","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00128-4_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO;2-L","article-title":"Optimizing ship berthing","volume":"41","author":"Brown","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(00)00128-4_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1002\/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO;2-A","article-title":"Optimizing submarine berthing with a persistence incentive","volume":"44","author":"Brown","year":"1997","journal-title":"Navel Research Logistics"},{"key":"10.1016\/S0377-2217(00)00128-4_BIB3","unstructured":"W.T. Chan, A. Imai, The berth allocation problem: heuristic method using genetic algorithms, in: Proceedings of the First JSPS-NUS Seminar on Integrated Engineering, 1996, pp. 109\u2013114"},{"key":"10.1016\/S0377-2217(00)00128-4_BIB4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/atr.5670310107","article-title":"Efficient planning of berth allocation for container terminals in Asia","volume":"31","author":"Imai","year":"1997","journal-title":"Journal of Advanced Transportation"},{"key":"10.1016\/S0377-2217(00)00128-4_BIB5","doi-asserted-by":"crossref","unstructured":"A. Imai, E. Nishimura, S. Papadimitriou, The dynamic berth allocation problem for a container port, Transportation Research Part B, in press","DOI":"10.1016\/S0191-2615(99)00057-0"},{"key":"10.1016\/S0377-2217(00)00128-4_BIB6","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/0305-0548(95)00079-8","article-title":"Simulated annealing and genetic algorithms for scheduling products with multi-level product structure","volume":"23","author":"Kim","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(00)00128-4_BIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/atr.5670260105","article-title":"A study of container berth allocation","volume":"26","author":"Lai","year":"1992","journal-title":"Journal of Advanced Transportation"},{"key":"10.1016\/S0377-2217(00)00128-4_BIB8","unstructured":"M. Pinedo, Scheduling Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001284?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001284?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T23:56:52Z","timestamp":1555804612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700001284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0377221700001284"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00128-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}