Serveur d'exploration sur l'opéra

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

An algorithm for the optimal collection of wet waste.

Identifieur interne : 000049 ( PubMed/Corpus ); précédent : 000048; suivant : 000050

An algorithm for the optimal collection of wet waste.

Auteurs : Federica Laureri ; Riccardo Minciardi ; Michela Robba

Source :

RBID : pubmed:26454710

Abstract

This work refers to the development of an approach for planning wet waste (food waste and other) collection at a metropolitan scale. Some specific modeling features distinguish this specific waste collection problem from the other ones. For instance, there may be significant differences as regards the values of the parameters (such as weight and volume) characterizing the various collection points. As it happens for classical waste collection planning, even in the case of wet waste, one has to deal with difficult combinatorial problems, where the determination of an optimal solution may require a very large computational effort, in the case of problem instances having a noticeable dimensionality. For this reason, in this work, a heuristic procedure for the optimal planning of wet waste is developed and applied to problem instances drawn from a real case study. The performances that can be obtained by applying such a procedure are evaluated by a comparison with those obtainable via a general-purpose mathematical programming software package, as well as those obtained by applying very simple decision rules commonly used in practice. The considered case study consists in an area corresponding to the historical center of the Municipality of Genoa.

DOI: 10.1016/j.wasman.2015.09.020
PubMed: 26454710

Links to Exploration step

pubmed:26454710

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">An algorithm for the optimal collection of wet waste.</title>
<author>
<name sortKey="Laureri, Federica" sort="Laureri, Federica" uniqKey="Laureri F" first="Federica" last="Laureri">Federica Laureri</name>
<affiliation>
<nlm:affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy.</nlm:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Minciardi, Riccardo" sort="Minciardi, Riccardo" uniqKey="Minciardi R" first="Riccardo" last="Minciardi">Riccardo Minciardi</name>
<affiliation>
<nlm:affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy.</nlm:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Robba, Michela" sort="Robba, Michela" uniqKey="Robba M" first="Michela" last="Robba">Michela Robba</name>
<affiliation>
<nlm:affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy. Electronic address: Michela.robba@unige.it.</nlm:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">PubMed</idno>
<date when="2016">2016</date>
<idno type="RBID">pubmed:26454710</idno>
<idno type="pmid">26454710</idno>
<idno type="doi">10.1016/j.wasman.2015.09.020</idno>
<idno type="wicri:Area/PubMed/Corpus">000049</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">An algorithm for the optimal collection of wet waste.</title>
<author>
<name sortKey="Laureri, Federica" sort="Laureri, Federica" uniqKey="Laureri F" first="Federica" last="Laureri">Federica Laureri</name>
<affiliation>
<nlm:affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy.</nlm:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Minciardi, Riccardo" sort="Minciardi, Riccardo" uniqKey="Minciardi R" first="Riccardo" last="Minciardi">Riccardo Minciardi</name>
<affiliation>
<nlm:affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy.</nlm:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Robba, Michela" sort="Robba, Michela" uniqKey="Robba M" first="Michela" last="Robba">Michela Robba</name>
<affiliation>
<nlm:affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy. Electronic address: Michela.robba@unige.it.</nlm:affiliation>
</affiliation>
</author>
</analytic>
<series>
<title level="j">Waste management (New York, N.Y.)</title>
<idno type="e-ISSN">1879-2456</idno>
<imprint>
<date when="2016" type="published">2016</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">This work refers to the development of an approach for planning wet waste (food waste and other) collection at a metropolitan scale. Some specific modeling features distinguish this specific waste collection problem from the other ones. For instance, there may be significant differences as regards the values of the parameters (such as weight and volume) characterizing the various collection points. As it happens for classical waste collection planning, even in the case of wet waste, one has to deal with difficult combinatorial problems, where the determination of an optimal solution may require a very large computational effort, in the case of problem instances having a noticeable dimensionality. For this reason, in this work, a heuristic procedure for the optimal planning of wet waste is developed and applied to problem instances drawn from a real case study. The performances that can be obtained by applying such a procedure are evaluated by a comparison with those obtainable via a general-purpose mathematical programming software package, as well as those obtained by applying very simple decision rules commonly used in practice. The considered case study consists in an area corresponding to the historical center of the Municipality of Genoa.</div>
</front>
</TEI>
<pubmed>
<MedlineCitation Owner="NLM" Status="In-Data-Review">
<PMID Version="1">26454710</PMID>
<DateCreated>
<Year>2016</Year>
<Month>01</Month>
<Day>10</Day>
</DateCreated>
<Article PubModel="Print-Electronic">
<Journal>
<ISSN IssnType="Electronic">1879-2456</ISSN>
<JournalIssue CitedMedium="Internet">
<Volume>48</Volume>
<PubDate>
<Year>2016</Year>
<Month>Feb</Month>
</PubDate>
</JournalIssue>
<Title>Waste management (New York, N.Y.)</Title>
<ISOAbbreviation>Waste Manag</ISOAbbreviation>
</Journal>
<ArticleTitle>An algorithm for the optimal collection of wet waste.</ArticleTitle>
<Pagination>
<MedlinePgn>56-63</MedlinePgn>
</Pagination>
<ELocationID EIdType="doi" ValidYN="Y">10.1016/j.wasman.2015.09.020</ELocationID>
<ELocationID EIdType="pii" ValidYN="Y">S0956-053X(15)30129-X</ELocationID>
<Abstract>
<AbstractText>This work refers to the development of an approach for planning wet waste (food waste and other) collection at a metropolitan scale. Some specific modeling features distinguish this specific waste collection problem from the other ones. For instance, there may be significant differences as regards the values of the parameters (such as weight and volume) characterizing the various collection points. As it happens for classical waste collection planning, even in the case of wet waste, one has to deal with difficult combinatorial problems, where the determination of an optimal solution may require a very large computational effort, in the case of problem instances having a noticeable dimensionality. For this reason, in this work, a heuristic procedure for the optimal planning of wet waste is developed and applied to problem instances drawn from a real case study. The performances that can be obtained by applying such a procedure are evaluated by a comparison with those obtainable via a general-purpose mathematical programming software package, as well as those obtained by applying very simple decision rules commonly used in practice. The considered case study consists in an area corresponding to the historical center of the Municipality of Genoa.</AbstractText>
<CopyrightInformation>Copyright © 2015 Elsevier Ltd. All rights reserved.</CopyrightInformation>
</Abstract>
<AuthorList CompleteYN="Y">
<Author ValidYN="Y">
<LastName>Laureri</LastName>
<ForeName>Federica</ForeName>
<Initials>F</Initials>
<AffiliationInfo>
<Affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy.</Affiliation>
</AffiliationInfo>
</Author>
<Author ValidYN="Y">
<LastName>Minciardi</LastName>
<ForeName>Riccardo</ForeName>
<Initials>R</Initials>
<AffiliationInfo>
<Affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy.</Affiliation>
</AffiliationInfo>
</Author>
<Author ValidYN="Y">
<LastName>Robba</LastName>
<ForeName>Michela</ForeName>
<Initials>M</Initials>
<AffiliationInfo>
<Affiliation>Department of Informatics, Bioengineering, Robotics and Systems Engineering - DIBRIS, Via Opera Pia 13, I-16145 Genova, Italy. Electronic address: Michela.robba@unige.it.</Affiliation>
</AffiliationInfo>
</Author>
</AuthorList>
<Language>eng</Language>
<PublicationTypeList>
<PublicationType UI="D016428">Journal Article</PublicationType>
</PublicationTypeList>
<ArticleDate DateType="Electronic">
<Year>2015</Year>
<Month>10</Month>
<Day>09</Day>
</ArticleDate>
</Article>
<MedlineJournalInfo>
<Country>United States</Country>
<MedlineTA>Waste Manag</MedlineTA>
<NlmUniqueID>9884362</NlmUniqueID>
<ISSNLinking>0956-053X</ISSNLinking>
</MedlineJournalInfo>
<CitationSubset>IM</CitationSubset>
<KeywordList Owner="NOTNLM">
<Keyword MajorTopicYN="N">Optimization</Keyword>
<Keyword MajorTopicYN="N">Recycling</Keyword>
<Keyword MajorTopicYN="N">Selective collection</Keyword>
<Keyword MajorTopicYN="N">Solid waste collection</Keyword>
<Keyword MajorTopicYN="N">Waste management</Keyword>
<Keyword MajorTopicYN="N">Wet waste</Keyword>
</KeywordList>
</MedlineCitation>
<PubmedData>
<History>
<PubMedPubDate PubStatus="received">
<Year>2015</Year>
<Month>7</Month>
<Day>1</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="revised">
<Year>2015</Year>
<Month>9</Month>
<Day>1</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="accepted">
<Year>2015</Year>
<Month>9</Month>
<Day>15</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="aheadofprint">
<Year>2015</Year>
<Month>10</Month>
<Day>9</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="entrez">
<Year>2015</Year>
<Month>10</Month>
<Day>12</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
<PubMedPubDate PubStatus="pubmed">
<Year>2015</Year>
<Month>10</Month>
<Day>12</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
<PubMedPubDate PubStatus="medline">
<Year>2015</Year>
<Month>10</Month>
<Day>12</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
</History>
<PublicationStatus>ppublish</PublicationStatus>
<ArticleIdList>
<ArticleId IdType="pubmed">26454710</ArticleId>
<ArticleId IdType="pii">S0956-053X(15)30129-X</ArticleId>
<ArticleId IdType="doi">10.1016/j.wasman.2015.09.020</ArticleId>
</ArticleIdList>
</PubmedData>
</pubmed>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/PubMed/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000049 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PubMed/Corpus/biblio.hfd -nk 000049 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    OperaV1
   |flux=    PubMed
   |étape=   Corpus
   |type=    RBID
   |clé=     pubmed:26454710
   |texte=   An algorithm for the optimal collection of wet waste.
}}

Pour générer des pages wiki

HfdIndexSelect -h $EXPLOR_AREA/Data/PubMed/Corpus/RBID.i   -Sk "pubmed:26454710" \
       | HfdSelect -Kh $EXPLOR_AREA/Data/PubMed/Corpus/biblio.hfd   \
       | NlmPubMed2Wicri -a OperaV1 

Wicri

This area was generated with Dilib version V0.6.21.
Data generation: Thu Apr 14 14:59:05 2016. Site generation: Thu Jan 4 23:09:23 2024