Optimization algorithms for the resolution of container storage problem at seaport terminal
Identifieur interne : 000117 ( France/Analysis ); précédent : 000116; suivant : 000118Optimization algorithms for the resolution of container storage problem at seaport terminal
Auteurs : Ndèye Fatma Ndiaye [France]Source :
English descriptors
Abstract
AIn this thesis, we trait the container storage problem at port terminal. Initially, we present a state of the art in which the work that have been previously made in this filed are analyzed. After that, we present an analytical study. Thed we propose a mathematical modelling and some methods of resolution including effective algorithms. We propose a demonstration of the complexity of the problem by considering different cases of storage. This problme is "Np_difficult, so not always easy to solve by using the optimization software "ILOG CPLEX”. This is why we propose a branch-and-cut algorithm, wich is an optimal resolution algorithm and wich enables to go beyong the limits of "ILOG CPLEX". We also proposed meta-heuristic algorithms and hybridizations wich provide satisfactory resulys and wich required less calculation times.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 000244
- to stream Hal, to step Curation: 000244
- to stream Hal, to step Checkpoint: 000055
- to stream Main, to step Merge: 000120
- to stream Main, to step Curation: 000120
- to stream Main, to step Exploration: 000120
- to stream France, to step Extraction: 000117
Links to Exploration step
Hal:tel-01255365Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Optimization algorithms for the resolution of container storage problem at seaport terminal</title><title xml:lang="fr">Algorithmes d'optimisation pour la résolution du problème de stockage de conteneurs dans un terminal portuaire</title><author><name sortKey="Ndiaye, Ndeye Fatma" sort="Ndiaye, Ndeye Fatma" uniqKey="Ndiaye N" first="Ndèye Fatma" last="Ndiaye">Ndèye Fatma Ndiaye</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-244411" status="INCOMING"><orgName>Laboratoire Mathématique Appliqué Havre</orgName><orgName type="acronym">LMAH</orgName><desc><address><addrLine>Université du Havre 25 rue Philippe Lebon BP 1123 76063 LE HAVRE CEDEX</addrLine><country key="FR"></country></address><ref type="url">http://lmah.univ-lehavre.fr/</ref></desc><listRelation><relation active="#struct-420786" type="direct"></relation><relation active="#struct-302085" type="direct"></relation><relation active="#struct-358429" type="direct"></relation><relation active="#struct-358430" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-420786" type="direct"><org type="institution" xml:id="struct-420786" status="VALID"><orgName>Université Paris-Est Créteil Val-de-Marne - Paris 12</orgName><orgName type="acronym">UPEC UP12</orgName><desc><address><addrLine>61 avenue du Général de Gaulle - 94010 Créteil cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.u-pec.fr/</ref></desc></org></tutelle><tutelle active="#struct-302085" type="direct"><org type="institution" xml:id="struct-302085" status="VALID"><orgName>Fédération de Recherche Bézout</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-358429" type="direct"><org type="institution" xml:id="struct-358429" status="INCOMING"><orgName>univsité du Havre</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-358430" type="direct"><org type="institution" xml:id="struct-358430" status="INCOMING"><orgName>LMAH</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>France</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:tel-01255365</idno><idno type="halId">tel-01255365</idno><idno type="halUri">https://tel.archives-ouvertes.fr/tel-01255365</idno><idno type="url">https://tel.archives-ouvertes.fr/tel-01255365</idno><date when="2015-06-23">2015-06-23</date><idno type="wicri:Area/Hal/Corpus">000244</idno><idno type="wicri:Area/Hal/Curation">000244</idno><idno type="wicri:Area/Hal/Checkpoint">000055</idno><idno type="wicri:Area/Main/Merge">000120</idno><idno type="wicri:Area/Main/Curation">000120</idno><idno type="wicri:Area/Main/Exploration">000120</idno><idno type="wicri:Area/France/Extraction">000117</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Optimization algorithms for the resolution of container storage problem at seaport terminal</title><title xml:lang="fr">Algorithmes d'optimisation pour la résolution du problème de stockage de conteneurs dans un terminal portuaire</title><author><name sortKey="Ndiaye, Ndeye Fatma" sort="Ndiaye, Ndeye Fatma" uniqKey="Ndiaye N" first="Ndèye Fatma" last="Ndiaye">Ndèye Fatma Ndiaye</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-244411" status="INCOMING"><orgName>Laboratoire Mathématique Appliqué Havre</orgName><orgName type="acronym">LMAH</orgName><desc><address><addrLine>Université du Havre 25 rue Philippe Lebon BP 1123 76063 LE HAVRE CEDEX</addrLine><country key="FR"></country></address><ref type="url">http://lmah.univ-lehavre.fr/</ref></desc><listRelation><relation active="#struct-420786" type="direct"></relation><relation active="#struct-302085" type="direct"></relation><relation active="#struct-358429" type="direct"></relation><relation active="#struct-358430" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-420786" type="direct"><org type="institution" xml:id="struct-420786" status="VALID"><orgName>Université Paris-Est Créteil Val-de-Marne - Paris 12</orgName><orgName type="acronym">UPEC UP12</orgName><desc><address><addrLine>61 avenue du Général de Gaulle - 94010 Créteil cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.u-pec.fr/</ref></desc></org></tutelle><tutelle active="#struct-302085" type="direct"><org type="institution" xml:id="struct-302085" status="VALID"><orgName>Fédération de Recherche Bézout</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-358429" type="direct"><org type="institution" xml:id="struct-358429" status="INCOMING"><orgName>univsité du Havre</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-358430" type="direct"><org type="institution" xml:id="struct-358430" status="INCOMING"><orgName>LMAH</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>France</country></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Branch-and-cut</term><term>Container storage problem</term><term>Mathematical modelling</term><term>Meta-heuristic</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">AIn this thesis, we trait the container storage problem at port terminal. Initially, we present a state of the art in which the work that have been previously made in this filed are analyzed. After that, we present an analytical study. Thed we propose a mathematical modelling and some methods of resolution including effective algorithms. We propose a demonstration of the complexity of the problem by considering different cases of storage. This problme is "Np_difficult, so not always easy to solve by using the optimization software "ILOG CPLEX”. This is why we propose a branch-and-cut algorithm, wich is an optimal resolution algorithm and wich enables to go beyong the limits of "ILOG CPLEX". We also proposed meta-heuristic algorithms and hybridizations wich provide satisfactory resulys and wich required less calculation times.</div></front></TEI><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Ndiaye, Ndeye Fatma" sort="Ndiaye, Ndeye Fatma" uniqKey="Ndiaye N" first="Ndèye Fatma" last="Ndiaye">Ndèye Fatma Ndiaye</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000117 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000117 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= France
|étape= Analysis
|type= RBID
|clé= Hal:tel-01255365
|texte= Optimization algorithms for the resolution of container storage problem at seaport terminal
}}
| This area was generated with Dilib version V0.6.25. |  |