<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Iranian Institute of Industrial Engineering</PublisherName>
				<JournalTitle>Journal of Industrial and Systems Engineering</JournalTitle>
				<Issn>1735-8272</Issn>
				<Volume>3</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2010</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Optimal Allocation of Ships to Quay Length in Container Ports</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>275</FirstPage>
			<LastPage>290</LastPage>
			<ELocationID EIdType="pii">4016</ELocationID>
			
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>H.</FirstName>
					<LastName>Javanshir</LastName>
<Affiliation>Dep. of Industrial Engineering, Islamic Azad University, South Tehran Branch, Iran</Affiliation>

</Author>
<Author>
					<FirstName>S.R.</FirstName>
					<LastName>Seyed-Alizadeh Ganji</LastName>
<Affiliation>Dep. of Transportation Engineering, Islamic Azad University, Science and Research Branch, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2009</Year>
					<Month>02</Month>
					<Day>15</Day>
				</PubDate>
			</History>
		<Abstract>Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is finished. The paper’s target is to develop a new Continues Berth Allocation Problem (CBAP) in the form of a mixed integer nonlinear programming to achieve the best service time in a container terminal. For illustrating the accuracy of Proposed model (PM), Imai et. al. &#039;s model (IM) (TRANSPORT RES B, 39 (2005) 199–221) was applied and a wide variety of computational test examples were conducted. The results of demonstrated that the presented BAPC reduces the number of nonlinear variables (constraints) and generates substantial savings in the CPU time.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Optimal transportation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Continues Berth allocation Problem (CBAP)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">mixed integer
nonlinear programming</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://www.jise.ir/article_4016_f04cd7399b2b0128970efb6d20b5c551.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
