Close
Metadata

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16d.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP7W/3DKL892
Repositorysid.inpe.br/mtc-m19/2013/02.26.13.57   (restricted access)
Last Update2013:02.26.14.01.19 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m19/2013/02.26.13.57.32
Metadata Last Update2018:06.05.04.13.59 (UTC) administrator
ISSN0302-9743
Citation KeyOliveiraMaurLore:2012:ClSeHe
TitleClustering search heuristic for solving a continuous Berth Allocation Problem
ProjectCNPq (processes 300692/2009-9, 300747/2010-1, 477148/2011-5)
Year2012
Access Date2024, Apr. 19
Secondary TypePRE PI
Number of Files1
Size457 KiB
2. Context
Author1 Oliveira, Rudinei Martins de
2 Mauri, Geraldo Regis
3 Lorena, Luiz Antonio Nogueira
Resume Identifier1
2
3 8JMKD3MGP5W/3C9JHMQ
Group1
2
3 LAC-CTE-INPE-MCTI-GOV-BR
Affiliation1
2 Federal University of Espírito Santo - UFES
3 Instituto Nacional de Pesquisas Espaciais (INPE)
Author e-Mail Address1 rudmart@gmail.com
2 mauri@cca.ufes.br
3 lorena@lac.inpe.br
e-Mail Addressmarcelo.pazos@inpe.br
JournalLecture Notes in Computer Science
Volume7245
Pages49-62
Secondary MarkC_ADMINISTRAÇÃO,_CIÊNCIAS_CONTÁBEIS_E_TURISMO C_ASTRONOMIA_/_FÍSICA C_BIOTECNOLOGIA B5_CIÊNCIAS_BIOLÓGICAS_I C_CIÊNCIAS_BIOLÓGICAS_III B1_CIÊNCIAS_SOCIAIS_APLICADAS_I B3_DIREITO C_EDUCAÇÃO C_ENGENHARIAS_I B3_ENGENHARIAS_II C_ENGENHARIAS_III B4_ENSINO_DE_CIÊNCIAS_E_MATEMATICA B5_GEOCIÊNCIAS B2_INTERDISCIPLINAR B5_MATEMÁTICA_/_PROBABILIDADE_E_ESTATÍSTICA B3_MEDICINA_I B3_MEDICINA_II B3_PSICOLOGIA
History (UTC)2013-02-26 13:57:32 :: marcelo.pazos@sid.inpe.br -> administrator ::
2013-02-26 13:57:33 :: administrator -> marcelo.pazos@sid.inpe.br :: 2012
2013-02-26 14:01:20 :: marcelo.pazos@sid.inpe.br -> administrator :: 2012
2018-06-05 04:13:59 :: administrator -> marcelo.pazos@inpe.br :: 2012
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
Keywordscontinuous Berth Allocation Problem
clustering search
simulated annealing
metaheuristics
AbstractDue to the increasing demand for ships carrying containers, the Berth Allocation Problem (BAP) can be considered as a major optimization problem in marine terminals. In this context, we propose a heuristic to solve a continuous case of the BAP. This heuristic is based on the application of the Clustering Search (CS) method with the Simulated Annealing (SA) metaheuristic. The results obtained by CS are compared to other methods found in the literature and its competitiveness is verified.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Clustering search heuristic...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 26/02/2013 10:57 1.0 KiB 
4. Conditions of access and use
Target File72450049-1.pdf
User Groupmarcelo.pazos@inpe.br
Visibilityshown
Archiving Policydenypublisher denyfinaldraft12
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Mirror Repositoryiconet.com.br/banon/2006/11.26.21.31
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES; COMPENDEX.
Host Collectionsid.inpe.br/mtc-m19@80/2009/08.21.17.02
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel doi format isbn label language lineage mark month nextedition notes number orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate secondarykey session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url
7. Description control
e-Mail (login)marcelo.pazos@inpe.br
update 


Close