Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems
Identifieur interne : 000002 ( Hal/Corpus ); précédent : 000001; suivant : 000003Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems
Auteurs : Jalel EuchiSource :
Descripteurs français
English descriptors
- mix :
Abstract
This thesis investigates an optimization problem concerning the distributionmanagement in the supply chain. It addresses the Vehicle Routing Problems (VRP)with Heterogeneous Limited Fleet, through the development of resolution strategies withheuristics methods. Taking into account capacity constraints and the limited number ofheterogeneous fleet of vehicles available, we studied three variants of vehicle routing problems:the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP), the VehicleRouting Problem with Private fleet and common Carrier (VRPPC) and the Dynamic VehicleRouting Problem (DVRP). We have applied Tabu search algorithms, evolutionaryalgorithms and ant colony algorithm to provide effective solutions to these problems.
Url:
Links to Exploration step
Hal:tel-01273816Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en"> Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems</title><title xml:lang="fr">Approches métaheuristiques pour résoudre quelques variantes de problème de tournées de véhicules avec flotte limitée </title><author><name sortKey="Euchi, Jalel" sort="Euchi, Jalel" uniqKey="Euchi J" first="Jalel" last="Euchi">Jalel Euchi</name><affiliation><hal:affiliation type="laboratory" xml:id="struct-36444" status="INCOMING"><orgName>Laboratoire de Mathématiques Appliqué du Havre</orgName><orgName type="acronym">LMAH</orgName><desc><address><country key="FR"></country></address><ref type="url">http://awal.univ-lehavre.fr/</ref></desc><listRelation><relation name="EA3821" active="#struct-441569" type="direct"></relation></listRelation><tutelles><tutelle name="EA3821" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:tel-01273816</idno><idno type="halId">tel-01273816</idno><idno type="halUri">https://tel.archives-ouvertes.fr/tel-01273816</idno><idno type="url">https://tel.archives-ouvertes.fr/tel-01273816</idno><date when="2011-05-30">2011-05-30</date><idno type="wicri:Area/Hal/Corpus">000002</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en"> Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems</title><title xml:lang="fr">Approches métaheuristiques pour résoudre quelques variantes de problème de tournées de véhicules avec flotte limitée </title><author><name sortKey="Euchi, Jalel" sort="Euchi, Jalel" uniqKey="Euchi J" first="Jalel" last="Euchi">Jalel Euchi</name><affiliation><hal:affiliation type="laboratory" xml:id="struct-36444" status="INCOMING"><orgName>Laboratoire de Mathématiques Appliqué du Havre</orgName><orgName type="acronym">LMAH</orgName><desc><address><country key="FR"></country></address><ref type="url">http://awal.univ-lehavre.fr/</ref></desc><listRelation><relation name="EA3821" active="#struct-441569" type="direct"></relation></listRelation><tutelles><tutelle name="EA3821" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Heuristics</term></keywords><keywords scheme="mix" xml:lang="fr"><term> Flotte limitée</term><term> Métaheuristiques.</term><term> Problèmes de tournées de véhicules</term><term> Transport</term><term>Logistique</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This thesis investigates an optimization problem concerning the distributionmanagement in the supply chain. It addresses the Vehicle Routing Problems (VRP)with Heterogeneous Limited Fleet, through the development of resolution strategies withheuristics methods. Taking into account capacity constraints and the limited number ofheterogeneous fleet of vehicles available, we studied three variants of vehicle routing problems:the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP), the VehicleRouting Problem with Private fleet and common Carrier (VRPPC) and the Dynamic VehicleRouting Problem (DVRP). We have applied Tabu search algorithms, evolutionaryalgorithms and ant colony algorithm to provide effective solutions to these problems.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en"> Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems</title><title xml:lang="fr">Approches métaheuristiques pour résoudre quelques variantes de problème de tournées de véhicules avec flotte limitée </title><author role="aut"><persName><forename type="first">Jalel</forename><surname>Euchi</surname></persName><email>euchi.jalel@yahoo.fr</email><idno type="halauthor">1293517</idno><affiliation ref="#struct-36444"></affiliation></author><editor role="depositor"><persName><forename>Jalel</forename><surname>Euchi</surname></persName><email>euchi.jalel@yahoo.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2016-02-14 11:55:32</date><date type="whenModified">2016-02-18 01:00:37</date><date type="whenReleased">2016-02-17 09:36:59</date><date type="whenProduced">2011-05-30</date><date type="whenEndEmbargoed">2016-02-14</date><ref type="file" target="https://tel.archives-ouvertes.fr/tel-01273816/document"><date notBefore="2016-02-14"></date></ref><ref type="file" n="1" target="https://tel.archives-ouvertes.fr/tel-01273816/file/th%C3%A8se_jalel_euchi.pdf"><date notBefore="2016-02-14"></date></ref></edition><respStmt><resp>contributor</resp><name key="332456"><persName><forename>Jalel</forename><surname>Euchi</surname></persName><email>euchi.jalel@yahoo.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">tel-01273816</idno><idno type="halUri">https://tel.archives-ouvertes.fr/tel-01273816</idno><idno type="halBibtex">euchi:tel-01273816</idno><idno type="halRefHtml">Artificial Intelligence [cs.AI]. Université du Havre, 2011. English</idno><idno type="halRef">Artificial Intelligence [cs.AI]. Université du Havre, 2011. English</idno></publicationStmt><seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno></seriesStmt><notesStmt></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en"> Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems</title><title xml:lang="fr">Approches métaheuristiques pour résoudre quelques variantes de problème de tournées de véhicules avec flotte limitée </title><author role="aut"><persName><forename type="first">Jalel</forename><surname>Euchi</surname></persName><email>euchi.jalel@yahoo.fr</email><idno type="halAuthorId">1293517</idno><affiliation ref="#struct-36444"></affiliation></author></analytic><monogr><imprint><date type="dateDefended">2011-05-30</date></imprint><authority type="institution">Université du Havre</authority><authority type="supervisor">Habib Chabchoub</authority><authority type="supervisor">Adnan Yassine</authority><authority type="jury">Taicir Loukil (Présidente)</authority><authority type="jury">Cyril FONLUPT (Rapporteur)</authority><authority type="jury">Talel LADHARI (Rapporteur)</authority><authority type="jury">Jaouad BOUKACHOUR (Examinateur)</authority></monogr></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term xml:lang="en">Heuristics</term><term xml:lang="fr">Logistique</term><term xml:lang="fr"> Transport</term><term xml:lang="fr"> Problèmes de tournées de véhicules</term><term xml:lang="fr"> Flotte limitée</term><term xml:lang="fr"> Métaheuristiques.</term></keywords><classCode scheme="acm" n="F.2"></classCode><classCode scheme="acm" n="I"></classCode><classCode scheme="acm" n="D.2"></classCode><classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode><classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [cs.RO]</classCode><classCode scheme="halTypology" n="THESE">Theses</classCode></textClass><abstract xml:lang="en">This thesis investigates an optimization problem concerning the distributionmanagement in the supply chain. It addresses the Vehicle Routing Problems (VRP)with Heterogeneous Limited Fleet, through the development of resolution strategies withheuristics methods. Taking into account capacity constraints and the limited number ofheterogeneous fleet of vehicles available, we studied three variants of vehicle routing problems:the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP), the VehicleRouting Problem with Private fleet and common Carrier (VRPPC) and the Dynamic VehicleRouting Problem (DVRP). We have applied Tabu search algorithms, evolutionaryalgorithms and ant colony algorithm to provide effective solutions to these problems.</abstract><abstract xml:lang="fr">Cette thèse étudie une problématique d’optimisation concernant la gestionde la distribution au niveau de la chaîne logistique. Elle aborde les problèmes de tournéesde véhicules avec flotte limitée hétérogène, à travers le développement de stratégies derésolution avec des méthodes heuristiques. Tenant compte des contraintes de capacitéet de limitation du nombre de la flotte hétérogène de véhicules disponibles, nous avonsétudié trois variantes des problèmes de tournées de véhicules : le problème de tournéesavec flotte limitée hétérogène, le problème de tournées de véhicules avec flotte limitée ettransporteur externe et le problème de tournées de véhicules dynamiques. Nous avons appliquédes algorithmes de recherche tabou, des algorithmes évolutionnaires et l’algorithmede colonie de fourmis pour apporter des solutions efficaces à ces différents problèmes</abstract></profileDesc></hal></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Hal/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000002 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 000002 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= Hal
|étape= Corpus
|type= RBID
|clé= Hal:tel-01273816
|texte= Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems
}}
| This area was generated with Dilib version V0.6.25. |  |