Close
Metadata

1. Identity statement
Reference TypeConference Abstract (Conference Proceedings)
Sitemtc-m16d.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP7W/3EFTLF8
Repositorysid.inpe.br/mtc-m19/2013/07.19.18.01
Last Update2013:07.19.19.37.19 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m19/2013/07.19.18.01.23
Metadata Last Update2018:06.05.04.14.38 (UTC) administrator
Labelself-archiving-INPE-MCTI-GOV-BR
Citation KeyMauriRibeLoreLapo:2013:AdLaNe
TitleAn adaptive large neighborhood search heuristic for the berth allocation problem
Year2013
Access Date2024, Apr. 19
Secondary TypePRE CI
Number of Files1
Size97 KiB
2. Context
Author1 Mauri, Geraldo Regis
2 Ribeiro, Glaydston Mattos
3 Lorena, Luis Antonio Nogueira
4 Laporte, Gilbert
Group1
2
3 LAC-CTE-INPE-MCTI-GOV-BR
Affiliation1 Federal University of Espírito Santo – UFES
2 Federal University of Espírito Santo – UFES
3 Instituto Nacional de Pesquisas Espaciais (INPE)
4 CIRRELT and HEC Montréal
Author e-Mail Address1 mauri@cca.ufes.br
2 glaydstonribeiro@ceunes.ufes.br
3 lorena@lac.inpe.br
4 gilbert.laporte@cirrelt.ca
e-Mail Addresslarissa.moreira@inpe.br
Conference NameEuro/informs- European Conference On Operational Research, 26.
Conference LocationRoma, Itália
DateJuly 1-4, 2013
Book TitleAbstracts
History (UTC)2013-07-19 18:01:23 :: larissa.moreira@inpe.br -> administrator ::
2018-06-05 04:14:38 :: administrator -> marcelo.pazos@inpe.br :: 2013
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
KeywordsPort Operations
Metaheuristics
Combinatorial Optimization
AbstractThe Berth Allocation Problem (BAP) consists of assigning ships to berthing areas along a quay in a port. The choice of where and when the ships shall moor is the main decision to be made in this problem. In this paper, the ships are represented as rectangles to be placed into a space x time area avoiding overlaps and satisfying time window constraints. To solve the BAP, an Adaptive Large Neighborhood Search heuristic (ALNS) is proposed for the discrete and continuous cases which provides good solutions, outperforming recent methods found in the literature.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > An adaptive large...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 19/07/2013 15:01 1.0 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGP7W/3EFTLF8
zipped data URLhttp://urlib.net/zip/8JMKD3MGP7W/3EFTLF8
Languageen
Target FileBAP_EURO2013_Mauri et al.pdf
User Grouplarissa.moreira@inpe.br
marcelo.pazos@inpe.br
Reader Groupadministrator
marcelo.pazos@inpe.br
Visibilityshown
Read Permissionallow from all
Update Permissionnot transferred
5. Allied materials
Mirror Repositoryiconet.com.br/banon/2006/11.26.21.31
Next Higher Units8JMKD3MGPCW/3ESGTTP
Host Collectionsid.inpe.br/mtc-m19@80/2009/08.21.17.02
6. Notes
Empty Fieldsarchivingpolicy archivist callnumber copyholder copyright creatorhistory descriptionlevel dissemination doi edition editor format isbn issn lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project publisher publisheraddress resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark serieseditor session shorttitle sponsor subject tertiarymark tertiarytype type url volume
7. Description control
e-Mail (login)marcelo.pazos@inpe.br
update 


Close