Serveur d'exploration sur la visibilité du Havre

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.

Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems

Identifieur interne : 000746 ( Main/Exploration ); précédent : 000745; suivant : 000747

Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems

Auteurs : Jalel Euchi [France]

Source :

RBID : Hal:tel-01273816

Descripteurs français

English descriptors

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:


Affiliations:


Links toward previous steps (curation, corpus...)


Le 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 wicri:level="1">
<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>
<country>France</country>
</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>
<idno type="wicri:Area/Hal/Curation">000002</idno>
<idno type="wicri:Area/Hal/Checkpoint">000371</idno>
<idno type="wicri:Area/Main/Merge">000751</idno>
<idno type="wicri:Area/Main/Curation">000746</idno>
<idno type="wicri:Area/Main/Exploration">000746</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 wicri:level="1">
<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>
<country>France</country>
</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>
<affiliations>
<list>
<country>
<li>France</li>
</country>
</list>
<tree>
<country name="France">
<noRegion>
<name sortKey="Euchi, Jalel" sort="Euchi, Jalel" uniqKey="Euchi J" first="Jalel" last="Euchi">Jalel Euchi</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000746 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000746 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/France
   |area=    LeHavreV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Hal:tel-01273816
   |texte=    Metaheuristics approaches to solve some variants of the Heterogeneous Fixed fleet Vehicle Routing Problems
}}

Wicri

This area was generated with Dilib version V0.6.25.
Data generation: Sat Dec 3 14:37:02 2016. Site generation: Tue Mar 5 08:25:07 2024