About: Berth allocation problem

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Berth allocation problem Goto Sponge NotDistinct Permalink

An Entity of Type : yago:State100024720, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FBerth_allocation_problem&invfp=IFP_OFF&sas=SAME_AS_OFF

The berth allocation problem (also known as the berth scheduling problem) is a NP-complete problem in operations research, regarding the allocation of berth space for vessels in container terminals. Vessels arrive over time and the terminal operator needs to assign them to berths in order to be served (loading and unloading containers) as soon as possible. Different factors affect the berth and time assignment of each vessel. Among models found in the literature, there are four most frequently observed cases: Some of the most notable objectives addressed in the literature are:

Attributes	Values
rdf:type	yago:WikicatNP-completeProblems yago:Abstraction100002137 yago:Attribute100024264 yago:Condition113920835 yago:Difficulty114408086 yago:Problem114410605 disease yago:State100024720
rdfs:label	Berth allocation problem (en)
rdfs:comment	The berth allocation problem (also known as the berth scheduling problem) is a NP-complete problem in operations research, regarding the allocation of berth space for vessels in container terminals. Vessels arrive over time and the terminal operator needs to assign them to berths in order to be served (loading and unloading containers) as soon as possible. Different factors affect the berth and time assignment of each vessel. Among models found in the literature, there are four most frequently observed cases: Some of the most notable objectives addressed in the literature are: (en)
dcterms:subject	Mathematical optimization in business
Wikipage page ID	31672906 (xsd:integer)
Wikipage revision ID	1098931335 (xsd:integer)
Link from a Wikipage to another Wikipage	Mathematical optimization in business NP-complete Container port Container port design process List of NP-complete problems Econometric Institute Operations research Marine vessel
Link from a Wikipage to an external page	http://www.mysmu.edu/faculty/hclau/doc/ASIAN99-Ant%20Colony%20Ship%20Berthing.pdf https://at-web1.comp.glam.ac.uk/ASMTA2005/Proc/pdf/lt-06.pdf https://web.itu.edu.tr/~keceli/container/genel.pdf http://orbit.dtu.dk/files/121760131/Integrated_Berth_Allocation.pdf https://apps.dtic.mil/dtic/tr/fulltext/u2/a487311.pdf https://onlinelibrary.wiley.com/doi/pdf/10.1002/atr.5670260105 https://onlinelibrary.wiley.com/doi/pdf/10.1002/atr.5670310107 https://www.tandfonline.com/doi/abs/10.1057/jors.1978.162 https://www.tandfonline.com/doi/abs/10.1057/palgrave.jors.2601412 http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.454.3874&rep=rep1&type=pdf http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.464.1819&rep=rep1&type=pdf http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.467.6390&rep=rep1&type=pdf http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.471.9196&rep=rep1&type=pdf http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.477.193&rep=rep1&type=pdf http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.567.4439&rep=rep1&type=pdf http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.670.8408&rep=rep1&type=pdf http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.83.3944&rep=rep1&type=pdf http://www.lib.kobe-u.ac.jp/repository/90000070.pdf https://people.orie.cornell.edu/jdai/publications/daiLinMoorthyTeo08.pdf https://infoscience.epfl.ch/record/196075/files/NitBierVac12.pdf https://cedb.asce.org/CEDBsearch/record.jsp%3Fdockey=0014889 http://www.academia.edu/download/30306546/9100186a.pdf http://www.academia.edu/download/34213868/Nishimura__Imai__Papadimitriou.pdf http://www.academia.edu/download/40638286/Variable_neighborhood_search_for_minimum20151204-31035-12mgh13.pdf https://ieeexplore.ieee.org/abstract/document/1714503/ https://ieeexplore.ieee.org/abstract/document/4150240/ https://journals.sagepub.com/doi/abs/10.3141/2166-03 https://journals.sagepub.com/doi/abs/10.3141/2168-01 https://link.springer.com/article/10.1023/A:1026487022192 https://link.springer.com/article/10.1057/mel.2011.21 https://link.springer.com/article/10.1057/mel.2011.4 https://link.springer.com/chapter/10.1007/3-540-26686-0_7 https://link.springer.com/content/pdf/10.1007/978-3-7908-2191-8.pdf https://researchportal.port.ac.uk/portal/files/4749532/Tamer_WCCI_2016_preprint_.pdf https://web.archive.org/web/20190222223632/http:/pdfs.semanticscholar.org/3b6e/489e029ae7587b2eb7278abe015370509fdf.pdf https://web.archive.org/web/20190302012024/http:/pdfs.semanticscholar.org/9480/07c287a1b16067aa6e87671391fc60f1ef74.pdf https://web.archive.org/web/20190309151223/http:/pdfs.semanticscholar.org/fb50/3efb7d89cf03837b6be877f85bb000168e6e.pdf https://www.academia.edu/download/48265165/Container_Terminal_Berth_Planning20160823-6990-ax6n8m.pdf https://www.researchgate.net/profile/Ahmed_Karam3/publication/283909904_A_New_Method_for_Allocating_BerthsQuay_Cranes_and_Internal_Trucks_in_Container_Terminals/links/564a05ec08ae295f644fa40e/A-New-Method-for-Allocating-Berths-Quay-Cranes-and-Internal-Trucks-in-Container-Terminals.pdf https://www.researchgate.net/profile/Georgios_Saharidis/publication/225726870_The_berth_scheduling_problem_with_customer_differentiation_A_new_methodological_approach_based_on_hierarchical_optimization/links/0912f511127b361cb7000000/The-berth-scheduling-problem-with-customer-differentiation-A-new-methodological-approach-based-on-hierarchical-optimization.pdf https://www.researchgate.net/profile/Nam_Kyu_Park/publication/233548170_Ship-berth_link_performance_evaluation_Simulation_and_analytical_approaches/links/5660d32608aebae678aa3f54/Ship-berth-link-performance-evaluation-Simulation-and-analytical-approaches.pdf https://www.researchgate.net/profile/Stefan_Voss/publication/225323734_Operations_research_at_container_terminals_A_literature_update/links/55bb895a08ae9289a0956e78.pdf https://www.researchgate.net/profile/Stefan_Voss/publication/225493172_Container_terminal_operation_and_operations_research_-_A_classification_and_literature_review/links/02bfe50d597b0d9016000000/Container-terminal-operation-and-operations-research-A-classification-and-literature-review.pdf https://www.sciencedirect.com/science/article/pii/S0167637798000108 https://www.sciencedirect.com/science/article/pii/S016792360600090X https://www.sciencedirect.com/science/article/pii/S0191261502000279 https://www.sciencedirect.com/science/article/pii/S0305054806002991 https://www.sciencedirect.com/science/article/pii/S0377221700002009 https://www.sciencedirect.com/science/article/pii/S0377221705008489 https://www.sciencedirect.com/science/article/pii/S1366554508000768 https://pubsonline.informs.org/doi/abs/10.1287/trsc.1060.0171
sameAs	Berth allocation problem Berth allocation problem Berth allocation problem Berth allocation problem
dbp:wikiPageUsesTemplate	dbt:By_whom dbt:Cbignore dbt:Cite_book dbt:Cite_journal dbt:Cn dbt:Dead_link dbt:ISBN
bot	medic (en)
date	July 2022 (en)
has abstract	The berth allocation problem (also known as the berth scheduling problem) is a NP-complete problem in operations research, regarding the allocation of berth space for vessels in container terminals. Vessels arrive over time and the terminal operator needs to assign them to berths in order to be served (loading and unloading containers) as soon as possible. Different factors affect the berth and time assignment of each vessel. Among models found in the literature, there are four most frequently observed cases: 1. * discrete vs. continuous berthing space, 2. * static vs. dynamic vessel arrivals, 3. * static vs. dynamic vessel handling times, and 4. * variable vessel arrivals. In the discrete problem, the quay is viewed as a finite set of berths. In the continuous problem, vessels can berth anywhere along the quay and the majority of research deals with the former case. In the static arrival problem all vessels are already at the port whereas in the dynamic only a portion of the vessels to be scheduled are present. The majority of the published research in berth scheduling considers the latter case. In the static handling time problem, vessel handling times are considered as input, whereas in the dynamic they are decision variables. Finally, in the last case, the vessel arrival times are considered as variables and are optimized. Technical restrictions such as berthing draft and inter-vessel and end-berth clearance distance are further assumptions that have been adopted in some of the studies dealing with the berth allocation problem, bringing the problem formulation closer to real world conditions. Introducing technical restrictions to existing berth allocation models is rather straightforward and it may increase the complexity of the problem but simplify the use of metaheuristics (decrease in the feasible space). Some of the most notable objectives addressed in the literature are: 1. * Minimization of vessel total service times (waiting and handling times), 2. * Minimization of early and delayed departures, 3. * Optimization of vessel arrival times, 4. * Optimization of emissions and fuel consumption. Problems have been formulated as single and multi-objective as well as single and bi-level. (en)
gold:hypernym	Problem
prov:wasDerivedFrom	wikipedia-en:Berth_allocation_problem?oldid=1098931335&ns=0
page length (characters) of wiki page	19592 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Berth_allocation_problem
is Link from a Wikipage to another Wikipage of	List of NP-complete problems
is foaf:primaryTopic of	wikipedia-en:Berth_allocation_problem

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software