Improving Robustness of Solutions to Arc Routing Problem
Identifieur interne : 006133 ( Main/Merge ); précédent : 006132; suivant : 006134Improving Robustness of Solutions to Arc Routing Problem
Auteurs : Gérard Fleury ; Philippe Lacomme ; Christian Prins ; Wahiba Ramdane-CherifSource :
- Journal of the Operational Research Society ; 2005.
English descriptors
- KwdEn :
Abstract
This paper considers the stochastic capacitated arc routing problem (SCARP), obtained by taking random demands in the CARP. For real-world problems, it is important to create solutions that are insensitive to changes in demand, because these quantities are not deterministic but randomly distributed. This paper provides the basic concept of a new technique to compute such solutions, based upon the best method published for CARP : a hybrid genetic algorithm (HGA). The simulation analysis was achieved with the well-known DeArmon's, Eglese's and Belenguer's instances. This intensive evaluation process was carried out with 1000 replications providing high-quality statistical data. The results obtained prove that there is a great interest to optimize not only the solution cost but also the robustness of solutions. This work is a step forward to treat more realistic problems including industrial goals and constraints linked to demand variations.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 004145
- to stream Crin, to step Curation: 004145
- to stream Crin, to step Checkpoint: 000358
Links to Exploration step
CRIN:fleury03aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="315">Improving Robustness of Solutions to Arc Routing Problem</title></titleStmt><publicationStmt><idno type="RBID">CRIN:fleury03a</idno><date when="2005" year="2005">2005</date><idno type="wicri:Area/Crin/Corpus">004145</idno><idno type="wicri:Area/Crin/Curation">004145</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">004145</idno><idno type="wicri:Area/Crin/Checkpoint">000358</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000358</idno><idno type="wicri:Area/Main/Merge">006133</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Improving Robustness of Solutions to Arc Routing Problem</title><author><name sortKey="Fleury, Gerard" sort="Fleury, Gerard" uniqKey="Fleury G" first="Gérard" last="Fleury">Gérard Fleury</name></author><author><name sortKey="Lacomme, Philippe" sort="Lacomme, Philippe" uniqKey="Lacomme P" first="Philippe" last="Lacomme">Philippe Lacomme</name></author><author><name sortKey="Prins, Christian" sort="Prins, Christian" uniqKey="Prins C" first="Christian" last="Prins">Christian Prins</name></author><author><name sortKey="Ramdane Cherif, Wahiba" sort="Ramdane Cherif, Wahiba" uniqKey="Ramdane Cherif W" first="Wahiba" last="Ramdane-Cherif">Wahiba Ramdane-Cherif</name></author></analytic><series><title level="j">Journal of the Operational Research Society</title><imprint><date when="2005" type="published">2005</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>genetic algorithms</term><term>optimisation</term><term>robustness</term><term>sensitivity analysis</term><term>stochastic capacitated arc routing problem</term><term>vehicle routeing</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2767">This paper considers the stochastic capacitated arc routing problem (SCARP), obtained by taking random demands in the CARP. For real-world problems, it is important to create solutions that are insensitive to changes in demand, because these quantities are not deterministic but randomly distributed. This paper provides the basic concept of a new technique to compute such solutions, based upon the best method published for CARP : a hybrid genetic algorithm (HGA). The simulation analysis was achieved with the well-known DeArmon's, Eglese's and Belenguer's instances. This intensive evaluation process was carried out with 1000 replications providing high-quality statistical data. The results obtained prove that there is a great interest to optimize not only the solution cost but also the robustness of solutions. This work is a step forward to treat more realistic problems including industrial goals and constraints linked to demand variations.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006133 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006133 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:fleury03a
|texte= Improving Robustness of Solutions to Arc Routing Problem
}}
| This area was generated with Dilib version V0.6.33. |  |