LeHavreV1, PascalFrancis, Corpus, bibRecord, 000027

Scheduling of lifting vehicle and quay crane in automated port container terminals

Identifieur interne : 000027 ( PascalFrancis/Corpus ); précédent : 000026; suivant : 000028

Scheduling of lifting vehicle and quay crane in automated port container terminals

Auteurs : LE HOAI MINH ; Adnan Yassine ; Moussi Riadh

Source :

International journal of intelligent information and database systems : (Print) [ 1751-5858 ] ; 2012.

RBID : Pascal:13-0097301

Descripteurs français

Pascal (Inist)
- Terminal portuaire, Grue levage, Méthode séparation et évaluation, Méthode plan sécant, Programmation zero un, Transport conteneur, Ordonnancement, Compétition, Programmation partiellement en nombres entiers, Solution globale, Méthode énumération implicite, ..

English descriptors

KwdEn :
- Branch and bound method, Competition, Container transportation, Crane, Cutting plane method, Global solution, Implicit enumeration method, Mixed integer programming, Port terminal, Scheduling, Zero one programming.

Abstract

Container terminals are continuously facing the challenge of strong competition between ports. In this study, we present the terminal of Normandy-Le Havre port. We consider a mixed integer programming problem for the problem of assigning optimal delivery tasks to lifting vehicles. There are a lot of algorithms designed for this problem such as B&B method, cutting plane,... By using an exact penalty technique we treat this problem as a DC programme in the context of continuous optimisation. Further, we combine DCA with the classical Branch and Bound method for finding global solutions.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 1751-5858`
A05				`@2 6`
A06				`@2 6`
A08	`01`	`1`	`ENG`	`@1 Scheduling of lifting vehicle and quay crane in automated port container terminals`
A09	`01`	`1`	`ENG`	`@1 OPTIMISATION AND LEARNING THEORY, ALGORITHMS AND APPLICATIONS`
A11	`01`	`1`		`@1 LE HOAI MINH`
A11	`02`	`1`		`@1 YASSINE (Adnan)`
A11	`03`	`1`		`@1 RIADH (Moussi)`
A12	`01`	`1`		`@1 HOAI AN LE THI @9 ed.`
A14	`01`			`@1 Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540 @2 76058 Le Havre @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut.`
A14	`02`			`@1 Institut Suprieur d'Etudes Logistiques (ISEL), Quai Frissard - B.P. 1137 @2 76063 Le Havre @3 FRA @Z 2 aut.`
A15	`01`			`@1 Laboratory of Theoretical and Applied Computer Science, UFR MIM, University of Lorraine, Ile du Saulcy @2 57045 Metz @3 FRA @Z 1 aut.`
A20				`@1 516-531`
A21				`@1 2012`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 27952 @5 354000505462750010`
A44				`@0 0000 @1 © 2013 INIST-CNRS. All rights reserved.`
A45				`@0 3/4 p.`
A47	`01`	`1`		`@0 13-0097301`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 International journal of intelligent information and database systems : (Print)`
A66	`01`			`@0 CHE`
C01	`01`		`ENG`	@0 Container terminals are continuously facing the challenge of strong competition between ports. In this study, we present the terminal of Normandy-Le Havre port. We consider a mixed integer programming problem for the problem of assigning optimal delivery tasks to lifting vehicles. There are a lot of algorithms designed for this problem such as B&B method, cutting plane,... By using an exact penalty technique we treat this problem as a DC programme in the context of continuous optimisation. Further, we combine DCA with the classical Branch and Bound method for finding global solutions.
C02	`01`	`X`		`@0 001D15E`
C02	`02`	`X`		`@0 001D01A03`
C03	`01`	`X`	`FRE`	`@0 Terminal portuaire @5 06`
C03	`01`	`X`	`ENG`	`@0 Port terminal @5 06`
C03	`01`	`X`	`SPA`	`@0 Terminal portuario @5 06`
C03	`02`	`X`	`FRE`	`@0 Grue levage @5 07`
C03	`02`	`X`	`ENG`	`@0 Crane @5 07`
C03	`02`	`X`	`SPA`	`@0 Grúa socorro @5 07`
C03	`03`	`X`	`FRE`	`@0 Méthode séparation et évaluation @5 08`
C03	`03`	`X`	`ENG`	`@0 Branch and bound method @5 08`
C03	`03`	`X`	`SPA`	`@0 Método branch and bound @5 08`
C03	`04`	`X`	`FRE`	`@0 Méthode plan sécant @5 09`
C03	`04`	`X`	`ENG`	`@0 Cutting plane method @5 09`
C03	`04`	`X`	`SPA`	`@0 Método plano secante @5 09`
C03	`05`	`X`	`FRE`	`@0 Programmation zero un @5 10`
C03	`05`	`X`	`ENG`	`@0 Zero one programming @5 10`
C03	`05`	`X`	`SPA`	`@0 Programmacion cero uno @5 10`
C03	`06`	`X`	`FRE`	`@0 Transport conteneur @5 18`
C03	`06`	`X`	`ENG`	`@0 Container transportation @5 18`
C03	`06`	`X`	`SPA`	`@0 Transporte container @5 18`
C03	`07`	`X`	`FRE`	`@0 Ordonnancement @5 23`
C03	`07`	`X`	`ENG`	`@0 Scheduling @5 23`
C03	`07`	`X`	`SPA`	`@0 Reglamento @5 23`
C03	`08`	`X`	`FRE`	`@0 Compétition @5 24`
C03	`08`	`X`	`ENG`	`@0 Competition @5 24`
C03	`08`	`X`	`SPA`	`@0 Competencia @5 24`
C03	`09`	`X`	`FRE`	`@0 Programmation partiellement en nombres entiers @5 25`
C03	`09`	`X`	`ENG`	`@0 Mixed integer programming @5 25`
C03	`09`	`X`	`SPA`	`@0 Programación mixta entera @5 25`
C03	`10`	`X`	`FRE`	`@0 Solution globale @5 26`
C03	`10`	`X`	`ENG`	`@0 Global solution @5 26`
C03	`10`	`X`	`SPA`	`@0 Solución global @5 26`
C03	`11`	`X`	`FRE`	`@0 Méthode énumération implicite @5 27`
C03	`11`	`X`	`ENG`	`@0 Implicit enumeration method @5 27`
C03	`11`	`X`	`SPA`	`@0 Método enumeración implícita @5 27`
C03	`12`	`X`	`FRE`	`@0 . @4 INC @5 82`
N21				`@1 070`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

A30	`01`	`1`	`ENG`	`@1 'Optimisation and learning' workshop @3 Metz FRA @4 2010-06-17`

Format Inist (serveur)

NO :	PASCAL 13-0097301 INIST
ET :	Scheduling of lifting vehicle and quay crane in automated port container terminals
AU :	LE HOAI MINH; YASSINE (Adnan); RIADH (Moussi); HOAI AN LE THI
AF :	Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540/76058 Le Havre/France (1 aut., 2 aut., 3 aut.); Institut Suprieur d'Etudes Logistiques (ISEL), Quai Frissard - B.P. 1137/76063 Le Havre/France (2 aut.); Laboratory of Theoretical and Applied Computer Science, UFR MIM, University of Lorraine, Ile du Saulcy/57045 Metz/France (1 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	International journal of intelligent information and database systems : (Print); ISSN 1751-5858; Suisse; Da. 2012; Vol. 6; No. 6; Pp. 516-531; Bibl. 3/4 p.
LA :	Anglais
EA :	Container terminals are continuously facing the challenge of strong competition between ports. In this study, we present the terminal of Normandy-Le Havre port. We consider a mixed integer programming problem for the problem of assigning optimal delivery tasks to lifting vehicles. There are a lot of algorithms designed for this problem such as B&B method, cutting plane,... By using an exact penalty technique we treat this problem as a DC programme in the context of continuous optimisation. Further, we combine DCA with the classical Branch and Bound method for finding global solutions.
CC :	001D15E; 001D01A03
FD :	Terminal portuaire; Grue levage; Méthode séparation et évaluation; Méthode plan sécant; Programmation zero un; Transport conteneur; Ordonnancement; Compétition; Programmation partiellement en nombres entiers; Solution globale; Méthode énumération implicite; .
ED :	Port terminal; Crane; Branch and bound method; Cutting plane method; Zero one programming; Container transportation; Scheduling; Competition; Mixed integer programming; Global solution; Implicit enumeration method
SD :	Terminal portuario; Grúa socorro; Método branch and bound; Método plano secante; Programmacion cero uno; Transporte container; Reglamento; Competencia; Programación mixta entera; Solución global; Método enumeración implícita
LO :	INIST-27952.354000505462750010
ID :	13-0097301

Links to Exploration step

Pascal:13-0097301

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Scheduling of lifting vehicle and quay crane in automated port container terminals</title>
<author><name sortKey="Le Hoai Minh" sort="Le Hoai Minh" uniqKey="Le Hoai Minh" last="Le Hoai Minh">LE HOAI MINH</name>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540</s1>
<s2>76058 Le Havre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Yassine, Adnan" sort="Yassine, Adnan" uniqKey="Yassine A" first="Adnan" last="Yassine">Adnan Yassine</name>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540</s1>
<s2>76058 Le Havre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>Institut Suprieur d'Etudes Logistiques (ISEL), Quai Frissard - B.P. 1137</s1>
<s2>76063 Le Havre</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Riadh, Moussi" sort="Riadh, Moussi" uniqKey="Riadh M" first="Moussi" last="Riadh">Moussi Riadh</name>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540</s1>
<s2>76058 Le Havre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">13-0097301</idno>
<date when="2012">2012</date>
<idno type="stanalyst">PASCAL 13-0097301 INIST</idno>
<idno type="RBID">Pascal:13-0097301</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000027</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Scheduling of lifting vehicle and quay crane in automated port container terminals</title>
<author><name sortKey="Le Hoai Minh" sort="Le Hoai Minh" uniqKey="Le Hoai Minh" last="Le Hoai Minh">LE HOAI MINH</name>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540</s1>
<s2>76058 Le Havre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Yassine, Adnan" sort="Yassine, Adnan" uniqKey="Yassine A" first="Adnan" last="Yassine">Adnan Yassine</name>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540</s1>
<s2>76058 Le Havre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>Institut Suprieur d'Etudes Logistiques (ISEL), Quai Frissard - B.P. 1137</s1>
<s2>76063 Le Havre</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Riadh, Moussi" sort="Riadh, Moussi" uniqKey="Riadh M" first="Moussi" last="Riadh">Moussi Riadh</name>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540</s1>
<s2>76058 Le Havre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">International journal of intelligent information and database systems : (Print)</title>
<idno type="ISSN">1751-5858</idno>
<imprint><date when="2012">2012</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">International journal of intelligent information and database systems : (Print)</title>
<idno type="ISSN">1751-5858</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Branch and bound method</term>
<term>Competition</term>
<term>Container transportation</term>
<term>Crane</term>
<term>Cutting plane method</term>
<term>Global solution</term>
<term>Implicit enumeration method</term>
<term>Mixed integer programming</term>
<term>Port terminal</term>
<term>Scheduling</term>
<term>Zero one programming</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Terminal portuaire</term>
<term>Grue levage</term>
<term>Méthode séparation et évaluation</term>
<term>Méthode plan sécant</term>
<term>Programmation zero un</term>
<term>Transport conteneur</term>
<term>Ordonnancement</term>
<term>Compétition</term>
<term>Programmation partiellement en nombres entiers</term>
<term>Solution globale</term>
<term>Méthode énumération implicite</term>
<term>.</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Container terminals are continuously facing the challenge of strong competition between ports. In this study, we present the terminal of Normandy-Le Havre port. We consider a mixed integer programming problem for the problem of assigning optimal delivery tasks to lifting vehicles. There are a lot of algorithms designed for this problem such as B&B method, cutting plane,... By using an exact penalty technique we treat this problem as a DC programme in the context of continuous optimisation. Further, we combine DCA with the classical Branch and Bound method for finding global solutions.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1751-5858</s0>
</fA01>
<fA05><s2>6</s2>
</fA05>
<fA06><s2>6</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Scheduling of lifting vehicle and quay crane in automated port container terminals</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>OPTIMISATION AND LEARNING THEORY, ALGORITHMS AND APPLICATIONS</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>LE HOAI MINH</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>YASSINE (Adnan)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>RIADH (Moussi)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>HOAI AN LE THI</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540</s1>
<s2>76058 Le Havre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Institut Suprieur d'Etudes Logistiques (ISEL), Quai Frissard - B.P. 1137</s1>
<s2>76063 Le Havre</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>Laboratory of Theoretical and Applied Computer Science, UFR MIM, University of Lorraine, Ile du Saulcy</s1>
<s2>57045 Metz</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA20><s1>516-531</s1>
</fA20>
<fA21><s1>2012</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>27952</s2>
<s5>354000505462750010</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2013 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>3/4 p.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>13-0097301</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>International journal of intelligent information and database systems : (Print)</s0>
</fA64>
<fA66 i1="01"><s0>CHE</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Container terminals are continuously facing the challenge of strong competition between ports. In this study, we present the terminal of Normandy-Le Havre port. We consider a mixed integer programming problem for the problem of assigning optimal delivery tasks to lifting vehicles. There are a lot of algorithms designed for this problem such as B&B method, cutting plane,... By using an exact penalty technique we treat this problem as a DC programme in the context of continuous optimisation. Further, we combine DCA with the classical Branch and Bound method for finding global solutions.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D15E</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D01A03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Terminal portuaire</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Port terminal</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Terminal portuario</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Grue levage</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Crane</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Grúa socorro</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Méthode séparation et évaluation</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Branch and bound method</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Método branch and bound</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Méthode plan sécant</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Cutting plane method</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Método plano secante</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Programmation zero un</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Zero one programming</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Programmacion cero uno</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Transport conteneur</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Container transportation</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Transporte container</s0>
<s5>18</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Ordonnancement</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Scheduling</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Reglamento</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Compétition</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Competition</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Competencia</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Programmation partiellement en nombres entiers</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Mixed integer programming</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Programación mixta entera</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Solution globale</s0>
<s5>26</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Global solution</s0>
<s5>26</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Solución global</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Méthode énumération implicite</s0>
<s5>27</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Implicit enumeration method</s0>
<s5>27</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Método enumeración implícita</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>.</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>070</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>'Optimisation and learning' workshop</s1>
<s3>Metz FRA</s3>
<s4>2010-06-17</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 13-0097301 INIST</NO>
<ET>Scheduling of lifting vehicle and quay crane in automated port container terminals</ET>
<AU>LE HOAI MINH; YASSINE (Adnan); RIADH (Moussi); HOAI AN LE THI</AU>
<AF>Laboratoire de Mathmatique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540/76058 Le Havre/France (1 aut., 2 aut., 3 aut.); Institut Suprieur d'Etudes Logistiques (ISEL), Quai Frissard - B.P. 1137/76063 Le Havre/France (2 aut.); Laboratory of Theoretical and Applied Computer Science, UFR MIM, University of Lorraine, Ile du Saulcy/57045 Metz/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>International journal of intelligent information and database systems : (Print); ISSN 1751-5858; Suisse; Da. 2012; Vol. 6; No. 6; Pp. 516-531; Bibl. 3/4 p.</SO>
<LA>Anglais</LA>
<EA>Container terminals are continuously facing the challenge of strong competition between ports. In this study, we present the terminal of Normandy-Le Havre port. We consider a mixed integer programming problem for the problem of assigning optimal delivery tasks to lifting vehicles. There are a lot of algorithms designed for this problem such as B&B method, cutting plane,... By using an exact penalty technique we treat this problem as a DC programme in the context of continuous optimisation. Further, we combine DCA with the classical Branch and Bound method for finding global solutions.</EA>
<CC>001D15E; 001D01A03</CC>
<FD>Terminal portuaire; Grue levage; Méthode séparation et évaluation; Méthode plan sécant; Programmation zero un; Transport conteneur; Ordonnancement; Compétition; Programmation partiellement en nombres entiers; Solution globale; Méthode énumération implicite; .</FD>
<ED>Port terminal; Crane; Branch and bound method; Cutting plane method; Zero one programming; Container transportation; Scheduling; Competition; Mixed integer programming; Global solution; Implicit enumeration method</ED>
<SD>Terminal portuario; Grúa socorro; Método branch and bound; Método plano secante; Programmacion cero uno; Transporte container; Reglamento; Competencia; Programación mixta entera; Solución global; Método enumeración implícita</SD>
<LO>INIST-27952.354000505462750010</LO>
<ID>13-0097301</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000027 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000027 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/France
   |area=    LeHavreV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:13-0097301
   |texte=   Scheduling of lifting vehicle and quay crane in automated port container terminals
}}

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

	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.

Serveur d'exploration sur la visibilité du Havre

Scheduling of lifting vehicle and quay crane in automated port container terminals

Scheduling of lifting vehicle and quay crane in automated port container terminals

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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