Bounds for the general capacitated routing problem
Identifieur interne : 001201 ( Istex/Curation ); précédent : 001200; suivant : 001202Bounds for the general capacitated routing problem
Auteurs : Klaus Jansen [Allemagne]Source :
- Networks [ 0028-3045 ] ; 1993-05.
Abstract
This paper presents heuristics that are based on a tour splitting of a general routing tour for solving the general capacitated routing problem (GCRP). This problem is a generalization of the vehicle routing problem (VRP) and the capacitated arc routing problem (CARP). For the VRP, heuristics that consist of an optimum partitioning of a TSP tour generated by Christofides are known and have a worst‐case error of 7/2 − 3/q for even q, where q is the capacity of the vehicles. If we apply a partitioning to an optimum TSP tour, the worst‐case error becomes 3 − 2/q for even q. We generalize these results to the GCRP and give also some lower bounds. © 1993 John Wiley & Sons, Inc.
Url:
DOI: 10.1002/net.3230230304
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001313
Links to Exploration step
ISTEX:15A27AD1C2646DF7E344E5B4AF0726271FB40879Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Bounds for the general capacitated routing problem</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><mods:affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W‐5500 Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W‐5500 Trier</wicri:regionArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:15A27AD1C2646DF7E344E5B4AF0726271FB40879</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1002/net.3230230304</idno><idno type="url">https://api.istex.fr/document/15A27AD1C2646DF7E344E5B4AF0726271FB40879/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001313</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001313</idno><idno type="wicri:Area/Istex/Curation">001201</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Bounds for the general capacitated routing problem</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><mods:affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W‐5500 Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W‐5500 Trier</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="j">Networks</title><title level="j" type="abbrev">Networks</title><idno type="ISSN">0028-3045</idno><idno type="eISSN">1097-0037</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>New York</pubPlace><date type="published" when="1993-05">1993-05</date><biblScope unit="volume">23</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="165">165</biblScope><biblScope unit="page" to="173">173</biblScope></imprint><idno type="ISSN">0028-3045</idno></series><idno type="istex">15A27AD1C2646DF7E344E5B4AF0726271FB40879</idno><idno type="DOI">10.1002/net.3230230304</idno><idno type="ArticleID">NET3230230304</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0028-3045</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This paper presents heuristics that are based on a tour splitting of a general routing tour for solving the general capacitated routing problem (GCRP). This problem is a generalization of the vehicle routing problem (VRP) and the capacitated arc routing problem (CARP). For the VRP, heuristics that consist of an optimum partitioning of a TSP tour generated by Christofides are known and have a worst‐case error of 7/2 − 3/q for even q, where q is the capacity of the vehicles. If we apply a partitioning to an optimum TSP tour, the worst‐case error becomes 3 − 2/q for even q. We generalize these results to the GCRP and give also some lower bounds. © 1993 John Wiley & Sons, Inc.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001201 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001201 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:15A27AD1C2646DF7E344E5B4AF0726271FB40879
|texte= Bounds for the general capacitated routing problem
}}
| This area was generated with Dilib version V0.6.31. |  |