RUcore: Rutgers University Community Repository
The discrete and continuous berth allocation problem: models and algorithms
Descriptive
TitleInfo
(displayLabel = Citation Title);
(type = uniform)
Title
The discrete and continuous berth allocation problem: models and algorithms
Name
(ID = NAME001);
(type = personal)
NamePart
(type = family)
Gkolias
NamePart
(type = given)
Michail D.
DisplayForm
Michail D. Gkolias
Role
RoleTerm
(authority = RUETD)
author
Name
(ID = NAME002);
(type = personal)
NamePart
(type = family)
Boile
NamePart
(type = given)
Maria
Affiliation
Advisory Committee
DisplayForm
Maria Boile
Role
RoleTerm
(authority = RULIB)
chair
Name
(ID = NAME003);
(type = personal)
NamePart
(type = family)
Maher
NamePart
(type = given)
Ali
Affiliation
Advisory Committee
DisplayForm
Ali Maher
Role
RoleTerm
(authority = RULIB)
internal member
Name
(ID = NAME004);
(type = personal)
NamePart
(type = family)
Williams
NamePart
(type = given)
Trefor
Affiliation
Advisory Committee
DisplayForm
Trefor P Williams
Role
RoleTerm
(authority = RULIB)
internal member
Name
(ID = NAME005);
(type = personal)
NamePart
(type = family)
Coit
NamePart
(type = given)
David
Affiliation
Advisory Committee
DisplayForm
David W Coit
Role
RoleTerm
(authority = RULIB)
outside member
Name
(ID = NAME006);
(type = corporate)
NamePart
Rutgers University
Role
RoleTerm
(authority = RULIB)
degree grantor
Name
(ID = NAME007);
(type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm
(authority = RULIB)
school
TypeOfResource
Text
Genre
(authority = marcgt)
theses
OriginInfo
DateCreated
(qualifier = exact)
2007
DateOther
(qualifier = exact);
(type = degree)
2007
Language
LanguageTerm
English
PhysicalDescription
Form
(authority = marcform)
electronic
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
xvi, 203 pages
Abstract
Fierce terminal competition and the need to maximize recourses utilization have led marine terminal operators to the development and application of a rich variety of Berth Scheduling Policies (BSPs). Container terminal operators seek for efficient BSPs that will reduce vessels turnaround time, increase port throughput, lead to higher revenues and increased competitiveness of the port, while at the same time keep customer satisfaction at desired levels. Several issues arise when defining the best BSPs for each port operator and the final decision depends on several factors that include the type and function of the port (dedicated or multi-user terminal, transshipment hub etc), the size and location of the port, nearby competition, type of contractual agreement with the vessel carriers etc. Some of these BSPs and issues have to a certain extend been captured by academic research, but still several attributes need to be investigated and included for these models to represent the state of the practice of container terminal operations.
In this dissertation we present new models and solution algorithms that portray different BSPs and attempt to capture the operational environment of a container terminal, while at the same time including attributes of the system that current models lack. The formulations and solutions of mathematical models presented herein, seek to optimally schedule vessels and/or quay cranes to berths in multi-user type of container terminals, without losing its applicability to the private type container terminals. The objective is to present models and algorithms that capture as much as possible of current container terminal operator practices, while minimizing the assumptions made about real world conditions that container terminals operate in.
In this dissertation we present new models and solution algorithms that portray different BSPs and attempt to capture the operational environment of a container terminal, while at the same time including attributes of the system that current models lack. The formulations and solutions of mathematical models presented herein, seek to optimally schedule vessels and/or quay cranes to berths in multi-user type of container terminals, without losing its applicability to the private type container terminals. The objective is to present models and algorithms that capture as much as possible of current container terminal operator practices, while minimizing the assumptions made about real world conditions that container terminals operate in.
Note
(type = degree)
Ph.D.
Note
(type = bibliography)
Includes bibliographical references (p. 194-200).
Subject
(ID = SUBJ1);
(authority = RUETD)
Topic
Civil and Environmental Engineering
Subject
(ID = SUBJ2);
(authority = ETD-LCSH)
Topic
Container terminals--Mathematical models
Subject
(ID = SUBJ3);
(authority = ETD-LCSH)
Topic
Marine terminals--Mathematical models
Subject
(ID = SUBJ4);
(authority = ETD-LCSH)
Topic
Scheduling--Mathematical models
Subject
(ID = SUBJ5);
(authority = ETD-LCSH)
Topic
Cargo handling--Mathematical models
Subject
(ID = SUBJ6);
(authority = ETD-LCSH)
Topic
Mooring of ships--Mathematical models
RelatedItem
(type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier
(type = local)
rucore19991600001
Identifier
(type = hdl)
http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16067
Identifier
ETD_547
Location
PhysicalLocation
(authority = marcorg);
(displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier
(type = doi)
doi:10.7282/T3DB828Q
Genre
(authority = ExL-Esploro)
ETD doctoral
Back to the top
Rights
RightsDeclaration
(AUTHORITY = GS);
(ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
AssociatedEntity
(AUTHORITY = rulib);
(ID = 1)
Name
Michail Gkolias
Role
Copyright holder
Affiliation
Rutgers University. Graduate School - New Brunswick
RightsEvent
(AUTHORITY = rulib);
(ID = 1)
Type
Permission or license
Detail
Non-exclusive ETD license
AssociatedObject
(AUTHORITY = rulib);
(ID = 1)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top
Technical
Format
(TYPE = mime);
(VERSION = )
application/x-tar
FileSize
(UNIT = bytes)
3296768
Checksum
(METHOD = SHA1)
59cf34c07eb51866dfd78b52337485868e3716a8
ContentModel
ETD
CompressionScheme
other
OperatingSystem
(VERSION = 5.1)
windows xp
Format
(TYPE = mime);
(VERSION = NULL)
application/x-tar
Back to the top
Statistical Profile