Essec\Faculty\Model\Profile {#2233 ▼
#_id: "B00000901"
#_source: array:39 [
"bid" => "B00000901"
"academId" => "1922"
"slug" => "alfandari-laurent"
"fullName" => "Laurent ALFANDARI"
"lastName" => "ALFANDARI"
"firstName" => "Laurent"
"title" => array:2 [
"fr" => "Professeur"
"en" => "Professor"
]
"email" => "alfandari@essec.edu"
"status" => "ACTIF"
"campus" => "Campus de Cergy"
"departments" => []
"phone" => "+33 (0)1 34 43 32 84"
"sites" => []
"facNumber" => "1922"
"externalCvUrl" => "https://faculty.essec.edu/cv/alfandari-laurent/pdf"
"googleScholarUrl" => "https://scholar.google.com/citations?user=zUsKlrMAAAAJ"
"facOrcId" => "https://orcid.org/0000-0001-6751-3650"
"career" => array:14 [
0 => Essec\Faculty\Model\CareerItem {#2269
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2000-09-01"
"endDate" => "2007-08-31"
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur assistant"
"en" => "Assistant Professor"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\CareerItem {#2270
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2007-09-01"
"endDate" => "2010-08-31"
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur associé"
"en" => "Associate Professor"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\CareerItem {#2271
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2010-09-01"
"endDate" => null
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur"
"en" => "Professor"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
3 => Essec\Faculty\Model\CareerItem {#2272
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2002-09-01"
"endDate" => "2020-09-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other appointments"
"fr" => "Autres positions"
]
"label" => array:2 [
"fr" => "Membre du LIPN"
"en" => "Member of the LIPN Laboratory"
]
"institution" => array:2 [
"fr" => "Sorbonne Université"
"en" => "Sorbonne Université"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
4 => Essec\Faculty\Model\CareerItem {#2273
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "1995-09-01"
"endDate" => "2002-08-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other appointments"
"fr" => "Autres positions"
]
"label" => array:2 [
"fr" => "Membre du Laboratoire LAMSADE"
"en" => "Member of the LAMSADE Laboratory"
]
"institution" => array:2 [
"fr" => "Université Paris Dauphine-PSL"
"en" => "Université Paris Dauphine-PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
5 => Essec\Faculty\Model\CareerItem {#2274
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "1993-01-01"
"endDate" => "1993-12-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Professional appointments"
"fr" => "Positions professionnelles"
]
"label" => array:2 [
"fr" => "Conseil en Urbanisme et Développement de Commerce Spécialisés"
"en" => "Consulting in Town Planning and Development of Specialized Retail"
]
"institution" => array:2 [
"fr" => "PROCOS"
"en" => "PROCOS"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
6 => Essec\Faculty\Model\CareerItem {#2275
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "1992-01-01"
"endDate" => "1992-01-12"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Professional appointments"
"fr" => "Positions professionnelles"
]
"label" => array:2 [
"fr" => "Auditeur interne"
"en" => "Audit reporter"
]
"institution" => array:2 [
"fr" => "TOTAL"
"en" => "TOTAL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
7 => Essec\Faculty\Model\CareerItem {#2276
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "1992-01-01"
"endDate" => "1992-12-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Professional appointments"
"fr" => "Positions professionnelles"
]
"label" => array:2 [
"fr" => "Contrôleur de Gestion"
"en" => "Management controller"
]
"institution" => array:2 [
"fr" => "Hachette"
"en" => "Hachette"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
8 => Essec\Faculty\Model\CareerItem {#2277
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "1991-01-01"
"endDate" => "1991-12-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Professional appointments"
"fr" => "Positions professionnelles"
]
"label" => array:2 [
"fr" => "Marketing"
"en" => "Marketing"
]
"institution" => array:2 [
"fr" => "Hachette"
"en" => "Hachette"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
9 => Essec\Faculty\Model\CareerItem {#2278
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2018-09-01"
"endDate" => "2021-08-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Responsable de filière PHD Opération & Data Analytics"
"en" => "Head of PhD concentration in Operations & Data Analytics"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
10 => Essec\Faculty\Model\CareerItem {#2279
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2019-09-01"
"endDate" => "2023-08-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "CO-Responsable DU MASTER IN DATA SCIENCES AND BUSINESS ANALYTICS"
"en" => "Academic co-director of ESSEC-CentraleSupélec Master in Data Sciences & Business Analytics"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
11 => Essec\Faculty\Model\CareerItem {#2280
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2013-09-01"
"endDate" => "2021-09-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Responsable de filière business analytics methods"
"en" => "Coordinator of MiM Business Analytics Methods track"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
12 => Essec\Faculty\Model\CareerItem {#2281
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2009-01-01"
"endDate" => "2011-08-30"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Directeur académique / Responsable académique"
"en" => "Academic director of ESSEC Master in Logistics & SCM"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
13 => Essec\Faculty\Model\CareerItem {#2282
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2012-01-01"
"endDate" => "2014-12-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other appointments"
"fr" => "Autres positions"
]
"label" => array:2 [
"fr" => "Responsable de département"
"en" => "Department head (IDS Department)"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"diplomes" => array:5 [
0 => Essec\Faculty\Model\Diplome {#2235
#_index: null
#_id: null
#_source: array:6 [
"diplome" => "DIPLOMA"
"type" => array:2 [
"fr" => "Diplômes"
"en" => "Diplomas"
]
"year" => "1999"
"label" => array:2 [
"en" => "Doctorate in Operations Research"
"fr" => "Doctorat en Recherche Opérationnelle"
]
"institution" => array:2 [
"fr" => "Université Paris Dauphine-PSL"
"en" => "Université Paris Dauphine-PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\Diplome {#2237
#_index: null
#_id: null
#_source: array:6 [
"diplome" => "DIPLOMA"
"type" => array:2 [
"fr" => "Diplômes"
"en" => "Diplomas"
]
"year" => "1995"
"label" => array:2 [
"en" => "Master of Research in Management Science"
"fr" => "Master of Research, Sciences du Management"
]
"institution" => array:2 [
"fr" => "Université Paris Dauphine-PSL"
"en" => "Université Paris Dauphine-PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\Diplome {#2234
#_index: null
#_id: null
#_source: array:6 [
"diplome" => "DIPLOMA"
"type" => array:2 [
"fr" => "Diplômes"
"en" => "Diplomas"
]
"year" => "1993"
"label" => array:2 [
"en" => "M.Sc in Management (Grande Ecole program)"
"fr" => "M.Sc in Management (Grande Ecole program)"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
3 => Essec\Faculty\Model\Diplome {#2238
#_index: null
#_id: null
#_source: array:6 [
"diplome" => "DIPLOMA"
"type" => array:2 [
"fr" => "Diplômes"
"en" => "Diplomas"
]
"year" => "1990"
"label" => array:2 [
"en" => "Bachelor in Mathematics & Social Sciences"
"fr" => "Licence - Mathématiques & Sciences Sociales"
]
"institution" => array:2 [
"fr" => "Université Paris Dauphine-PSL"
"en" => "Université Paris Dauphine-PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
4 => Essec\Faculty\Model\Diplome {#2232
#_index: null
#_id: null
#_source: array:6 [
"diplome" => "CERT"
"type" => array:2 [
"fr" => "Certificats"
"en" => "Certificates"
]
"year" => "2010"
"label" => array:2 [
"en" => "International Teachers Program (ITP)"
"fr" => "International Teachers Program (ITP)"
]
"institution" => array:2 [
"fr" => "Kellogg School of Management, Northwestern University"
"en" => "Kellogg School of Management, Northwestern University"
]
"country" => array:2 [
"fr" => "États-Unis"
"en" => "United States of America"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"bio" => array:2 [
"fr" => "<p>Laurent Alfandari is a Full Professor at ESSEC Business School, in the Information Systems, Decision Sciences and Statistics (IDS) Department. His research field is Operations Research and Decision analytics. He published book chapters and articles in international journals such as the European Journal of Operational Research, Annals of Operations Research, Computers and Operations Research, Discrete Applied Mathematics, Journal of Scheduling, Transportation Science, Transportation Research Part B, Omega, Theoretical Computer Science. He teaches Decision Analytics and Operations Research courses in various ESSEC Business School programs (Grande Ecole Master in Management, Executive MBA, Executive Education SCM programs, PhD). Until 2023 he was academic Co-Director of the ESSEC-CentraleSupélec Master in Data Sciences & Business Analytics (#3 worldwide QS ranking 2023), and coordinator of the Operations & Data Analytics PhD concentration until 2021. He was also before the Academic Director of the ESSEC specialized master in Logistics and Supply Chain Management. He carried out consulting studies and industrial contracts for SNCF, Babcock-Wanson, ESSEC BS, Aid-Impact. He was a member of the research team ranked #4 for the ROADEF-EURO international Challenge proposed by EDF in 2010, and also participated to the 2012 Google Challenge. He was Vice-President of the French Society of Operations Research & Decision-Aid (ROADEF) from 2012 to 2015.</p>\n 
<p>Laurent Alfandari is a Full Professor at ESSEC Business School, in the Information Systems, Decis "
"en" => "<p>Laurent Alfandari is a Full Professor at ESSEC Business School, in the Information Systems, Decision Sciences and Statistics (IDS) Department. His research field is Operations Research and Decision analytics. He published book chapters and articles in international journals such as the European Journal of Operational Research, Annals of Operations Research, Computers and Operations Research, Discrete Applied Mathematics, Journal of Scheduling, Transportation Science, Transportation Research Part B, Omega, Theoretical Computer Science. He teaches Decision Analytics and Operations Research courses in various ESSEC Business School programs (Grande Ecole Master in Management, Executive MBA, Executive Education SCM programs, PhD). Until 2023 he was<span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51)"> Academic Co-Director of the ESSEC-CentraleSupélec Master in Data Sciences & Business Analytics (#3 worldwide QS ranking 2023), and coordinator of the Operations & Data Analytics PhD concentration until 2021. </span>He was also before the Academic Director of the ESSEC specialized master in Logistics and Supply Chain Management. He carried out consulting studies and industrial contracts for SNCF, Babcock-Wanson, ESSEC BS, Aid-Impact. He was a member of the research team ranked #4 for the ROADEF-EURO international Challenge proposed by EDF in 2010, and also participated to the 2012 Google Challenge. He was Vice-President of the French Society of Operations Research & Decision-Aid (ROADEF) from 2012 to 2015.</p>\n <p>Laurent Alfandari is a Full Professor at ESSEC Business School, in the Information Systems, Decis "
]
"department" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"industrrySectors" => array:2 [
"fr" => null
"en" => null
]
"researchFields" => array:2 [
"fr" => "Recherche opérationnelle - Optimisation combinatoire - Programmation mathématique - Sciences de la décision - Gestion des approvisionnements Recherche opérationnelle - Optimisation combinatoire - Programmation mathématique - Sciences de la d "
"en" => "Operations Research - Combinatorial Optimization - Mathematical Programming - Decision Sciences - Supply Chain Management Operations Research - Combinatorial Optimization - Mathematical Programming - Decision Sciences - Su "
]
"teachingFields" => array:2 [
"fr" => "Sciences de la décision - Recherche opérationnelle - Planification et optimisation - Gestion des approvisionnements Sciences de la décision - Recherche opérationnelle - Planification et optimisation - Gestion des app "
"en" => "Decision Sciences - Operations Research - Scheduling, Queueing and Location Optimization - Supply Chain Management Decision Sciences - Operations Research - Scheduling, Queueing and Location Optimization - Supply Ch "
]
"distinctions" => array:1 [
0 => Essec\Faculty\Model\Distinction {#2283
#_index: null
#_id: null
#_source: array:6 [
"date" => "2020-03-15"
"label" => array:2 [
"fr" => "Teaching Awards ESSEC Top 4 Permanent Professors"
"en" => "Teaching Awards ESSEC Top 4 Permanent Professors"
]
"type" => array:2 [
"fr" => "Prix"
"en" => "Awards"
]
"tri" => " 1 "
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"teaching" => array:25 [
0 => Essec\Faculty\Model\TeachingItem {#2268
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Three essays on facility location and vehicle routing optimization"
"en" => "Three essays on facility location and vehicle routing optimization"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
1 => Essec\Faculty\Model\TeachingItem {#2250
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2021"
"endDate" => "2025"
"program" => null
"label" => array:2 [
"fr" => "Prescriptive analytics for sustainable development"
"en" => "Prescriptive analytics for sustainable development"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
2 => Essec\Faculty\Model\TeachingItem {#2249
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2010"
"endDate" => "2025"
"program" => null
"label" => array:2 [
"fr" => "Optimal design for Supply Chain Management"
"en" => "Optimal design for Supply Chain Management"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
3 => Essec\Faculty\Model\TeachingItem {#2247
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2002"
"endDate" => "2025"
"program" => null
"label" => array:2 [
"fr" => "PhD Introduction to Optimization methods"
"en" => "PhD Introduction to Optimization methods"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
4 => Essec\Faculty\Model\TeachingItem {#2245
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2000"
"endDate" => "2025"
"program" => null
"label" => array:2 [
"fr" => "Mathematics Refresher"
"en" => "Mathematics Refresher"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
5 => Essec\Faculty\Model\TeachingItem {#2244
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2000"
"endDate" => "2025"
"program" => null
"label" => array:2 [
"fr" => "Optimization for Decision-Making"
"en" => "Optimization for Decision-Making"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
6 => Essec\Faculty\Model\TeachingItem {#2248
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2000"
"endDate" => "2025"
"program" => null
"label" => array:2 [
"fr" => "Decision analytics"
"en" => "Decision analytics"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
7 => Essec\Faculty\Model\TeachingItem {#2265
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2024"
"program" => null
"label" => array:2 [
"fr" => "Three essays in sustainable last-mile deliveries and humanitarian logistics"
"en" => "Three essays in sustainable last-mile deliveries and humanitarian logistics"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
8 => Essec\Faculty\Model\TeachingItem {#2267
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2023"
"program" => null
"label" => array:2 [
"fr" => "Four essays in healthcare analytics, insurance pricing and home service optimisation"
"en" => "Four essays in healthcare analytics, insurance pricing and home service optimisation"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
9 => Essec\Faculty\Model\TeachingItem {#2266
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2023"
"program" => null
"label" => array:2 [
"fr" => "Assortment optimization, omnichannel"
"en" => "Assortment optimization, omnichannel"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
10 => Essec\Faculty\Model\TeachingItem {#2255
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2012"
"endDate" => "2022"
"program" => null
"label" => array:2 [
"fr" => "PhD Operations Research for sustainable development"
"en" => "PhD Operations Research for sustainable development"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "Conservatoire National des Arts & Métiers (CNAM)"
"en" => "Conservatoire National des Arts & Métiers (CNAM)"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
11 => Essec\Faculty\Model\TeachingItem {#2261
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2020"
"program" => null
"label" => array:2 [
"fr" => "Exploring and optimizing data-driven service operations."
"en" => "Exploring and optimizing data-driven service operations."
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
12 => Essec\Faculty\Model\TeachingItem {#2256
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2010"
"endDate" => "2019"
"program" => null
"label" => array:2 [
"fr" => "Planning models and case studies"
"en" => "Planning models and case studies"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "Université Sorbonne Paris Nord (XIII)"
"en" => "Université Sorbonne Paris Nord (XIII)"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
13 => Essec\Faculty\Model\TeachingItem {#2260
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2012"
"endDate" => "2018"
"program" => null
"label" => array:2 [
"fr" => "Four essays on allocation problems in supply chain management"
"en" => "Four essays on allocation problems in supply chain management"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
14 => Essec\Faculty\Model\TeachingItem {#2258
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2011"
"endDate" => "2017"
"program" => null
"label" => array:2 [
"fr" => "Towards an efficient embedding of logit choice models into 0-1 selection problems"
"en" => "Towards an efficient embedding of logit choice models into 0-1 selection problems"
]
"type" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
15 => Essec\Faculty\Model\TeachingItem {#2259
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2011"
"endDate" => "2017"
"program" => null
"label" => array:2 [
"fr" => "Robust optimization for discrete structures and non-linear impact of uncertainty"
"en" => "Robust optimization for discrete structures and non-linear impact of uncertainty"
]
"type" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
16 => Essec\Faculty\Model\TeachingItem {#2262
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2014"
"program" => null
"label" => array:2 [
"fr" => "Solving strategic and tactical optimization problems in City Logistics"
"en" => "Solving strategic and tactical optimization problems in City Logistics"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université Sorbonne Paris Nord (XIII)"
"en" => "Université Sorbonne Paris Nord (XIII)"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
17 => Essec\Faculty\Model\TeachingItem {#2246
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2010"
"endDate" => "2013"
"program" => null
"label" => array:2 [
"fr" => "Operations management"
"en" => "Operations management"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
18 => Essec\Faculty\Model\TeachingItem {#2263
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2011"
"program" => null
"label" => array:2 [
"fr" => "Problèmes de couverture en nombres entiers: génération de colonnes, heuristiques d'approximation et schémas hybrides. Applications en transport ferroviaire et planification de production. Problèmes de couverture en nombres entiers: génération de colonnes, heuristiques d'approximation et "
"en" => "Problèmes de couverture en nombres entiers: génération de colonnes, heuristiques d'approximation et schémas hybrides. Applications en transport ferroviaire et planification de production. Problèmes de couverture en nombres entiers: génération de colonnes, heuristiques d'approximation et "
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université Sorbonne Paris Nord (XIII)"
"en" => "Université Sorbonne Paris Nord (XIII)"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
19 => Essec\Faculty\Model\TeachingItem {#2252
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2002"
"endDate" => "2007"
"program" => null
"label" => array:2 [
"fr" => "Managing with Excel"
"en" => "Managing with Excel"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
20 => Essec\Faculty\Model\TeachingItem {#2264
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2006"
"program" => null
"label" => array:2 [
"fr" => "Modélisation et optimisation de la gestion du matériel roulant à la SNCF"
"en" => "Modélisation et optimisation de la gestion du matériel roulant à la SNCF"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
}
21 => Essec\Faculty\Model\TeachingItem {#2251
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2000"
"endDate" => "2003"
"program" => null
"label" => array:2 [
"fr" => "Regression methods in statistics and Graph Theory"
"en" => "Regression methods in statistics and Graph Theory"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
22 => Essec\Faculty\Model\TeachingItem {#2254
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "1996"
"endDate" => "1999"
"program" => null
"label" => array:2 [
"fr" => "Management science and decision-aid"
"en" => "Management science and decision-aid"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "Université Paris Dauphine-PSL"
"en" => "Université Paris Dauphine-PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
23 => Essec\Faculty\Model\TeachingItem {#2253
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "1996"
"endDate" => "1999"
"program" => null
"label" => array:2 [
"fr" => "Logistics and Production Planning"
"en" => "Logistics and Production Planning"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "Université Paris Dauphine-PSL"
"en" => "Université Paris Dauphine-PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
24 => Essec\Faculty\Model\TeachingItem {#2257
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "1996"
"endDate" => "1998"
"program" => null
"label" => array:2 [
"fr" => "Programming skills"
"en" => "Programming skills"
]
"type" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"institution" => array:2 [
"fr" => "Université Paris Dauphine-PSL"
"en" => "Université Paris Dauphine-PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
]
"otherActivities" => array:6 [
0 => Essec\Faculty\Model\ExtraActivity {#2236
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2013-04-01"
"endDate" => "2013-04-30"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Organisation d'un évènement pour les practiciens et managers : “La Recherche Opérationnelle: clé de la performance des entreprises?” 200 managers et practiciens présents, et une table ronde avec Air France, Amadeus, et Bouygues Télécom Organisation d'un évènement pour les practiciens et managers : “La Recherche Opérationnelle: clé de "
"en" => "Organization of an event for practitionners and managers: “La Recherche Opérationnelle: clé de la performance des entreprises?”, 200 managers and practionners attended, round-table with Air France, Amadeus, and Bouygues Télécom Organization of an event for practitionners and managers: “La Recherche Opérationnelle: clé de la pe "
]
"institution" => array:2 [
"fr" => "Université Paris Dauphine-PSL"
"en" => "Université Paris Dauphine-PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\ExtraActivity {#2239
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2015-11-01"
"endDate" => "2015-11-30"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Organisation du concours Français de la RO: "Les Pros de la RO", nov. 2015 (finalistes : Gefco-Eurodecision, Amadeus, Decision Brain, Orange) Organisation du concours Français de la RO: "Les Pros de la RO", nov. 2015 (finalistes : Gefco-Eurod "
"en" => "Organization of the French OR contest : "Les Pros de la RO", nov. 2015 (finalists : Gefco-Eurodecision, Amadeus, Decision Brain, Orange) Organization of the French OR contest : "Les Pros de la RO", nov. 2015 (finalists : Gefco-Eurodecisi "
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\ExtraActivity {#2240
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2000-09-01"
"endDate" => null
"year" => null
"uuid" => "204"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Membre d'une association académique"
"en" => "Member of an academic association"
]
"label" => array:2 [
"fr" => "Membre de la Société Française de RO (ROADEF)"
"en" => "Member of the French OR Society (ROADEF)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
3 => Essec\Faculty\Model\ExtraActivity {#2241
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2011-01-01"
"endDate" => "2015-12-31"
"year" => null
"uuid" => "202"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Fonction dans une association académique"
"en" => "Function in an academic association"
]
"label" => array:2 [
"fr" => "Vice-President de la ROADEF"
"en" => "Vice-President of the ROADEF"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
4 => Essec\Faculty\Model\ExtraActivity {#2242
#_index: null
#_id: null
#_source: array:9 [
"startDate" => null
"endDate" => null
"year" => null
"uuid" => "104"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Reviewer pour un journal"
"en" => "Reviewer for a journal"
]
"label" => array:2 [
"fr" => "Relecteur pour Annals of Operations Research; Computational Optimization and Applications; Computers & Operations Research; Discrete Applied Mathematics; European Journal of Operational Research; RAIRO - Operations Research Relecteur pour Annals of Operations Research; Computational Optimization and Applications; Computers "
"en" => "Reviewer for Annals of Operations Research; Computational Optimization and Applications; Computers & Operations Research; Discrete Applied Mathematics; European Journal of Operational Research; RAIRO - Operations Research Reviewer for Annals of Operations Research; Computational Optimization and Applications; Computers & "
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
5 => Essec\Faculty\Model\ExtraActivity {#2243
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2002-09-01"
"endDate" => null
"year" => null
"uuid" => "502"
"type" => array:2 [
"fr" => "Activités professionnelles"
"en" => "Professional activities"
]
"subType" => array:2 [
"fr" => "Consulting"
"en" => "Consulting"
]
"label" => array:2 [
"fr" => "Activités de conseil et contrats industriels : SNCF, ESSEC BS, Babcok-Wanson, Aid-Impact..."
"en" => "Consulting activities & industrial contracts : SNCF, ESSEC BS, Babcok-Wanson, Aid-Impact..."
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"theses" => array:11 [
0 => Essec\Faculty\Model\These {#2284
#_index: null
#_id: null
#_source: array:9 [
"year" => "2006"
"startDate" => null
"endDate" => "2006"
"student" => ""
"firstJob" => ""
"label" => array:2 [
"fr" => "Modélisation et optimisation de la gestion du matériel roulant à la SNCF"
"en" => "Modélisation et optimisation de la gestion du matériel roulant à la SNCF"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\These {#2285
#_index: null
#_id: null
#_source: array:9 [
"year" => "2023"
"startDate" => null
"endDate" => "2023"
"student" => "BISWAS D."
"firstJob" => ""
"label" => array:2 [
"fr" => "Four essays in healthcare analytics, insurance pricing and home service optimisation"
"en" => "Four essays in healthcare analytics, insurance pricing and home service optimisation"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\These {#2286
#_index: null
#_id: null
#_source: array:9 [
"year" => "2017"
"startDate" => "2011"
"endDate" => "2017"
"student" => "ESPINOZA Juan Carlos"
"firstJob" => "Assistant Professor - Tecnologico de Monterrey"
"label" => array:2 [
"fr" => "Robust optimization for discrete structures and non-linear impact of uncertainty"
"en" => "Robust optimization for discrete structures and non-linear impact of uncertainty"
]
"role" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
3 => Essec\Faculty\Model\These {#2287
#_index: null
#_id: null
#_source: array:9 [
"year" => "2017"
"startDate" => "2011"
"endDate" => "2017"
"student" => "GARNIER ép DENOYEL Victoire"
"firstJob" => "Assistant Professor, Business Analytics - Mercy College Graduate School of Business"
"label" => array:2 [
"fr" => "Towards an efficient embedding of logit choice models into 0-1 selection problems"
"en" => "Towards an efficient embedding of logit choice models into 0-1 selection problems"
]
"role" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
4 => Essec\Faculty\Model\These {#2288
#_index: null
#_id: null
#_source: array:9 [
"year" => "2014"
"startDate" => null
"endDate" => "2014"
"student" => "GIANESSI P."
"firstJob" => ""
"label" => array:2 [
"fr" => "Solving strategic and tactical optimization problems in City Logistics"
"en" => "Solving strategic and tactical optimization"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université Sorbonne Paris Nord (XIII)"
"en" => "Université Sorbonne Paris Nord (XIII)"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
5 => Essec\Faculty\Model\These {#2289
#_index: null
#_id: null
#_source: array:9 [
"year" => "2023"
"startDate" => null
"endDate" => "2023"
"student" => "HASSANZADEH A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Assortment optimization, omnichannel"
"en" => "Assortment optimization, omnichannel inventory positioning and drone network design : three essays in operations management Assortment optimization, omnichannel inventory positioning and drone network design : three essays i "
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
6 => Essec\Faculty\Model\These {#2290
#_index: null
#_id: null
#_source: array:9 [
"year" => "2018"
"startDate" => "2012"
"endDate" => "2018"
"student" => "KESHVARI FARD Milad"
"firstJob" => "Assistant Professor - Newcastle University Business School"
"label" => array:2 [
"fr" => "Four essays on allocation problems in supply chain management"
"en" => "Four essays on allocation problems in supply chain management"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
7 => Essec\Faculty\Model\These {#2291
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "KUZBAKOV Y."
"firstJob" => ""
"label" => array:2 [
"fr" => "Three essays on facility location and vehicle routing optimization"
"en" => "Three essays on facility location and vehicle routing optimization"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
8 => Essec\Faculty\Model\These {#2292
#_index: null
#_id: null
#_source: array:9 [
"year" => "2024"
"startDate" => null
"endDate" => "2024"
"student" => "PUNAM-MANDAL M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Three essays in sustainable last-mile deliveries and humanitarian logistics"
"en" => "Three essays in sustainable last-mile deliveries and humanitarian logistics"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
9 => Essec\Faculty\Model\These {#2293
#_index: null
#_id: null
#_source: array:9 [
"year" => "2011"
"startDate" => null
"endDate" => "2011"
"student" => "SADKI J."
"firstJob" => ""
"label" => array:2 [
"fr" => "Problèmes de couverture en nombres entiers: génération de colonnes, heuristiques d'approximation et schémas hybrides. Applications en transport ferroviaire et planification de production. Problèmes de couverture en nombres entiers: génération de colonnes, heuristiques d'approximation et "
"en" => "Problèmes de couverture en nombres entiers: génération de colonnes, heuristiques d'approximation et schémas hybrides. Problèmes de couverture en nombres entiers: génération de colonnes, heuristiques d'approximation et "
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université Sorbonne Paris Nord (XIII)"
"en" => "Université Sorbonne Paris Nord (XIII)"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
10 => Essec\Faculty\Model\These {#2294
#_index: null
#_id: null
#_source: array:9 [
"year" => "2020"
"startDate" => null
"endDate" => "2020"
"student" => "ZHAO Y."
"firstJob" => ""
"label" => array:2 [
"fr" => "Exploring and optimizing data-driven service operations."
"en" => "Exploring and optimizing data-driven service operations."
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"indexedAt" => "2025-04-05T20:21:22.000Z"
"contributions" => array:85 [
0 => Essec\Faculty\Model\Contribution {#2296
#_index: "academ_contributions"
#_id: "3406"
#_source: array:18 [
"id" => "3406"
"slug" => "3406-applications-of-combinatorial-optimization-airline-crew-pairing-optimization"
"yearMonth" => "2010-06"
"year" => "2010"
"title" => "Applications of Combinatorial Optimization: Airline Crew Pairing Optimization"
"description" => "ALFANDARI, L. et NAGIH, A. (2010). Applications of Combinatorial Optimization: Airline Crew Pairing Optimization. Dans: <i>Applications of Combinatorial Optimization</i>. 1st ed. Wiley, pp. 1-22. ALFANDARI, L. et NAGIH, A. (2010). Applications of Combinatorial Optimization: Airline Crew Pairing "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "NAGIH A."
]
]
"ouvrage" => "Applications of Combinatorial Optimization"
"keywords" => []
"updatedAt" => "2023-09-28 16:37:49"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "1-22"
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
1 => Essec\Faculty\Model\Contribution {#2298
#_index: "academ_contributions"
#_id: "1057"
#_source: array:18 [
"id" => "1057"
"slug" => "1057-edge-cover-by-connected-bipartite-subgraphs"
"yearMonth" => "2011-09"
"year" => "2011"
"title" => "Edge Cover by Connected Bipartite Subgraphs"
"description" => "LIBERTI, L., ALFANDARI, L. et PLATEAU, M.C. (2011). Edge Cover by Connected Bipartite Subgraphs. <i>Annals of Operations Research</i>, 188(1), pp. 307-329. LIBERTI, L., ALFANDARI, L. et PLATEAU, M.C. (2011). Edge Cover by Connected Bipartite Subgraphs. <i> "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "LIBERTI L."
]
2 => array:1 [
"name" => "PLATEAU M.-C."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Local Search"
1 => "Bipartite Graph"
2 => "Vertex Cover"
3 => "Constructive Heuristic"
4 => "Edge Cover"
]
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://link.springer.com/article/10.1007/s10479-009-0533-4"
"publicationInfo" => array:3 [
"pages" => "307-329"
"volume" => "188"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Le problème étudié consiste à couvrir les arêtes d'un graphe par un nombre minimum de sous-graphes bipartis connexes. Nous montrons que ce problème est NP-difficile, proposons des bornes inférieures via une formulation de type programmation mathématique en nombres entiers, ainsi que plusieurs heuristiques constructives et de recherche locale comparées via des expérimentations numériques. Le problème étudié consiste à couvrir les arêtes d'un graphe par un nombre minimum de sous-graphes b "
"en" => "We consider the problem of covering the edge set of an unweighted, undirected graph with the minimum number of connected bipartite subgraphs (where the subgraphs are not necessarily bicliques).We show that this is an NP-hard problem, provide lower bounds through an IP formulation, propose several constructive heuristics and a local search, and discuss computational results. Finally, we consider a constrained variant of the problem which we show to be NP-hard, and provide an IP formulation for the variant. We consider the problem of covering the edge set of an unweighted, undirected graph with the minimum "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
2 => Essec\Faculty\Model\Contribution {#2300
#_index: "academ_contributions"
#_id: "1198"
#_source: array:18 [
"id" => "1198"
"slug" => "1198-fast-machine-reassignment"
"yearMonth" => "2016-07"
"year" => "2016"
"title" => "Fast Machine Reassignment"
"description" => "BUTELLE, F., ALFANDARI, L., COTI, C., FINTA, L., LÉTOCART, L. et PLATEAU, G. (2016). Fast Machine Reassignment. <i>Annals of Operations Research</i>, 242(1), pp. 130-160. BUTELLE, F., ALFANDARI, L., COTI, C., FINTA, L., LÉTOCART, L. et PLATEAU, G. (2016). Fast Machine Re "
"authors" => array:6 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "BUTELLE F."
]
2 => array:1 [
"name" => "COTI C."
]
3 => array:1 [
"name" => "FINTA L."
]
4 => array:1 [
"name" => "LÉTOCART L."
]
5 => array:1 [
"name" => "PLATEAU G."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Generalized Assignment"
1 => "Adaptive Variable Neighborhood Search"
2 => "Simulated Annealing"
3 => "Hyper-Heuristic"
4 => "Cooperative Parallel Search"
]
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://link.springer.com/article/10.1007/s10479-015-2082-3"
"publicationInfo" => array:3 [
"pages" => "130-160"
"volume" => "242"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This paper proposes a new method for solving the Machine Reassignment Problem in a very short computational time. The problem has been proposed by Google as subject of the Challenge ROADEF/EURO 2012. The Machine Reassignment Problem consists in looking for a reassignment of processes to machines in order to minimize a complex objective function, subject to a rich set of constraints including multidimensional resource, conflict and dependency constraints. In this study, a cooperative search approach is presented for machine reassignment. This approach uses two components: Adaptive Variable Neighbourhood Search and Simulated Annealing based Hyper-Heuristic, running in parallel on two threads and exchanging solutions. Both algorithms employ a rich set of heuristics and a learning mechanism to select the best neighborhood/move type during the search process. The cooperation mechanism acts as a multiple restart which gets triggered whenever a new better solution is achieved by a thread and then shared with the other thread. Computational results on the Challenge instances as well as instances of a Generalized Assignment-like problem are given to show the relevance of the chosen methods and the high benefits of cooperation. This paper proposes a new method for solving the Machine Reassignment Problem in a very short comput "
"en" => "This paper proposes a new method for solving the Machine Reassignment Problem in a very short computational time. The problem has been proposed by Google as subject of the Challenge ROADEF/EURO 2012. The Machine Reassignment Problem consists in looking for a reassignment of processes to machines in order to minimize a complex objective function, subject to a rich set of constraints including multidimensional resource, conflict and dependency constraints. In this study, a cooperative search approach is presented for machine reassignment. This approach uses two components: Adaptive Variable Neighbourhood Search and Simulated Annealing based Hyper-Heuristic, running in parallel on two threads and exchanging solutions. Both algorithms employ a rich set of heuristics and a learning mechanism to select the best neighborhood/move type during the search process. The cooperation mechanism acts as a multiple restart which gets triggered whenever a new better solution is achieved by a thread and then shared with the other thread. Computational results on the Challenge instances as well as instances of a Generalized Assignment-like problem are given to show the relevance of the chosen methods and the high benefits of cooperation. This paper proposes a new method for solving the Machine Reassignment Problem in a very short comput "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
3 => Essec\Faculty\Model\Contribution {#2297
#_index: "academ_contributions"
#_id: "5431"
#_source: array:18 [
"id" => "5431"
"slug" => "5431-approximation-du-probleme-de-clustered-set-covering"
"yearMonth" => "2013-02"
"year" => "2013"
"title" => "Approximation du problème de Clustered Set Covering"
"description" => "ALFANDARI, L. (2013). Approximation du problème de Clustered Set Covering. Dans: 14ème Conférence ROADEF 2013. ALFANDARI, L. (2013). Approximation du problème de Clustered Set Covering. Dans: 14ème Conférence RO "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "14ème Conférence ROADEF 2013"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
4 => Essec\Faculty\Model\Contribution {#2301
#_index: "academ_contributions"
#_id: "1335"
#_source: array:18 [
"id" => "1335"
"slug" => "1335-hybrid-column-generation-for-large-size-covering-integer-programs-application-to-transportation-planning 1335-hybrid-column-generation-for-large-size-covering-integer-programs-application-to-transportation "
"yearMonth" => "2013-07"
"year" => "2013"
"title" => "Hybrid Column Generation for Large-Size Covering Integer Programs: Application to Transportation Planning Hybrid Column Generation for Large-Size Covering Integer Programs: Application to Transportation Pla "
"description" => "ALFANDARI, L., SADKI, J., PLATEAU, A. et NAGIH, A. (2013). Hybrid Column Generation for Large-Size Covering Integer Programs: Application to Transportation Planning. <i>Computers & Operations Research</i>, 40(8), pp. 1938-1946. ALFANDARI, L., SADKI, J., PLATEAU, A. et NAGIH, A. (2013). Hybrid Column Generation for Large-Size C "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "SADKI J."
]
2 => array:1 [
"name" => "PLATEAU A."
]
3 => array:1 [
"name" => "NAGIH A."
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Column generation"
1 => "Covering integer programming"
2 => "Approximation"
3 => "Greedy heuristic"
4 => "Fractional problems"
5 => "Transportation planning"
]
"updatedAt" => "2021-02-09 11:48:44"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0305054813000609"
"publicationInfo" => array:3 [
"pages" => "1938-1946"
"volume" => "40"
"number" => "8"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The well-known column generation scheme is often an efficient approach for solving the linear relaxation of large-size Covering Integer Programs (CIP). In this paper, this technique is hybridized with an extension of the best-known CIP approximation heuristic, taking advantage of distinct criteria of columns selection. This extension uses fractional optimization for solving pricing subproblems. Numerical results on a real-case transportation planning problems how that the hybrid scheme accelerates the convergence of column generation both in terms of number of iterations and computational time. The integer solutions generated at the end of the process can also be improved for a significant proportion of instances, highlighting the potential of diversification of the approximation heuristic. The well-known column generation scheme is often an efficient approach for solving the linear relaxa "
"en" => "The well-known column generation scheme is often an efficient approach for solving the linear relaxation of large-size Covering Integer Programs (CIP). In this paper, this technique is hybridized with an extension of the best-known CIP approximation heuristic, taking advantage of distinct criteria of columns selection. This extension uses fractional optimization for solving pricing subproblems. Numerical results on a real-case transportation planning problems how that the hybrid scheme accelerates the convergence of column generation both in terms of number of iterations and computational time. The integer solutions generated at the end of the process can also be improved for a significant proportion of instances, highlighting the potential of diversification of the approximation heuristic. The well-known column generation scheme is often an efficient approach for solving the linear relaxa "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
5 => Essec\Faculty\Model\Contribution {#2295
#_index: "academ_contributions"
#_id: "6145"
#_source: array:18 [
"id" => "6145"
"slug" => "6145-hybrid-column-generation-for-large-size-integer-programs"
"yearMonth" => "2013-07"
"year" => "2013"
"title" => "Hybrid Column Generation for Large-Size Integer Programs"
"description" => "ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2013). Hybrid Column Generation for Large-Size Integer Programs. Dans: 26th EURO – INFORMS Joint International Conference. ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2013). Hybrid Column Generation for Large-Size I "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "NAGIH A."
]
2 => array:1 [
"name" => "PLATEAU A."
]
3 => array:1 [
"name" => "SADKI J."
]
]
"ouvrage" => "26th EURO – INFORMS Joint International Conference"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
6 => Essec\Faculty\Model\Contribution {#2299
#_index: "academ_contributions"
#_id: "2037"
#_source: array:18 [
"id" => "2037"
"slug" => "2037-master-slave-strategy-and-polynomial-approximation"
"yearMonth" => "2000-09"
"year" => "2000"
"title" => "Master-slave Strategy and Polynomial Approximation"
"description" => "ALFANDARI, L. et PASCHOS, V. (2000). Master-slave Strategy and Polynomial Approximation. <i>Computational Optimization and Applications</i>, pp. 231-245. ALFANDARI, L. et PASCHOS, V. (2000). Master-slave Strategy and Polynomial Approximation. <i>Computat "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PASCHOS V."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2020-12-17 17:55:06"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "231-245"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "De nombreux problèmes de minimisation de coût consistent à couvrir les sommets ou les arêtes d'un graphe par des sous-graphes vérifiant une certaine propriété. Si le nombre de sous-graphes candidats est une fonction polynomiale de la taille du graphe, l'heuristique gloutonne classique pour le Set Covering, analysée par Chvatal, permet d'approcher l'optimum à rapport logarithmique. Nous étendons ce résultat à des problèmes où le nombre de sous-graphes peut être exponentiel, en utilisant une technique dite "maître-esclave". Les applications concernent des problèmes de télécommunication, de localisation et de conception de circuits électroniques. De nombreux problèmes de minimisation de coût consistent à couvrir les sommets ou les arêtes d'un gr "
"en" => "Many minimization problems consist in covering vertices or edges of a graph by subgraphs verifying a given property. If the number of candidate subgraphs is a polynomial function depending on the size of the graph, then the classical greedy heuristic for Set Covering, analysed by Chvatal, guarantees a polynomial approximation within a logarithmic ratio. We extend this result to a class of problems with a possible exponential number of subgraphs, by revisiting a technique called "master-slave". Applications are studied for telecommunication, optimal location and VLSI-design. Many minimization problems consist in covering vertices or edges of a graph by subgraphs verifying a "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
7 => Essec\Faculty\Model\Contribution {#2302
#_index: "academ_contributions"
#_id: "6422"
#_source: array:18 [
"id" => "6422"
"slug" => "6422-le-probleme-de-team-orienteering-avec-contraintes-de-diversite-entre-les-tours-une-approche-de-branch-and-price-and-cut 6422-le-probleme-de-team-orienteering-avec-contraintes-de-diversite-entre-les-tours-une-approche-de- "
"yearMonth" => "2019-02"
"year" => "2019"
"title" => """
Le problème de Team Orienteering avec contraintes de diversité entre les tours :\n
Une approche de Branch-and-Price-and-Cut
"""
"description" => """
ALFANDARI, L. et ALFANDARI, L. (2019). Le problème de Team Orienteering avec contraintes de diversité entre les tours :\n ALFANDARI, L. et ALFANDARI, L. (2019). Le problème de Team Orienteering avec contraintes de diversit
Une approche de Branch-and-Price-and-Cut. Dans: ROADEF 2019.
"""
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "ROADEF 2019"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
8 => Essec\Faculty\Model\Contribution {#2303
#_index: "academ_contributions"
#_id: "6567"
#_source: array:18 [
"id" => "6567"
"slug" => "6567-localisation-de-hubs-avec-fonction-de-cout-discrete"
"yearMonth" => "2015-02"
"year" => "2015"
"title" => "Localisation de hubs avec fonction de coût discrète"
"description" => "ALFANDARI, L. et KESHVARI-FARD, M. (2015). Localisation de hubs avec fonction de coût discrète. Dans: ROADEF February Conference. ALFANDARI, L. et KESHVARI-FARD, M. (2015). Localisation de hubs avec fonction de coût discrète. Dans "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "KESHVARI-FARD M."
]
]
"ouvrage" => "ROADEF February Conference"
"keywords" => []
"updatedAt" => "2023-09-28 16:42:04"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
9 => Essec\Faculty\Model\Contribution {#2304
#_index: "academ_contributions"
#_id: "2167"
#_source: array:18 [
"id" => "2167"
"slug" => "2167-optimizing-healthcare-network-design-under-reference-pricing-and-parameter-uncertainty"
"yearMonth" => "2017-12"
"year" => "2017"
"title" => "Optimizing Healthcare Network Design Under Reference Pricing and Parameter Uncertainty"
"description" => "DENOYEL, V., ALFANDARI, L. et THIELE, A. (2017). Optimizing Healthcare Network Design Under Reference Pricing and Parameter Uncertainty. <i>European Journal of Operational Research</i>, 263(3), pp. 996-1006. DENOYEL, V., ALFANDARI, L. et THIELE, A. (2017). Optimizing Healthcare Network Design Under Referenc "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "DENOYEL V."
]
2 => array:1 [
"name" => "THIELE A."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "OR in health services"
2 => "Robust optimization"
3 => "Choice models"
4 => "Fractional optimization"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221717305143"
"publicationInfo" => array:3 [
"pages" => "996-1006"
"volume" => "263"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Healthcare payers are exploring cost-containing policies to steer patients, through qualified information and financial incentives, towards providers offering the best value. With Reference Pricing (RP), a payer determines a maximum amount paid for a procedure, and patients selecting a provider charging more pay the difference. In a Tiered Network (TN), providers are stratified according to criteria such as quality and cost, each tier having a different out-of-pocket price. Motivated by a program recently implemented in California, we design an optimization model for payers combining both RP and TN, filling the gap of quantitative research on these novel payment policies. The main decision is to select which providers to exempt from RP, whose patients will face no out-of-pocket costs. Patients’ choice of a provider is modeled with a Multinomial Logit model. The objective is to minimize the payer’s cost, while constraints provide decision makers with levers for a trade-off between cost reduction and providers quality. We build a robust counterpart of our model to account for parameter uncertainty. Numerical experiments provide insights into how tiers are scattered on a price/quality plane. We argue that this system has strong potential in terms of costs reduction, quality increase for patients and visibility for high-value providers. Healthcare payers are exploring cost-containing policies to steer patients, through qualified inform "
"en" => "Healthcare payers are exploring cost-containing policies to steer patients, through qualified information and financial incentives, towards providers offering the best value. With Reference Pricing (RP), a payer determines a maximum amount paid for a procedure, and patients selecting a provider charging more pay the difference. In a Tiered Network (TN), providers are stratified according to criteria such as quality and cost, each tier having a different out-of-pocket price. Motivated by a program recently implemented in California, we design an optimization model for payers combining both RP and TN, filling the gap of quantitative research on these novel payment policies. The main decision is to select which providers to exempt from RP, whose patients will face no out-of-pocket costs. Patients’ choice of a provider is modeled with a Multinomial Logit model. The objective is to minimize the payer’s cost, while constraints provide decision makers with levers for a trade-off between cost reduction and providers quality. We build a robust counterpart of our model to account for parameter uncertainty. Numerical experiments provide insights into how tiers are scattered on a price/quality plane. We argue that this system has strong potential in terms of costs reduction, quality increase for patients and visibility for high-value providers. Healthcare payers are exploring cost-containing policies to steer patients, through qualified inform "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
10 => Essec\Faculty\Model\Contribution {#2305
#_index: "academ_contributions"
#_id: "2455"
#_source: array:18 [
"id" => "2455"
"slug" => "2455-robust-location-of-new-housing-developments-using-a-choice-model"
"yearMonth" => "2018-01"
"year" => "2018"
"title" => "Robust Location of New Housing Developments Using a Choice Model"
"description" => "ESPINOZA GARCIA, J.C. et ALFANDARI, L. (2018). Robust Location of New Housing Developments Using a Choice Model. <i>Annals of Operations Research</i>, 271, pp. 527–550. ESPINOZA GARCIA, J.C. et ALFANDARI, L. (2018). Robust Location of New Housing Developments Using a C "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ESPINOZA GARCIA J. C."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Localisation"
1 => "Logement"
2 => "MNL"
3 => "Modèles de choix"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "http://dx.doi.org/10.2139/ssrn.2692635"
"publicationInfo" => array:3 [
"pages" => "527–550"
"volume" => "271"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "On propose un modèle d'optimisation en variables 0-1 pour la localisation de programmes de nouveaux logements basée sur un modèle de choix du consommateur de type MNL. On considère des données incertaines sur les consommateurs, à la fois sur les volumes de demande, et sur leurs préférences (utilités), conduisant à une approche d'optimisation robuste. On propose un modèle d'optimisation en variables 0-1 pour la localisation de programmes de nouveaux "
"en" => "We propose an optimization model with 0-1 variables for the location of new housing developments based on an MNL choice model for consumer preferences. We propose a robust optimization approach, when uncertainty lies on demand volumes or preferences. We propose an optimization model with 0-1 variables for the location of new housing developments bas "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
11 => Essec\Faculty\Model\Contribution {#2306
#_index: "academ_contributions"
#_id: "2456"
#_source: array:18 [
"id" => "2456"
"slug" => "2456-robust-optimization-for-non-linear-impact-of-data-variation"
"yearMonth" => "2018-11"
"year" => "2018"
"title" => "Robust Optimization for Non-Linear Impact of Data Variation"
"description" => "ALFANDARI, L. et ESPINOZA GARCIA, J.C. (2018). Robust Optimization for Non-Linear Impact of Data Variation. <i>Computers & Operations Research</i>, 99, pp. 38-47. ALFANDARI, L. et ESPINOZA GARCIA, J.C. (2018). Robust Optimization for Non-Linear Impact of Data Var "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ESPINOZA GARCIA J.-C."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Dualité"
1 => "Incertitude"
2 => "Optimisation robuste"
3 => "Programmation linéaire"
4 => "Programmation non linéaire"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2018.06.011"
"publicationInfo" => array:3 [
"pages" => "38-47"
"volume" => "99"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "On propose une approche robuste pour résoudre des programmes linéaires dont les coefficients varient non linéairement en fonction de données incertaines, comme la VNP en fonction du taux d'actualisation en finance. On propose une approximation binaire, puis linéaire par morceaux, des fonctions non linéaires. Dans le deuxième cas, les tests montrent que la solution robuste reste réalisable sur plus de 6000 instances de divers problèmes incluant le Capital Budgeting, malgré l'approximation des fonctions non linéaires. On propose une approche robuste pour résoudre des programmes linéaires dont les coefficients varient "
"en" => "We propose a robust approach for solving Linear Programs the coefficients of which depend on uncertain data in a non-linear way, like NPVs with the discount rate in finance. We propose first a binary approximation of the non-linear functions, then a piece-wise linear approximation. In the second case, numerical experiments show that the robust solution remains feasible for more than 6000 instances of problems tested, including Capital Budgeting, despite the approximation of the non-linear functions. We propose a robust approach for solving Linear Programs the coefficients of which depend on uncerta "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
12 => Essec\Faculty\Model\Contribution {#2307
#_index: "academ_contributions"
#_id: "2500"
#_source: array:18 [
"id" => "2500"
"slug" => "2500-solving-electricity-production-planning-by-column-generation"
"yearMonth" => "2013-12"
"year" => "2013"
"title" => "Solving Electricity Production Planning By Column Generation"
"description" => "ROZENKNOP, A., WOFLER, C., ALFANDARI, L., CHEMLA, D. et LETOCART, L. (2013). Solving Electricity Production Planning By Column Generation. <i>Journal of Scheduling</i>, 16(6), pp. 585-604. ROZENKNOP, A., WOFLER, C., ALFANDARI, L., CHEMLA, D. et LETOCART, L. (2013). Solving Electricity Pro "
"authors" => array:5 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ROZENKNOP A."
]
2 => array:1 [
"name" => "WOFLER C."
]
3 => array:1 [
"name" => "CHEMLA D."
]
4 => array:1 [
"name" => "LETOCART L."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://hal.archives-ouvertes.fr/hal-00728066"
"publicationInfo" => array:3 [
"pages" => "585-604"
"volume" => "16"
"number" => "6"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This paper presents a heuristic method based on column generation for the EDF (Electricité De France) longterm electricity production planning problem proposed as subject of the ROADEF/EURO 2010 Challenge. This is to our knowledge the first-ranked method among those methods based on mathematical programming, and was ranked fourth overall. This paper presents a heuristic method based on column generation for the EDF (Electricité De France "
"en" => "This paper presents a heuristic method based on column generation for the EDF (Electricité De France) longterm electricity production planning problem proposed as subject of the ROADEF/EURO 2010 Challenge. This is to our knowledge the first-ranked method among those methods based on mathematical programming, and was ranked fourth overall. This paper presents a heuristic method based on column generation for the EDF (Electricité De France "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
13 => Essec\Faculty\Model\Contribution {#2308
#_index: "academ_contributions"
#_id: "7085"
#_source: array:18 [
"id" => "7085"
"slug" => "7085-robust-facility-location-optimization-with-location-dependent-demands"
"yearMonth" => "2014-09"
"year" => "2014"
"title" => "Robust Facility Location Optimization with Location-dependent Demands"
"description" => "ESPINOZA, I.C. et ALFANDARI, L. (2014). Robust Facility Location Optimization with Location-dependent Demands. Dans: 2014 INFORMS Annual Meeting. ESPINOZA, I.C. et ALFANDARI, L. (2014). Robust Facility Location Optimization with Location-dependen "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ESPINOZA I. C."
]
]
"ouvrage" => "2014 INFORMS Annual Meeting"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
14 => Essec\Faculty\Model\Contribution {#2309
#_index: "academ_contributions"
#_id: "7086"
#_source: array:18 [
"id" => "7086"
"slug" => "7086-robust-in-network-selection-of-hospitals-by-healthcare-under-reference-pricing"
"yearMonth" => "2015-07"
"year" => "2015"
"title" => "Robust in Network Selection of Hospitals by Healthcare Under Reference Pricing"
"description" => "ALFANDARI, L., DENOYEL, V. et THIELE, A. (2015). Robust in Network Selection of Hospitals by Healthcare Under Reference Pricing. Dans: EURO 2015 12 July 2015 Conference. ALFANDARI, L., DENOYEL, V. et THIELE, A. (2015). Robust in Network Selection of Hospitals by Healthc "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "DENOYEL V."
]
2 => array:1 [
"name" => "THIELE A."
]
]
"ouvrage" => "EURO 2015 12 July 2015 Conference"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
15 => Essec\Faculty\Model\Contribution {#2310
#_index: "academ_contributions"
#_id: "7093"
#_source: array:18 [
"id" => "7093"
"slug" => "7093-robust-optimization-for-non-linear-impact-of-data-variation"
"yearMonth" => "2018-06"
"year" => "2018"
"title" => "Robust Optimization for Non-Linear Impact of Data Variation"
"description" => "ALFANDARI, L. (2018). Robust Optimization for Non-Linear Impact of Data Variation. Dans: Workshop on Robust Optimization Avignon (RO 2018). ALFANDARI, L. (2018). Robust Optimization for Non-Linear Impact of Data Variation. Dans: Workshop on "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "Workshop on Robust Optimization Avignon (RO 2018)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
16 => Essec\Faculty\Model\Contribution {#2311
#_index: "academ_contributions"
#_id: "7094"
#_source: array:18 [
"id" => "7094"
"slug" => "7094-robust-optimization-for-non-linear-impact-of-data-variation"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "Robust optimization for non-linear impact of data variation"
"description" => "ALFANDARI, L. et ESPINOZA-GARCIA, J.C. (2019). Robust optimization for non-linear impact of data variation. Dans: 30th European Conference on Operational Research (EURO 2019). Dublin. ALFANDARI, L. et ESPINOZA-GARCIA, J.C. (2019). Robust optimization for non-linear impact of data var "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ESPINOZA-GARCIA J.C."
]
]
"ouvrage" => "30th European Conference on Operational Research (EURO 2019)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
17 => Essec\Faculty\Model\Contribution {#2312
#_index: "academ_contributions"
#_id: "7108"
#_source: array:18 [
"id" => "7108"
"slug" => "7108-schema-hybride-de-generation-de-colonnes-pour-un-probleme-de-planification-de-production-agricole 7108-schema-hybride-de-generation-de-colonnes-pour-un-probleme-de-planification-de-production-agrico "
"yearMonth" => "2011-03"
"year" => "2011"
"title" => "Schéma hybride de génération de colonnes pour un problème de planification de production agricole"
"description" => "ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2011). Schéma hybride de génération de colonnes pour un problème de planification de production agricole. Dans: ROADEF 2011. ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2011). Schéma hybride de génération de colonnes "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "NAGIH A."
]
2 => array:1 [
"name" => "PLATEAU A."
]
3 => array:1 [
"name" => "SADKI J."
]
]
"ouvrage" => "ROADEF 2011"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
18 => Essec\Faculty\Model\Contribution {#2313
#_index: "academ_contributions"
#_id: "2662"
#_source: array:18 [
"id" => "2662"
"slug" => "2662-the-greedy-approach-for-the-crew-pairing-problem-some-cases-of-polynomial-subproblems"
"yearMonth" => "1999-01"
"year" => "1999"
"title" => "The Greedy Approach for the Crew Pairing Problem: Some Cases of Polynomial Subproblems"
"description" => "ALFANDARI, L. (1999). The Greedy Approach for the Crew Pairing Problem: Some Cases of Polynomial Subproblems. <i>Cahiers du Lamsade (Laboratoire d'Analyse et de Modélisation de Systèmes d'Aide)</i>, pp. 1-10. ALFANDARI, L. (1999). The Greedy Approach for the Crew Pairing Problem: Some Cases of Polynomial Sub "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:30:59"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "1-10"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Le problème de Crew Pairing dans le transport aérien consiste à construire des rotations d'équipages (pilotes et personnel de cabine) couvrant l'ensemble des vols de la compagnie et minimisant, par exemple, la somme globale des temps de pause entre deux vols. Ce problème d'optimisation sous contraintes peut se modéliser comme un programme linéaire en nombres entiers de très grande taille, et se résoud classiquement par des techniques dites de "génération de colonnes ". Nous formalisons quelques cas pour lesquels le sous-problème associé à l'approche gloutonne est soluble en temps polynomial. Le problème de Crew Pairing dans le transport aérien consiste à construire des rotations d'équipages "
"en" => "The Crew Pairing Problem in air transportation consists in assigning pilots, stewarts and hostesses to sequences of flights so that every flight of the company is covered by a crew, and the total sum of rest periods is minimized.This optimization problem can be modelled as a very large-scale integer 0-1 linear program. It can be solved by specialized techniques for set covering problems, called "column generation". We define some classes of problems where the sub-problem associated with the greedy approach is solvable in polynomial time. The Crew Pairing Problem in air transportation consists in assigning pilots, stewarts and hostesses "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
19 => Essec\Faculty\Model\Contribution {#2314
#_index: "academ_contributions"
#_id: "2690"
#_source: array:18 [
"id" => "2690"
"slug" => "2690-the-multicommodity-ring-location-routing-problem"
"yearMonth" => "2016-05"
"year" => "2016"
"title" => "The Multicommodity-Ring Location Routing Problem"
"description" => "GIANESSI, P., ALFANDARI, L., LÉTOCART, L. et CALVO, R.F. (2016). The Multicommodity-Ring Location Routing Problem. <i>Transportation Science</i>, 50(2), pp. 541-558. GIANESSI, P., ALFANDARI, L., LÉTOCART, L. et CALVO, R.F. (2016). The Multicommodity-Ring Location Ro "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "GIANESSI P."
]
2 => array:1 [
"name" => "LÉTOCART L."
]
3 => array:1 [
"name" => "CALVO R. F."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://www.researchgate.net/publication/282413674_The_Multicommodity-Ring_Location_Routing_Problem"
"publicationInfo" => array:3 [
"pages" => "541-558"
"volume" => "50"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The multicommodity-ring location routing problem (MRLRP) studied in this paper is an NP-hard minimization problem arising in city logistics. The aim is to locate a set of urban distribution centers (UDCs) and to connect them via a ring in which massive flows of goods will circulate. Goods are transported from gates located outside the city to a UDC, and either join a second UDC through the ring before being delivered in electric vans to the final customers or are delivered directly to the customers from the first UDC. The reverse trip with pickup and transportation to the gates is also possible. A delivery service path starts at a particular UDC, then visits a subset of customers and ends at the same UDC, another UDC, or a self-service parking lot (SPL). A pickup route can start from an SPL or a UDC and ends at a UDC. The objective is to minimize the sum of the installation costs of the ring, flow transportation costs, and routing costs. The MRLRP belongs to the class of location-routing problems (LRP). We model it with a set-partitioning-like representation of delivery and pickup trips and arc-flow elements to describe goods transportation in the ring and between the ring and the gates. We present three approaches to solving the MRLRP: an exact method for small-size instances, a matheuristic for instances of a larger size, and a hybrid approach that applies the exact method to the columns output by the matheuristic. Numerical results are provided for an exhaustive set of instances, obtained by extending benchmark instances of the capacitated LRP with additional MRLRP features. The multicommodity-ring location routing problem (MRLRP) studied in this paper is an NP-hard minimiz "
"en" => "The multicommodity-ring location routing problem (MRLRP) studied in this paper is an NP-hard minimization problem arising in city logistics. The aim is to locate a set of urban distribution centers (UDCs) and to connect them via a ring in which massive flows of goods will circulate. Goods are transported from gates located outside the city to a UDC, and either join a second UDC through the ring before being delivered in electric vans to the final customers or are delivered directly to the customers from the first UDC. The reverse trip with pickup and transportation to the gates is also possible. A delivery service path starts at a particular UDC, then visits a subset of customers and ends at the same UDC, another UDC, or a self-service parking lot (SPL). A pickup route can start from an SPL or a UDC and ends at a UDC. The objective is to minimize the sum of the installation costs of the ring, flow transportation costs, and routing costs. The MRLRP belongs to the class of location-routing problems (LRP). We model it with a set-partitioning-like representation of delivery and pickup trips and arc-flow elements to describe goods transportation in the ring and between the ring and the gates. We present three approaches to solving the MRLRP: an exact method for small-size instances, a matheuristic for instances of a larger size, and a hybrid approach that applies the exact method to the columns output by the matheuristic. Numerical results are provided for an exhaustive set of instances, obtained by extending benchmark instances of the capacitated LRP with additional MRLRP features. The multicommodity-ring location routing problem (MRLRP) studied in this paper is an NP-hard minimiz "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
20 => Essec\Faculty\Model\Contribution {#2315
#_index: "academ_contributions"
#_id: "2746"
#_source: array:18 [
"id" => "2746"
"slug" => "2746-tighter-mip-models-for-barge-container-ship-routing"
"yearMonth" => "2019-01"
"year" => "2019"
"title" => "Tighter MIP models for Barge Container Ship Routing"
"description" => "ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2019). Tighter MIP models for Barge Container Ship Routing. <i>Omega</i>, 82, pp. 38-54. ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2019). Tighter MIP mo "
"authors" => array:6 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DAVIDOVIC Tatjana"
]
3 => array:1 [
"name" => "FURINI Fabio"
]
4 => array:1 [
"name" => "MARAS Vladislav"
]
5 => array:1 [
"name" => "MARTIN Sébastien"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Containers"
1 => "Programmation linéaire"
2 => "Repositionnement"
3 => "Routage"
4 => "Transport"
]
"updatedAt" => "2022-10-10 15:01:07"
"publicationUrl" => "https://doi.org/10.1016/j.omega.2017.12.002"
"publicationInfo" => array:3 [
"pages" => "38-54"
"volume" => "82"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "On considère la conception d'une ligne de transport fluvial devant décider à quels ports s'arrêter pour transporter des demandes de containers entre ports. Les nouveaux modèles proposés surpassent les modèles existants de la littérature. Ils exploitent la structure en ligne du routage en modélisant ce dernier par des variables associées aux noeuds (ports), et intègrent des variables associées soit aux arcs soit aux noeuds du réseau de transport pour le repositionnement des containers vides. Ce dernier modèle est le plus performant, particulièrement dans le cas de demandes non sécables. On considère la conception d'une ligne de transport fluvial devant décider à quels ports s'arrêter p "
"en" => "We consider Barge Container Ship Routing with empty container repositioning. We design new MIP formulations that outperfom state-of-the-art models. The new models exploit the line structure of inland waterway transportation by modeling routing with node variables, and consider either node or arc variables for empty containers. The second formulation reveals to be the most efficient one, especially for unsplittable demands. We also optimize the turnaround time or size of the fleet. We consider Barge Container Ship Routing with empty container repositioning. We design new MIP formu "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
21 => Essec\Faculty\Model\Contribution {#2316
#_index: "academ_contributions"
#_id: "7535"
#_source: array:18 [
"id" => "7535"
"slug" => "7535-un-algorithme-de-branch%e2%80%90and%e2%80%90price-pour-le-probleme-de-planification-durable-de-rotations-culturales 7535-un-algorithme-de-branch%e2%80%90and%e2%80%90price-pour-le-probleme-de-planification-durable-de- "
"yearMonth" => "2013-02"
"year" => "2013"
"title" => "Un algorithme de Branch‐and‐Price pour le problème de planification durable de rotations culturales"
"description" => "ALFANDARI, L. (2013). Un algorithme de Branch‐and‐Price pour le problème de planification durable de rotations culturales. Dans: 14ème Conférence ROADEF 2013. ALFANDARI, L. (2013). Un algorithme de Branch‐and‐Price pour le problème de planification durable de "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "14ème Conférence ROADEF 2013"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
22 => Essec\Faculty\Model\Contribution {#2317
#_index: "academ_contributions"
#_id: "8299"
#_source: array:18 [
"id" => "8299"
"slug" => "8299-onlast-mile-delivery-with-autonomous-robots"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "Onlast-mile Delivery with Autonomous Robots"
"description" => "ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2019). <i>Onlast-mile Delivery with Autonomous Robots</i>. ESSEC Business School. ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2019). <i>Onlast-mile Delivery with Autonomous Ro "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DE MELO DA SILVA M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
23 => Essec\Faculty\Model\Contribution {#2318
#_index: "academ_contributions"
#_id: "3372"
#_source: array:18 [
"id" => "3372"
"slug" => "3372-a-path-relinking-algorithm-for-the-generalized-assignment-problem"
"yearMonth" => "2004-01"
"year" => "2004"
"title" => "A Path Relinking Algorithm for the Generalized Assignment Problem"
"description" => "ALFANDARI, L., PLATEAU, A. et TOLLA, P. (2004). A Path Relinking Algorithm for the Generalized Assignment Problem. Dans: <i>Metaheuristics Computer Decision-making</i>. 1st ed. Kluwer Academic Publishers, pp. 1-17. ALFANDARI, L., PLATEAU, A. et TOLLA, P. (2004). A Path Relinking Algorithm for the Generalized Assig "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PLATEAU A."
]
2 => array:1 [
"name" => "TOLLA P."
]
]
"ouvrage" => "Metaheuristics Computer Decision-making"
"keywords" => []
"updatedAt" => "2021-09-06 14:06:32"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "1-17"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The Generalized Assignment Problem (GAP) consists in finding a maximum-profit assignment of tasks to agents with capacity constraints. In this paper, a path relinking heuristic is proposed for the GAP. The main feature of our path relinking is that both feasible and infeasible solutions are inserted in the reference set of elite solutions, trade-off between feasibility and infeasibility being ruled through a penalty coefficient for infeasibility. Since exploration of the solution space is very sensitive to this penalty coefficient, the coefficient is dynamically updated at each round of combinations so that a balance is kept between feasible and infeasible solutions in the reference set. Numerical experiments reported on classical testbed instances of the OR-library show that the algorithm compares favorably to several other methods in the literature. In particular, more than 95% of the instances in the test-file were solved to optimality with short computation time. The Generalized Assignment Problem (GAP) consists in finding a maximum-profit assignment of tasks to "
"en" => "Le problème d'affectation généralisée consiste à affecter un ensemble de tâches à un ensemble d'agents ayant des capacités limitées, de façon à optimiser le profit généré. Dans cet article, nous proposons une heuristique de recomposition de chemins pour ce problème. La caractéristique principale de notre algorithme est que l'ensemble de référence est composé de solutions à la fois réalisables et non réalisables, le coefficient de pénalité associé à la violation des capacités des agents étant continuellement recalculé au cours de l'exécution de l'algorithme de façon à maintenir un seuil d'équilibre entre solutions réalisables et non réalisables dans la population. Des expériences numériques menées sur des instances classiques de la bibliothèque OR-library montrent que l'algorithme surclasse plusieurs autres méthodes existantes sur ces instances. En particulier, l'optimum a été trouvé en un temps de calcul limité pour plus de 95% des instances du fichier-test. Le problème d'affectation généralisée consiste à affecter un ensemble de tâches à un ensemble d'agen "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
24 => Essec\Faculty\Model\Contribution {#2319
#_index: "academ_contributions"
#_id: "3523"
#_source: array:18 [
"id" => "3523"
"slug" => "3523-decision-et-complexite-le-cas-de-la-planification-optimalede-tout-simplisme"
"yearMonth" => "2018-01"
"year" => "2018"
"title" => """
Décision et complexité : le cas de la planification optimale\n
de tout simplisme
"""
"description" => """
ALFANDARI, L. (2018). Décision et complexité : le cas de la planification optimale\n
de tout simplisme. Dans: <i>Complexité et organisations : faire face aux défis de demain</i>. 1st ed. Eyrolles, pp. 229-242. de tout simplisme. Dans: <i>Complexité et organisations : faire face aux défis de demain</i>. 1st ed
"""
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "Complexité et organisations : faire face aux défis de demain"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "229-242"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
25 => Essec\Faculty\Model\Contribution {#2320
#_index: "academ_contributions"
#_id: "9893"
#_source: array:18 [
"id" => "9893"
"slug" => "9893-a-two-phase-path-relinking-algorithm-for-the-generalized-assignment-problem"
"yearMonth" => "2001-01"
"year" => "2001"
"title" => "A two-phase Path Relinking algorithm for the Generalized Assignment Problem"
"description" => "ALFANDARI, L. et PLATEAU, A. (2001). <i>A two-phase Path Relinking algorithm for the Generalized Assignment Problem</i>. ALFANDARI, L. et PLATEAU, A. (2001). <i>A two-phase Path Relinking algorithm for the Generalized Ass "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PLATEAU A."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:22"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
26 => Essec\Faculty\Model\Contribution {#2321
#_index: "academ_contributions"
#_id: "9916"
#_source: array:18 [
"id" => "9916"
"slug" => "9916-the-minimum-bounded-diameter-spanning-forest-problem-is-log-approximable"
"yearMonth" => "2001-01"
"year" => "2001"
"title" => "The Minimum Bounded-Diameter Spanning Forest Problem Is Log-Approximable"
"description" => "ALFANDARI, L. (2001). The Minimum Bounded-Diameter Spanning Forest Problem Is Log-Approximable. <i>Foundations of Computing and Decision Sciences</i>, pp. 123-132. ALFANDARI, L. (2001). The Minimum Bounded-Diameter Spanning Forest Problem Is Log-Approximable. <i>F "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2020-12-17 18:37:46"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "123-132"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
27 => Essec\Faculty\Model\Contribution {#2322
#_index: "academ_contributions"
#_id: "4052"
#_source: array:18 [
"id" => "4052"
"slug" => "4052-optimisation-de-la-construction-de-rotations-dequipages-en-transport-aerien"
"yearMonth" => "2006-01"
"year" => "2006"
"title" => "Optimisation de la construction de rotations d'équipages en transport aérien"
"description" => "ALFANDARI, L. et NAGIH, A. (2006). Optimisation de la construction de rotations d'équipages en transport aérien. Dans: <i>Optimisation combinatoire 3. Applications (traité IC2)</i>. 1st ed. Hermès Sciences, Lavoisier, pp. 23-45. ALFANDARI, L. et NAGIH, A. (2006). Optimisation de la construction de rotations d'équipages en trans "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "NAGIH A."
]
]
"ouvrage" => "Optimisation combinatoire 3. Applications (traité IC2)"
"keywords" => array:4 [
0 => "Méthodes de génération de colonnes"
1 => "Optimisation combinatoire"
2 => "Programme mathématique"
3 => "Transport"
]
"updatedAt" => "2021-09-06 14:06:32"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "23-45"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Ce chapitre propose un aperçu de modèles et méthodes de résolution pour le problème de construction de rotations d'équipages à moindre coût dans le transport aérien. Nous présentons le modèle générique de type multi-flot, le principe général de résolution par génération de colonnes puis quelques options de résolution du sous-problème associé (plus court chemin contraint). Ce chapitre propose un aperçu de modèles et méthodes de résolution pour le problème de construction "
"en" => "This chapter provides a view of models and methods for the minimum-cost Crew Pairing problem in air transportation. We present the generic multi-commodity flow model, the general column generation scheme for solving the problem as well as several options for solving the shortest path sub-problem associated with the master problem. This chapter provides a view of models and methods for the minimum-cost Crew Pairing problem in air "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
28 => Essec\Faculty\Model\Contribution {#2323
#_index: "academ_contributions"
#_id: "522"
#_source: array:18 [
"id" => "522"
"slug" => "522-a-branch-and-price-and-cut-approach-for-sustainable-crop-rotation-planning"
"yearMonth" => "2015-03"
"year" => "2015"
"title" => "A Branch-and-Price-and-Cut Approach for Sustainable Crop Rotation Planning"
"description" => "ALFANDARI, L., PLATEAU, A. et SCHEPLER, X. (2015). A Branch-and-Price-and-Cut Approach for Sustainable Crop Rotation Planning. <i>European Journal of Operational Research</i>, 241(3), pp. 872-879. ALFANDARI, L., PLATEAU, A. et SCHEPLER, X. (2015). A Branch-and-Price-and-Cut Approach for Sustainab "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PLATEAU A."
]
2 => array:1 [
"name" => "SCHEPLER X."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Agriculture"
1 => "Branch-and-Price"
2 => "Génération de colonnes"
3 => "Optimisation"
4 => "Planification de production"
]
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221714008558"
"publicationInfo" => array:3 [
"pages" => "872-879"
"volume" => "241"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Nous étudions un problème de planification optimale des rotations culturales en agriculture, où l'objectif est de minimiser la surface totale utilisée, sous contraintes de satisfaire des demandes de cultures à chaque période. Nous proposons une formulation compacte de type Programmation Linéaire en variables 0-1, puis une formulation étendue. Une approche de Branch-and-Price-and-Cut est proposée pour sa résolution, avec un problème de pricing polynomial, des règles de branchement et des coupes adaptées au problème. Les expériences numériques montrent l'efficacité de la méthode. Nous étudions un problème de planification optimale des rotations culturales en agriculture, où l'ob "
"en" => "We study a multi-periodic production planning problem in agriculture, which is to plan crop rotations over a set of land plots and a given time horizon. The total surface area used for production is minimized while satisfying crop demands every period. We propose a 0-1 linear programming compact formulation based on crop-sequence graphs, and an extended formulation. A Branch-and-Price-and Cut method is proposed, with a polynomial pricing problem, adapted branching rules and cutting planes. Numerical experiments show the effectiveness of the BPC. We study a multi-periodic production planning problem in agriculture, which is to plan crop rotation "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
29 => Essec\Faculty\Model\Contribution {#2324
#_index: "academ_contributions"
#_id: "523"
#_source: array:18 [
"id" => "523"
"slug" => "523-a-column-generation-based-heuristic-for-the-multicommodity-ring-vehicle-routing-problem"
"yearMonth" => "2016-06"
"year" => "2016"
"title" => "A Column Generation Based Heuristic for the Multicommodity-Ring Vehicle Routing Problem"
"description" => "GIANESSIA, P., ALFANDARI, L., LETOCART, L. et WOLFLER CALVOA, R. (2016). A Column Generation Based Heuristic for the Multicommodity-Ring Vehicle Routing Problem. <i>Transportation Research Procedia</i>, 12, pp. 227-238. GIANESSIA, P., ALFANDARI, L., LETOCART, L. et WOLFLER CALVOA, R. (2016). A Column Generation Based H "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "GIANESSIA P."
]
2 => array:1 [
"name" => "LETOCART L."
]
3 => array:1 [
"name" => "WOLFLER CALVOA R."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Single-Tier Freight Distribution Systems"
1 => "Two-Echelon Vehicle Routing Problems"
2 => "Column Generation"
3 => "Heuristic Algorithms"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S2352146516000624"
"publicationInfo" => array:3 [
"pages" => "227-238"
"volume" => "12"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study a new routing problem arising in City Logistics. Given a ring connecting a set of urban distribution centers (UDCs) in the outskirts of a city, the problem consists in delivering goods from virtual gates located outside the city to the customers inside of it. Goods are transported from a gate to a UDC, then either go to another UDC before being delivered to customers or are directly shipped from the first UDC. The reverse process occurs for pick-up. Routes are performed by electric vans and may be open. The objective is to find a set of routes that visit each customer and to determine ring and gates-UDC flows so that the total transportation and routing cost is minimized. We solve this problem using a column generation-based heuristic, which is tested over a set of benchmark instances issued from a more strategic location-routing problem. We study a new routing problem arising in City Logistics. Given a ring connecting a set of urban dis "
"en" => "We study a new routing problem arising in City Logistics. Given a ring connecting a set of urban distribution centers (UDCs) in the outskirts of a city, the problem consists in delivering goods from virtual gates located outside the city to the customers inside of it. Goods are transported from a gate to a UDC, then either go to another UDC before being delivered to customers or are directly shipped from the first UDC. The reverse process occurs for pick-up. Routes are performed by electric vans and may be open. The objective is to find a set of routes that visit each customer and to determine ring and gates-UDC flows so that the total transportation and routing cost is minimized. We solve this problem using a column generation-based heuristic, which is tested over a set of benchmark instances issued from a more strategic location-routing problem. We study a new routing problem arising in City Logistics. Given a ring connecting a set of urban dis "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
30 => Essec\Faculty\Model\Contribution {#2325
#_index: "academ_contributions"
#_id: "552"
#_source: array:18 [
"id" => "552"
"slug" => "552-a-mip-flow-model-for-crop-rotation-planning-in-a-context-of-forest-sustainable-development"
"yearMonth" => "2011-10"
"year" => "2011"
"title" => "A MIP Flow Model for Crop-Rotation Planning in a Context of Forest Sustainable Development"
"description" => "ALFANDARI, L., LEMALADE, J.L., NAGIH, A. et PLATEAU, G. (2011). A MIP Flow Model for Crop-Rotation Planning in a Context of Forest Sustainable Development. <i>Annals of Operations Research</i>, 190(1), pp. 149-164. ALFANDARI, L., LEMALADE, J.L., NAGIH, A. et PLATEAU, G. (2011). A MIP Flow Model for Crop-Rotation P "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "LEMALADE J. L."
]
2 => array:1 [
"name" => "NAGIH A."
]
3 => array:1 [
"name" => "PLATEAU G."
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "Crop rotation planning"
1 => "Linear programming"
2 => "Sustainable development"
]
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://link.springer.com/article/10.1007/s10479-009-0553-0"
"publicationInfo" => array:3 [
"pages" => "149-164"
"volume" => "190"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Nous proposons un modèle de programmation linéaire en variables mixtes pour une classe de problèmes agricoles de planification des rotations culturales avec contraintes de couverture de besoins saisonniers et d'incompatibilité entre culture et jachère sur une même parcelle. Ce modèle est testé numériquement sur un cas d'étude malgache dans le cadre d'une campagne de développement durable des zones forestières. Nous proposons un modèle de programmation linéaire en variables mixtes pour une classe de problèmes "
"en" => "We propose a Mixed-Integer Linear Programming model for a class of multi-period crop rotation optimization problems with demand constraints and incompatibility constraints between cultivation and fallow state on a land plot. This model is applied to a case study on Madagascan farms in the scope of a sustainable development campaign against deforestation, where the objective is to better control agricultural space while covering seasonal needs of farmers. We propose an efficient upper bound computation and study the variation of the minimum number of plots and total space needed in function of the unitary surface area of a plot. Numerical results associated with the Madagascan case are reported. We propose a Mixed-Integer Linear Programming model for a class of multi-period crop rotation optimi "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
31 => Essec\Faculty\Model\Contribution {#2326
#_index: "academ_contributions"
#_id: "568"
#_source: array:18 [
"id" => "568"
"slug" => "568-a-note-on-the-clustered-set-covering-problem"
"yearMonth" => "2014-02"
"year" => "2014"
"title" => "A Note on the Clustered Set Covering Problem"
"description" => "ALFANDARI, L. et MONNOT, J. (2014). A Note on the Clustered Set Covering Problem. <i>Discrete Applied Mathematics</i>, 1(164), pp. 13-19. ALFANDARI, L. et MONNOT, J. (2014). A Note on the Clustered Set Covering Problem. <i>Discrete Applie "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "MONNOT J."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Integer programming"
1 => "Set covering"
2 => "Maximal coverage"
3 => "Approximation"
]
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0166218X11004847"
"publicationInfo" => array:3 [
"pages" => "13-19"
"volume" => "1"
"number" => "164"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Nous proposons une heuristique d'approximation pour une généralisation du problème classique de Set Covering avec partition des sous-ensembles en clusters induisant le paiement d'un coût fixe dès qu'un cluster est utilisé. Nous proposons une heuristique d'approximation pour une généralisation du problème classique de Set "
"en" => "We propose an approximation heuristic for a NP-hard clustered variant of the Set Covering Problem where subsets are partitionned into K clusters and a fixed cost is paid for selecting at least one subset in a cluster. We propose an approximation heuristic for a NP-hard clustered variant of the Set Covering Problem wh "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
32 => Essec\Faculty\Model\Contribution {#2327
#_index: "academ_contributions"
#_id: "1359"
#_source: array:18 [
"id" => "1359"
"slug" => "1359-improved-approximation-of-the-general-soft-capacitated-facility-location-problem"
"yearMonth" => "2007-01"
"year" => "2007"
"title" => "Improved Approximation of the General Soft-capacitated Facility Location Problem"
"description" => "ALFANDARI, L. (2007). Improved Approximation of the General Soft-capacitated Facility Location Problem. <i>RAIRO - Operations Research</i>, pp. 83-93. ALFANDARI, L. (2007). Improved Approximation of the General Soft-capacitated Facility Location Probl "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2020-12-17 17:55:06"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "83-93"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
33 => Essec\Faculty\Model\Contribution {#2328
#_index: "academ_contributions"
#_id: "665"
#_source: array:18 [
"id" => "665"
"slug" => "665-approximating-minimum-spanning-tree-of-depth-2"
"yearMonth" => "1999-06"
"year" => "1999"
"title" => "Approximating Minimum Spanning Tree of Depth 2"
"description" => "ALFANDARI, L. et PASCHOS, V. (1999). Approximating Minimum Spanning Tree of Depth 2. <i>International Transactions in Operational Research</i>, pp. 607-622. ALFANDARI, L. et PASCHOS, V. (1999). Approximating Minimum Spanning Tree of Depth 2. <i>Internationa "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PASCHOS V."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:30:00"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "607-622"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Parmi les problèmes d'optimisation dans des réseaux, le problème de l'arbre recouvrant de coût minimum de profondeur 2 possède de nombreuses applications, parmi lesquelles figure la localisation d'émetteurs d'une entreprise de télécommunications. Nous donnons pour ce problème NP-difficile une heuristique de résolution approchée, dont l'efficacité est validée d'un point de vue à la fois théorique et expérimental. L'algorithme exploite une forme de réduction originale avec le problème classique de Set Covering. Parmi les problèmes d'optimisation dans des réseaux, le problème de l'arbre recouvrant de coût minim "
"en" => "Among the Network-Design optimization problems, the minimum-cost spanning tree with depth 2 has several applications. For example, a Telecommunications company located in Paris must select a subset of cities where to build local transmitters so that every other city is connected to a transmitter and all transmitters are connected to Paris. We approximate this NP-hard problem by a greedy heuristic with worst-case performance guarantee and practical efficiency. The algorithm exploits some kind of original reduction with the well-known Set Covering problem. Among the Network-Design optimization problems, the minimum-cost spanning tree with depth 2 has seve "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
34 => Essec\Faculty\Model\Contribution {#2329
#_index: "academ_contributions"
#_id: "10954"
#_source: array:18 [
"id" => "10954"
"slug" => "10954-trade-offs-between-the-stepwise-cost-function-and-its-linear-approximation-for-the-modular-hub-location-problem 10954-trade-offs-between-the-stepwise-cost-function-and-its-linear-approximation-for-the-modular-hub "
"yearMonth" => "2019-04"
"year" => "2019"
"title" => "Trade-Offs Between the Stepwise Cost Function and Its Linear Approximation for the Modular Hub Location Problem Trade-Offs Between the Stepwise Cost Function and Its Linear Approximation for the Modular Hub Locat "
"description" => "FARD, M.K. et ALFANDARI, L. (2019). Trade-Offs Between the Stepwise Cost Function and Its Linear Approximation for the Modular Hub Location Problem. <i>Computers & Operations Research</i>, 104, pp. 358-374. FARD, M.K. et ALFANDARI, L. (2019). Trade-Offs Between the Stepwise Cost Function and Its Linear App "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "FARD M. K."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2018.11.014"
"publicationInfo" => array:3 [
"pages" => "358-374"
"volume" => "104"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "There exist situations where the transportation cost is better estimated as a function of the number of vehicles required for transporting a load, rather than a linear function of the load. This provides a stepwise cost function, which defines the so-called Modular Hub Location Problem (MHLP, or HLP with modular capacities) that has received increasing attention in the last decade. In this paper, we consider formulations to be solved by exact methods. We show that by choosing a specific generalized linear cost function with slope and intercept depending on problem data, one minimizes the measurement deviation between the two cost functions and obtains solutions close to those found with the stepwise cost function, while avoiding the higher computational complexity of the latter. As a side contribution, we look at the savings induced by using direct shipments in a hub and spoke network, given the better ability of a stepwise cost function to incorporate direct transportation. Numerical experiments are conducted over benchmark HLP instances of the OR-library. There exist situations where the transportation cost is better estimated as a function of the number "
"en" => "There exist situations where the transportation cost is better estimated as a function of the number of vehicles required for transporting a load, rather than a linear function of the load. This provides a stepwise cost function, which defines the so-called Modular Hub Location Problem (MHLP, or HLP with modular capacities) that has received increasing attention in the last decade. In this paper, we consider formulations to be solved by exact methods. We show that by choosing a specific generalized linear cost function with slope and intercept depending on problem data, one minimizes the measurement deviation between the two cost functions and obtains solutions close to those found with the stepwise cost function, while avoiding the higher computational complexity of the latter. As a side contribution, we look at the savings induced by using direct shipments in a hub and spoke network, given the better ability of a stepwise cost function to incorporate direct transportation. Numerical experiments are conducted over benchmark HLP instances of the OR-library. There exist situations where the transportation cost is better estimated as a function of the number "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
35 => Essec\Faculty\Model\Contribution {#2330
#_index: "academ_contributions"
#_id: "10955"
#_source: array:18 [
"id" => "10955"
"slug" => "10955-solving-utility-maximization-selection-problems-with-multinomial-logit-demand-is-the-first-choice-model-a-good-approximation 10955-solving-utility-maximization-selection-problems-with-multinomial-logit-demand-is-the-first-cho "
"yearMonth" => "2020-07"
"year" => "2020"
"title" => "Solving Utility-Maximization Selection Problems with Multinomial Logit Demand: Is the First-Choice Model a Good Approximation? Solving Utility-Maximization Selection Problems with Multinomial Logit Demand: Is the First-Choice M "
"description" => "ALFANDARI, L., DENOYEL, V. et THIELE, A. (2020). Solving Utility-Maximization Selection Problems with Multinomial Logit Demand: Is the First-Choice Model a Good Approximation? <i>Annals of Operations Research</i>, 292, pp. 553–573. ALFANDARI, L., DENOYEL, V. et THIELE, A. (2020). Solving Utility-Maximization Selection Problems wit "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "DENOYEL Victoire"
]
2 => array:1 [
"name" => "THIELE Aurélie"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2023-09-28 16:36:30"
"publicationUrl" => "https://doi.org/10.1007/s10479-019-03300-4"
"publicationInfo" => array:3 [
"pages" => "553–573"
"volume" => "292"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "On considère le modèle d'affectation "First-Choice" (FC) comme heuristique pour remplacer un modèle de choix Multinomial Logit (MNL) dans des problèmes de sélection en variables 0-1 avec maximisation de l'utilité dans l'objectif. Les applications concerne On considère le modèle d'affectation "First-Choice" (FC) comme heuristique pour remplacer un modèle "
"en" => "We investigate First-Choice (FC) assignment models, a simple type of choice model where customers are allocated to their highest utility option, as a heuristic for the Multinomial Logit (MNL) model in the context of selection problems with a utility maxim We investigate First-Choice (FC) assignment models, a simple type of choice model where customers ar "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
36 => Essec\Faculty\Model\Contribution {#2331
#_index: "academ_contributions"
#_id: "11619"
#_source: array:18 [
"id" => "11619"
"slug" => "11619-design-of-diversified-package-tours-for-the-digital-travel-industry-a-branch-cut-and-price-approach 11619-design-of-diversified-package-tours-for-the-digital-travel-industry-a-branch-cut-and-price-app "
"yearMonth" => "2020-09"
"year" => "2020"
"title" => "Design of diversified package tours for the Digital Travel industry: A branch-cut-and-price approach"
"description" => "ZHAO, Y. et ALFANDARI, L. (2020). Design of diversified package tours for the Digital Travel industry: A branch-cut-and-price approach. <i>European Journal of Operational Research</i>, 285(3), pp. 825-843. ZHAO, Y. et ALFANDARI, L. (2020). Design of diversified package tours for the Digital Travel industr "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Integer programming"
1 => "Team orienteering problem"
2 => "Diversity"
3 => "Branch-cut-and-price"
4 => "Digital travel industry"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2020.02.020"
"publicationInfo" => array:3 [
"pages" => "825-843"
"volume" => "285"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Motivated by the revolution brought by the internet and communication technology in daily life, this paper examines how the online travel agencies (OTA) can use these technologies to improve customer value. We consider the design of a fixed number of package tours offered to customers in the digital travel industry. This can be formulated as a Team Orienteering Problem (TOP) with restrictions on budget and time. Different from the classical TOP, our work is the first one to introduce controlled diversity between tours. This enables the OTA to offer tourists a diversified portfolio of tour packages for a given period of time, each potential customer choosing a single tour in the selected set, rather than multiple independent tours over several periods as in the classical TOP. Tuning the similarity parameter between tours enables to manage the trade-off between individual preferences in consumers’ choices and economies of scale in agencies’ bargaining power. We propose compact and extended formulations and solve the master problem by a branch-and-price method, and an alternative branch-cut-and-price method. The latter uses a delayed dominance rule in the shortest path pricing problem solved by dynamic programming. Our methods are tested over benchmark TOP instances of the literature, and a real dataset collected from a Chinese OTA. We explore the impact of tours diversity on all stakeholders, and assess the computational performance of various approaches. Motivated by the revolution brought by the internet and communication technology in daily life, this "
"en" => "Motivated by the revolution brought by the internet and communication technology in daily life, this paper examines how the online travel agencies (OTA) can use these technologies to improve customer value. We consider the design of a fixed number of package tours offered to customers in the digital travel industry. This can be formulated as a Team Orienteering Problem (TOP) with restrictions on budget and time. Different from the classical TOP, our work is the first one to introduce controlled diversity between tours. This enables the OTA to offer tourists a diversified portfolio of tour packages for a given period of time, each potential customer choosing a single tour in the selected set, rather than multiple independent tours over several periods as in the classical TOP. Tuning the similarity parameter between tours enables to manage the trade-off between individual preferences in consumers’ choices and economies of scale in agencies’ bargaining power. We propose compact and extended formulations and solve the master problem by a branch-and-price method, and an alternative branch-cut-and-price method. The latter uses a delayed dominance rule in the shortest path pricing problem solved by dynamic programming. Our methods are tested over benchmark TOP instances of the literature, and a real dataset collected from a Chinese OTA. We explore the impact of tours diversity on all stakeholders, and assess the computational performance of various approaches. Motivated by the revolution brought by the internet and communication technology in daily life, this "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
37 => Essec\Faculty\Model\Contribution {#2332
#_index: "academ_contributions"
#_id: "12096"
#_source: array:18 [
"id" => "12096"
"slug" => "12096-an-exact-method-for-assortment-optimization-under-the-nested-logit-model"
"yearMonth" => "2021-06"
"year" => "2021"
"title" => "An Exact Method for Assortment Optimization under the Nested Logit Model"
"description" => "ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2021). An Exact Method for Assortment Optimization under the Nested Logit Model. <i>European Journal of Operational Research</i>, 291(3), pp. 830-845. ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2021). An Exact Method for Assortment Optimization und "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "HASSANZADEH Alborz"
]
]
"ouvrage" => ""
"keywords" => array:2 [
0 => "combinatorial optimization"
1 => "revenue management -assortment optimization -fractional programming -nested logit"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2020.12.007"
"publicationInfo" => array:3 [
"pages" => "830-845"
"volume" => "291"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known to be polynomially solvable in a specific case and NP-hard otherwise, with only approximation algorithms existing in the literature. For the NP-hard cases, we provide a general exact method that embeds a tailored Branch-and-Bound algorithm into a fractional\n We study the problem of finding an optimal assortment of products maximizing the expected revenue, i
programming framework. Contrary to the existing literature, in which sssumptions are imposed on either the structure of nests or the combination and characteristics of products, no assumptions on the input data are imposed, and hence our approach can solve the most general problem setting. We show that the parameterized subproblem of the fractional programming scheme, which is a binary highly non-linear optimization problem, is decomposable by nests, which is a main advantage of the approach. To solve the subproblem for each nest, we propose a two-stage approach. In the first stage, we identify those products that are undoubtedly beneficial to offer, or not, which can significantly reduce the problem size. In the second stage, we design a tailored Branch-and-Bound algorithm with problem-specific upper bounds. \n programming framework. Contrary to the existing literature, in which sssumptions are imposed on eith
Numerical results show that the approach is able to solve assortment instances with up to 5,000 products per nest. The most challenging instances for our approach are those in which the dissimilarity parameters of nests can be either less or greater than one. Numerical results show that the approach is able to solve assortment instances with up to 5,000 prod
"""
"en" => """
We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known to be polynomially solvable in a specific case and NP-hard otherwise, with only approximation algorithms existing in the literature. For the NP-hard cases, we provide a general exact method that embeds a tailored Branch-and-Bound algorithm into a fractional\n We study the problem of finding an optimal assortment of products maximizing the expected revenue, i
programming framework. Contrary to the existing literature, in which sssumptions are imposed on either the structure of nests or the combination and characteristics of products, no assumptions on the input data are imposed, and hence our approach can solve the most general problem setting. We show that the parameterized subproblem of the fractional programming scheme, which is a binary highly non-linear optimization problem, is decomposable by nests, which is a main advantage of the approach. To solve the subproblem for each nest, we propose a two-stage approach. In the first stage, we identify those products that are undoubtedly beneficial to offer, or not, which can significantly reduce the problem size. In the second stage, we design a tailored Branch-and-Bound algorithm with problem-specific upper bounds. \n programming framework. Contrary to the existing literature, in which sssumptions are imposed on eith
Numerical results show that the approach is able to solve assortment instances with up to 5,000 products per nest. The most challenging instances for our approach are those in which the dissimilarity parameters of nests can be either less or greater than one. Numerical results show that the approach is able to solve assortment instances with up to 5,000 prod
"""
]
"authors_fields" => array:2 [
"fr" => "Management des opérations"
"en" => "Operations Management"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
38 => Essec\Faculty\Model\Contribution {#2333
#_index: "academ_contributions"
#_id: "12573"
#_source: array:18 [
"id" => "12573"
"slug" => "12573-a-tailored-benders-decomposition-approach-for-last-mile-delivery-withautonomous-robots"
"yearMonth" => "2021-07"
"year" => "2021"
"title" => """
A tailored Benders Decomposition Approach for Last-Mile Delivery With\n
autonomous Robots
"""
"description" => """
ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2021). A tailored Benders Decomposition Approach for Last-Mile Delivery With\n ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2021). A tailored Benders Decomposition Approach
autonomous Robots. Dans: 31st European Conference on Operational Research 2021 (EURO 2021). Athens.
"""
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DE MELO DA SILVA Marco"
]
]
"ouvrage" => "31st European Conference on Operational Research 2021 (EURO 2021)"
"keywords" => []
"updatedAt" => "2022-06-20 16:38:47"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
39 => Essec\Faculty\Model\Contribution {#2334
#_index: "academ_contributions"
#_id: "12598"
#_source: array:18 [
"id" => "12598"
"slug" => "12598-a-branch-and-cut-algorithm-for-the-edge-interdiction-clique-problem"
"yearMonth" => "2021-10"
"year" => "2021"
"title" => "A branch-and-cut algorithm for the Edge Interdiction Clique Problem"
"description" => "FURINI, F., LJUBIC, I., SAN SEGUNDO, P. et ZHAO, Y. (2021). A branch-and-cut algorithm for the Edge Interdiction Clique Problem. <i>European Journal of Operational Research</i>, 294(1), pp. 54-69. FURINI, F., LJUBIC, I., SAN SEGUNDO, P. et ZHAO, Y. (2021). A branch-and-cut algorithm for the Edge "
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:3 [
"name" => "ZHAO Yanlu"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:1 [
"name" => "FURINI Fabio"
]
3 => array:1 [
"name" => "SAN SEGUNDO Pablo"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "Combinatorial optimization -Interdiction problems -Maximum clique -Most vital edges"
]
"updatedAt" => "2023-01-27 01:00:40"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2021.01.030"
"publicationInfo" => array:3 [
"pages" => "54-69"
"volume" => "294"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to find a subset of at most k edges to remove from G so that the size of the maximum clique, in the interdicted graph, is minimized. The EICP belongs to the family of interdiction problems with the aim of reducing the clique number of the graph. The EICP optimal solutions, called optimal interdiction policies, determine the subset of most vital edges of a graph which are crucial for preserving its clique number. We propose a new set-covering-based Integer Linear Programming (ILP) formulation for the EICP with an exponential number of constraints, called the clique-covering inequalities. We design a new branch-and-cut algorithm which is enhanced by a tailored separation procedure and by an effective heuristic initialization phase. Thanks to the new exact algorithm, we manage to solve the EICP in several sets of instances from the literature. Extensive tests show that the new exact algorithm greatly outperforms the state-of-the-art approaches for the EICP. Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to fi "
"en" => "Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to find a subset of at most k edges to remove from G so that the size of the maximum clique, in the interdicted graph, is minimized. The EICP belongs to the family of interdiction problems with the aim of reducing the clique number of the graph. The EICP optimal solutions, called optimal interdiction policies, determine the subset of most vital edges of a graph which are crucial for preserving its clique number. We propose a new set-covering-based Integer Linear Programming (ILP) formulation for the EICP with an exponential number of constraints, called the clique-covering inequalities. We design a new branch-and-cut algorithm which is enhanced by a tailored separation procedure and by an effective heuristic initialization phase. Thanks to the new exact algorithm, we manage to solve the EICP in several sets of instances from the literature. Extensive tests show that the new exact algorithm greatly outperforms the state-of-the-art approaches for the EICP. Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to fi "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
40 => Essec\Faculty\Model\Contribution {#2335
#_index: "academ_contributions"
#_id: "12600"
#_source: array:18 [
"id" => "12600"
"slug" => "12600-a-tailored-benders-decomposition-approach-for-last-mile-delivery-with-autonomous-robots"
"yearMonth" => "2022-06"
"year" => "2022"
"title" => "A tailored Benders decomposition approach for last-mile delivery with autonomous robots"
"description" => "ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2022). A tailored Benders decomposition approach for last-mile delivery with autonomous robots. <i>European Journal of Operational Research</i>, 299(2), pp. 510-525. ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2022). A tailored Benders decomposition approach "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DE MELO DA SILVA Marco"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Integer Programming"
1 => "Last-mile delivery"
2 => "Self-driving robots"
3 => "Benders decomposition"
]
"updatedAt" => "2022-06-03 10:49:33"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2021.06.048"
"publicationInfo" => array:3 [
"pages" => "510-525"
"volume" => "299"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This work addresses an operational problem of a logistics service provider that consists of finding an optimal route for a vehicle carrying customer parcels from a central depot to selected facilities, from where autonomous devices like robots are launched to perform last-mile deliveries. The objective is to minimize a tardiness indicator based on the customer delivery deadlines. This article provides a better understanding of how three major tardiness indicators can be used to improve the quality of service by minimizing the maximum tardiness, the total tardiness, or the number of late deliveries. We study the problem complexity, devise a unifying Mixed Integer Programming formulation and propose an efficient branch-and-Benders-cut scheme to deal with instances of realistic size. Numerical results show that this novel Benders approach with a tailored combinatorial algorithm for generating Benders cuts largely outperforms all other alternatives. In our managerial study, we vary the number of available facilities, the coverage radius of autonomous robots and their speed, to assess their impact on the quality of service and environmental costs. This work addresses an operational problem of a logistics service provider that consists of finding "
"en" => "This work addresses an operational problem of a logistics service provider that consists of finding an optimal route for a vehicle carrying customer parcels from a central depot to selected facilities, from where autonomous devices like robots are launched to perform last-mile deliveries. The objective is to minimize a tardiness indicator based on the customer delivery deadlines. This article provides a better understanding of how three major tardiness indicators can be used to improve the quality of service by minimizing the maximum tardiness, the total tardiness, or the number of late deliveries. We study the problem complexity, devise a unifying Mixed Integer Programming formulation and propose an efficient branch-and-Benders-cut scheme to deal with instances of realistic size. Numerical results show that this novel Benders approach with a tailored combinatorial algorithm for generating Benders cuts largely outperforms all other alternatives. In our managerial study, we vary the number of available facilities, the coverage radius of autonomous robots and their speed, to assess their impact on the quality of service and environmental costs. This work addresses an operational problem of a logistics service provider that consists of finding "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
41 => Essec\Faculty\Model\Contribution {#2336
#_index: "academ_contributions"
#_id: "12954"
#_source: array:18 [
"id" => "12954"
"slug" => "12954-approximation-of-the-double-traveling-salesman-problem-with-multiple-stacks"
"yearMonth" => "2021-06"
"year" => "2021"
"title" => "Approximation of the Double Traveling Salesman Problem with multiple stacks"
"description" => "ALFANDARI, L. et TOULOUSE, S. (2021). Approximation of the Double Traveling Salesman Problem with multiple stacks. <i>Theoretical Computer Science</i>, 877, pp. 74-89. ALFANDARI, L. et TOULOUSE, S. (2021). Approximation of the Double Traveling Salesman Problem with mu "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "TOULOUSE Sophie"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2022-11-09 16:40:26"
"publicationUrl" => "https://doi.org/10.1016/j.tcs.2021.05.016"
"publicationInfo" => array:3 [
"pages" => "74-89"
"volume" => "877"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
Highlights:\n
We study the approximation of the Double Traveling Salesman Problem with Multiple Stacks.\n
We study the complexity of two important subproblems.\n
We provide approximation results for both standard and differential approximation.\n
Approximation results are derived from reductions to the TSP in the general case.\n
Algorithms based on optimal matchings and completions are analyzed for the case with two stacks.
"""
"en" => """
Highlights:\n
We study the approximation of the Double Traveling Salesman Problem with Multiple Stacks.\n
We study the complexity of two important subproblems.\n
We provide approximation results for both standard and differential approximation.\n
Approximation results are derived from reductions to the TSP in the general case.\n
Algorithms based on optimal matchings and completions are analyzed for the case with two stacks.
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
42 => Essec\Faculty\Model\Contribution {#2337
#_index: "academ_contributions"
#_id: "13227"
#_source: array:18 [
"id" => "13227"
"slug" => "13227-freight-on-transit-for-urban-last-mile-deliveries-a-strategic-planning-approach"
"yearMonth" => "2022-05"
"year" => "2022"
"title" => "Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach"
"description" => "DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2022). Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach. Dans: International Workshop on Freight Transportation and Logistics (ODYSSEUS). Tanger. DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2022). Freight-on-Transit for urban last "
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "International Workshop on Freight Transportation and Logistics (ODYSSEUS)"
"keywords" => []
"updatedAt" => "2023-01-27 01:00:45"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
43 => Essec\Faculty\Model\Contribution {#2338
#_index: "academ_contributions"
#_id: "13230"
#_source: array:18 [
"id" => "13230"
"slug" => "13230-freight-on-public-transport-strategical-decision-making-with-mixed-integer-programming"
"yearMonth" => "2021-07"
"year" => "2021"
"title" => "Freight on Public Transport: Strategical decision making with mixed integer programming"
"description" => "DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2021). Freight on Public Transport: Strategical decision making with mixed integer programming. Dans: European Conference on Operational Research (EURO). Athens. DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2021). Freight on Public Transport: Stra "
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "European Conference on Operational Research (EURO)"
"keywords" => []
"updatedAt" => "2023-01-27 01:00:45"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
44 => Essec\Faculty\Model\Contribution {#2339
#_index: "academ_contributions"
#_id: "13237"
#_source: array:18 [
"id" => "13237"
"slug" => "13237-freight-on-transit-for-urban-last-mile-deliveries-a-strategic-planning-approach"
"yearMonth" => "2022-06"
"year" => "2022"
"title" => "Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach"
"description" => "DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2022). Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach. Dans: Spanish Conference on Statistics and Operations Research (SEIO). Granada. DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2022). Freight-on-Transit for urban last "
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "Spanish Conference on Statistics and Operations Research (SEIO)"
"keywords" => []
"updatedAt" => "2023-07-20 12:06:05"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
45 => Essec\Faculty\Model\Contribution {#2340
#_index: "academ_contributions"
#_id: "8072"
#_source: array:18 [
"id" => "8072"
"slug" => "8072-improved-approximation-of-the-general-soft-capacitated-facility-location-problem"
"yearMonth" => "2005-03"
"year" => "2005"
"title" => "Improved Approximation of the General Soft-Capacitated Facility Location Problem"
"description" => "ALFANDARI, L. (2005). <i>Improved Approximation of the General Soft-Capacitated Facility Location Problem</i>. ESSEC Business School. ALFANDARI, L. (2005). <i>Improved Approximation of the General Soft-Capacitated Facility Location Pr "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2020-12-17 21:00:33"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Nous étudions une variante du problème classique de localisation optimale d'entreprises avec capacités de livraison ou de production limitées, dans laquelle chaque centre de production se décompose en un nombre variable d'unités de production. Cette variante, NP-difficile également, a été récemment étudiée dans plusieurs articles, principalement dans le cas métrique. Dans ce document, nous traitons le problème général où les coûts de connexion des clients aux centres de livraison ne vérifient pas obligatoirement l'inégalité triangulaire. Nous proposons pour ce problème une heuristique adaptée de la méthode gloutonne pour le problème de Couverture d'Ensemble, où le sous-problème est traité par un schéma d'approximation utilisant une normalisation des coûts et la programmation dynamique. Nous montrons que cette heuristique permet d'approcher en temps polynomial le problème à rapport (1+ )H(n), où n est le nombre de clients devant être livrés et H est la série harmonique. Ce rapport améliore le précédent ratio de 2H(n) pour ce problème. Nous étudions une variante du problème classique de localisation optimale d'entreprises avec capacit "
"en" => "An NP-hard variant of the single-source Capacitated Facility Location Problem is studied, where each facility is composed of a variable number of fixed-capacity production units. This problem, especially the metric case, has been recently studied in several papers. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the sub-problem is approximately solved by a Fully Polynomial-Time Approximation Scheme based on cost scaling and dynamic programming, achieves a logarithmic approximation ratio of (1+ )H(n) for the problem, where n is the number of clients to be served, and H is the harmonic series. This improves the previous bound of 2H(n) for this problem. An NP-hard variant of the single-source Capacitated Facility Location Problem is studied, where each "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
46 => Essec\Faculty\Model\Contribution {#2341
#_index: "academ_contributions"
#_id: "8389"
#_source: array:18 [
"id" => "8389"
"slug" => "8389-robust-location-of-new-housing-developments-using-a-choice-model"
"yearMonth" => "2015-11"
"year" => "2015"
"title" => "Robust Location of New Housing Developments Using a Choice Model"
"description" => "ESPINOZA GARCIA, J.C. et ALFANDARI, L. (2015). <i>Robust Location of New Housing Developments Using a Choice Model</i>. ESSEC Business School. ESPINOZA GARCIA, J.C. et ALFANDARI, L. (2015). <i>Robust Location of New Housing Developments Using "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ESPINOZA GARCIA J. C."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2020-12-17 21:00:33"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We consider the issue of choosing a subset of locations to construct new housing developments maximizing the satisfaction of potential buyers. The allocation of demands to the selected locations is modeled by a choice model, based on the distance to the location, real-estate prices and incomes. We study two robust counterparts of the optimal location problem, where uncertainty lies on demand volumes for the first one, and on customer preferences for the second one. In both cases, the parameters subject to uncertainty appear both in the objective function and constraints. The second robust model combines a scenario-based approach with nominal, price-centric and distance-centric scenarios on customers preferences, and an uncertainty budget approach that limits the number of cities that can deviate from the nominal scenario. Computational experiments are conducted on instances of the Paris region to analyze the tractability of the problem and its robust counterparts, and derive insights for the new housing development issue. We consider the issue of choosing a subset of locations to construct new housing developments maximi "
"en" => "We consider the issue of choosing a subset of locations to construct new housing developments maximizing the satisfaction of potential buyers. The allocation of demands to the selected locations is modeled by a choice model, based on the distance to the location, real-estate prices and incomes. We study two robust counterparts of the optimal location problem, where uncertainty lies on demand volumes for the first one, and on customer preferences for the second one. In both cases, the parameters subject to uncertainty appear both in the objective function and constraints. The second robust model combines a scenario-based approach with nominal, price-centric and distance-centric scenarios on customers preferences, and an uncertainty budget approach that limits the number of cities that can deviate from the nominal scenario. Computational experiments are conducted on instances of the Paris region to analyze the tractability of the problem and its robust counterparts, and derive insights for the new housing development issue. We consider the issue of choosing a subset of locations to construct new housing developments maximi "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
47 => Essec\Faculty\Model\Contribution {#2342
#_index: "academ_contributions"
#_id: "8487"
#_source: array:18 [
"id" => "8487"
"slug" => "8487-trade-offs-between-the-stepwise-cost-function-and-its-linear-approximation-for-the-modular-hub-location-problem 8487-trade-offs-between-the-stepwise-cost-function-and-its-linear-approximation-for-the-modular-hub- "
"yearMonth" => "2018-05"
"year" => "2018"
"title" => "Trade-offs between the Stepwise Cost Function and its Linear Approximation for the Modular Hub Location Problem Trade-offs between the Stepwise Cost Function and its Linear Approximation for the Modular Hub Locat "
"description" => "KESHVARI FARD, M. et ALFANDARI, L. (2018). <i>Trade-offs between the Stepwise Cost Function and its Linear Approximation for the Modular Hub Location Problem</i>. ESSEC Business School. KESHVARI FARD, M. et ALFANDARI, L. (2018). <i>Trade-offs between the Stepwise Cost Function and its "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "KESHVARI FARD Milad"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
There exist situations where the transportation cost is better estimated as a function of the number of vehicles required for transporting a load, rather than a linear function of the load. This provides a stepwise cost function, which defines the so-called Modular Hub Location Problem (MHLP, or HLP with modular capacities) that has received increasing attention in the last decade. In this paper, we consider formulations to be solved by exact methods. We show that by choosing a specific generalized linear cost function with slope and intercept depending on problem data, one minimizes the measurement deviation between the two cost functions and obtains solutions close to\n There exist situations where the transportation cost is better estimated as a function of the number
those found with the step-wise cost function, while avoiding the higher computational complexity of the latter. As a side contribution, we look at the savings induced by using direct shipments in a hub and\n those found with the step-wise cost function, while avoiding the higher computational complexity of
spoke network, given the better ability of a stepwise cost function to incorporate direct transportation. Numerical experiments are conducted over benchmark HLP instances of the OR-library. spoke network, given the better ability of a stepwise cost function to incorporate direct transporta
"""
"en" => """
There exist situations where the transportation cost is better estimated as a function of the number of vehicles required for transporting a load, rather than a linear function of the load. This provides a stepwise cost function, which defines the so-called Modular Hub Location Problem (MHLP, or HLP with modular capacities) that has received increasing attention in the last decade. In this paper, we consider formulations to be solved by exact methods. We show that by choosing a specific generalized linear cost function with slope and intercept depending on problem data, one minimizes the measurement deviation between the two cost functions and obtains solutions close to\n There exist situations where the transportation cost is better estimated as a function of the number
those found with the step-wise cost function, while avoiding the higher computational complexity of the latter. As a side contribution, we look at the savings induced by using direct shipments in a hub and\n those found with the step-wise cost function, while avoiding the higher computational complexity of
spoke network, given the better ability of a stepwise cost function to incorporate direct transportation. Numerical experiments are conducted over benchmark HLP instances of the OR-library. spoke network, given the better ability of a stepwise cost function to incorporate direct transporta
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
48 => Essec\Faculty\Model\Contribution {#2343
#_index: "academ_contributions"
#_id: "6043"
#_source: array:18 [
"id" => "6043"
"slug" => "6043-generalizations-of-dobson-approximation-algorithm-and-cooperation-with-column-generation-for-large-size-covering-integer-programs 6043-generalizations-of-dobson-approximation-algorithm-and-cooperation-with-column-generation-for-la "
"yearMonth" => "2012-04"
"year" => "2012"
"title" => "Generalizations of Dobson Approximation Algorithm and Cooperation with Column Generation for Large-Size Covering Integer Programs Generalizations of Dobson Approximation Algorithm and Cooperation with Column Generation for Large-S "
"description" => "ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2012). Generalizations of Dobson Approximation Algorithm and Cooperation with Column Generation for Large-Size Covering Integer Programs. Dans: 2nd International Symposium on Combinatorial Optimization (ISCO 2012). ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2012). Generalizations of Dobson Approximation A "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "NAGIH A."
]
2 => array:1 [
"name" => "PLATEAU A."
]
3 => array:1 [
"name" => "SADKI J."
]
]
"ouvrage" => "2nd International Symposium on Combinatorial Optimization (ISCO 2012)"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
49 => Essec\Faculty\Model\Contribution {#2344
#_index: "academ_contributions"
#_id: "6144"
#_source: array:18 [
"id" => "6144"
"slug" => "6144-hybrid-column-generation-for-large-size-covering-integer-programs"
"yearMonth" => "2013-06"
"year" => "2013"
"title" => "Hybrid Column Generation for Large-Size Covering Integer Programs"
"description" => "ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2013). Hybrid Column Generation for Large-Size Covering Integer Programs. Dans: 26th Conference of European Chapter on Combinatorial Optimization. ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2013). Hybrid Column Generation for Large-Size C "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "NAGIH A."
]
2 => array:1 [
"name" => "PLATEAU A."
]
3 => array:1 [
"name" => "SADKI J."
]
]
"ouvrage" => "26th Conference of European Chapter on Combinatorial Optimization"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
50 => Essec\Faculty\Model\Contribution {#2345
#_index: "academ_contributions"
#_id: "6146"
#_source: array:18 [
"id" => "6146"
"slug" => "6146-hybridization-of-column-generation-and-approximation-heuristics-for-large-size-covering-integer-programs 6146-hybridization-of-column-generation-and-approximation-heuristics-for-large-size-covering-integer "
"yearMonth" => "2011-07"
"year" => "2011"
"title" => "Hybridization of Column Generation and Approximation Heuristics for Large-size Covering Integer Programs Hybridization of Column Generation and Approximation Heuristics for Large-size Covering Integer Prog "
"description" => "ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2011). Hybridization of Column Generation and Approximation Heuristics for Large-size Covering Integer Programs. Dans: MIC 2011 - Metaheuristics International Conference. ALFANDARI, L., NAGIH, A., PLATEAU, A. et SADKI, J. (2011). Hybridization of Column Generation and Ap "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "NAGIH A."
]
2 => array:1 [
"name" => "PLATEAU A."
]
3 => array:1 [
"name" => "SADKI J."
]
]
"ouvrage" => "MIC 2011 - Metaheuristics International Conference"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
51 => Essec\Faculty\Model\Contribution {#2346
#_index: "academ_contributions"
#_id: "6570"
#_source: array:18 [
"id" => "6570"
"slug" => "6570-logical-definability-of-covering-and-partitioning-minimization-problems"
"yearMonth" => "2000-09"
"year" => "2000"
"title" => "Logical Definability of Covering and Partitioning Minimization Problems"
"description" => "ALFANDARI, L. (2000). Logical Definability of Covering and Partitioning Minimization Problems. Dans: CLAIO X (Congresso Latino-Americano de Investigacion Operativa)-Latin-American Congress of Operations Research, Mexico. ALFANDARI, L. (2000). Logical Definability of Covering and Partitioning Minimization Problems. Dans: "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "CLAIO X (Congresso Latino-Americano de Investigacion Operativa)-Latin-American Congress of Operations Research, Mexico CLAIO X (Congresso Latino-Americano de Investigacion Operativa)-Latin-American Congress of Operation "
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Nous étudions comment la formulation logique de certains problèmes d'optimisation difficiles permet d'évaluer leur niveau d'approximation, en particulier des problèmes de couverture et de partition à coût minimum. Nous élargissons des résultats de Kolaïtis et Thakur à une classe de problèmes dont nous montrons qu'ils se réduisent au problème de Bi-Set Covering, qui généralise le problème classique de Set Covering. Cette classe contient des problèmes naturels de localisation et de conception de réseau. Nous étudions comment la formulation logique de certains problèmes d'optimisation difficiles permet "
"en" => "We focus on how the logical definability of NP-hard optimization problems can help to decide their approximability. Particularly, we deal with NP-hard minimization covering and partitioning problems. We extend some results of Kolaïtis and Thakur by defining a class containing some natural weighted problems whose approximability is an open problem. We show that all problems in this class amount to a generalization of the classical Set Covering problem, called Bi-Set Covering. Examples of such problems concern optimal location and network design. We focus on how the logical definability of NP-hard optimization problems can help to decide their a "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
52 => Essec\Faculty\Model\Contribution {#2347
#_index: "academ_contributions"
#_id: "6744"
#_source: array:18 [
"id" => "6744"
"slug" => "6744-new-mip-models-for-liner-shipping-route-design-with-empty-container-repositioning"
"yearMonth" => "2017-02"
"year" => "2017"
"title" => "New MIP models for Liner Shipping Route Design with Empty Container Repositioning"
"description" => "ALFANDARI, L., FURINI, F., LJUBIC, I. et MARTIN, S. (2017). New MIP models for Liner Shipping Route Design with Empty Container Repositioning. Dans: 18ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la Décision. ALFANDARI, L., FURINI, F., LJUBIC, I. et MARTIN, S. (2017). New MIP models for Liner Shipping Route "
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "FURINI F."
]
3 => array:1 [
"name" => "MARTIN S."
]
]
"ouvrage" => "18ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la Décision"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
53 => Essec\Faculty\Model\Contribution {#2348
#_index: "academ_contributions"
#_id: "6745"
#_source: array:18 [
"id" => "6745"
"slug" => "6745-new-mip-models-for-liner-shipping-route-design-with-empty-container-repositioning"
"yearMonth" => "2018-04"
"year" => "2018"
"title" => "New MIP models for liner shipping route design with empty container repositioning"
"description" => "ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2018). New MIP models for liner shipping route design with empty container repositioning. Dans: 4th International Conference on Logistics Operations Management (GOL'2018). ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2018). New MIP models "
"authors" => array:6 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DAVIDOVIC T."
]
3 => array:1 [
"name" => "FURINI F."
]
4 => array:1 [
"name" => "MARAS V."
]
5 => array:1 [
"name" => "MARTIN S."
]
]
"ouvrage" => "4th International Conference on Logistics Operations Management (GOL'2018)"
"keywords" => []
"updatedAt" => "2023-09-28 16:23:06"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
54 => Essec\Faculty\Model\Contribution {#2349
#_index: "academ_contributions"
#_id: "6810"
#_source: array:18 [
"id" => "6810"
"slug" => "6810-optimal-facility-in-network-selection-for-healthcare-payers-under-reference-pricing"
"yearMonth" => "2014-07"
"year" => "2014"
"title" => "Optimal Facility In-Network Selection for Healthcare Payers under Reference Pricing"
"description" => "ALFANDARI, L., DENOYAL, V. et THIELE, A. (2014). Optimal Facility In-Network Selection for Healthcare Payers under Reference Pricing. Dans: 20th Conference of the International Federation of Operational Research Societies. ALFANDARI, L., DENOYAL, V. et THIELE, A. (2014). Optimal Facility In-Network Selection for Healthcar "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "DENOYAL V."
]
2 => array:1 [
"name" => "THIELE A."
]
]
"ouvrage" => "20th Conference of the International Federation of Operational Research Societies"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
55 => Essec\Faculty\Model\Contribution {#2350
#_index: "academ_contributions"
#_id: "6827"
#_source: array:18 [
"id" => "6827"
"slug" => "6827-optimal-vehicle-routing-with-autonomous-devices-for-last-mile-delivery"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "Optimal Vehicle Routing with Autonomous Devices for Last-Mile Delivery"
"description" => "ALFANDARI, L., LJUBIC, I. et MELO, M. (2019). Optimal Vehicle Routing with Autonomous Devices for Last-Mile Delivery. Dans: 2019 Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog 2019). ALFANDARI, L., LJUBIC, I. et MELO, M. (2019). Optimal Vehicle Routing with Autonomous Devices for La "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "MELO M."
]
]
"ouvrage" => "2019 Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog 2019)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
56 => Essec\Faculty\Model\Contribution {#2351
#_index: "academ_contributions"
#_id: "6829"
#_source: array:18 [
"id" => "6829"
"slug" => "6829-optimisation-robuste-pour-la-localisation-de-nouveaux-logements-avec-modele-de-choix"
"yearMonth" => "2018-02"
"year" => "2018"
"title" => "Optimisation robuste pour la localisation de nouveaux logements avec modèle de choix"
"description" => "ALFANDARI, L. et ESPINOZA-GARCIA, J.C. (2018). Optimisation robuste pour la localisation de nouveaux logements avec modèle de choix. Dans: 19ème Congrès de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF 2018). ALFANDARI, L. et ESPINOZA-GARCIA, J.C. (2018). Optimisation robuste pour la localisation de nouveaux "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ESPINOZA-GARCIA J.-C."
]
]
"ouvrage" => "19ème Congrès de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF 2018) 19ème Congrès de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF 20 "
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
57 => Essec\Faculty\Model\Contribution {#2352
#_index: "academ_contributions"
#_id: "6830"
#_source: array:18 [
"id" => "6830"
"slug" => "6830-optimisation-robuste-pour-la-selection-dun-reseau-dhopitaux-dans-un-systeme-de-prix-de-reference 6830-optimisation-robuste-pour-la-selection-dun-reseau-dhopitaux-dans-un-systeme-de-prix-de-referenc "
"yearMonth" => "2016-02"
"year" => "2016"
"title" => "Optimisation robuste pour la sélection d’un réseau d’hôpitaux dans un système de Prix de Référence"
"description" => "ALFANDARI, L., DENOYEL, V. et THIELE, A. (2016). Optimisation robuste pour la sélection d’un réseau d’hôpitaux dans un système de Prix de Référence. Dans: 17ème congrès de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF2016). ALFANDARI, L., DENOYEL, V. et THIELE, A. (2016). Optimisation robuste pour la sélection d’un réseau "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "DENOYEL V."
]
2 => array:1 [
"name" => "THIELE A."
]
]
"ouvrage" => "17ème congrès de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF2016) 17ème congrès de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF201 "
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
58 => Essec\Faculty\Model\Contribution {#2353
#_index: "academ_contributions"
#_id: "6888"
#_source: array:18 [
"id" => "6888"
"slug" => "6888-planification-et-routage-pour-loptimisation-de-la-distribution-urbaine-de-marchandise"
"yearMonth" => "2012-04"
"year" => "2012"
"title" => "Planification et routage pour l'optimisation de la distribution urbaine de marchandise"
"description" => "ALFANDARI, L. (2012). Planification et routage pour l'optimisation de la distribution urbaine de marchandise. Dans: 13e congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF 2012). ALFANDARI, L. (2012). Planification et routage pour l'optimisation de la distribution urbaine de mar "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "13e congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF 2012) 13e congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROAD "
"keywords" => []
"updatedAt" => "2023-09-28 11:35:47"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
59 => Essec\Faculty\Model\Contribution {#2354
#_index: "academ_contributions"
#_id: "7092"
#_source: array:18 [
"id" => "7092"
"slug" => "7092-robust-optimization-for-non-linear-impact-of-data-variation"
"yearMonth" => "2018-07"
"year" => "2018"
"title" => "Robust Optimization for Non-Linear Impact of Data Variation"
"description" => "ALFANDARI, L. et ESPINOZA-GARCIA, J.C. (2018). Robust Optimization for Non-Linear Impact of Data Variation. Dans: ISMP Bordeaux 2018 (International Symposium of Mathematical Optimization). ALFANDARI, L. et ESPINOZA-GARCIA, J.C. (2018). Robust Optimization for Non-Linear Impact of Data Var "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ESPINOZA-GARCIA J.-C"
]
]
"ouvrage" => "ISMP Bordeaux 2018 (International Symposium of Mathematical Optimization)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
60 => Essec\Faculty\Model\Contribution {#2355
#_index: "academ_contributions"
#_id: "7478"
#_source: array:18 [
"id" => "7478"
"slug" => "7478-tighter-mip-formulations-for-the-barge-container-ship-routing-problem"
"yearMonth" => "2017-07"
"year" => "2017"
"title" => "Tighter MIP Formulations for the Barge Container Ship Routing Problem"
"description" => "ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2017). Tighter MIP Formulations for the Barge Container Ship Routing Problem. Dans: 21st Conference of the International Federation of Operational Research Societies (IFORS). ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2017). Tighter MIP Fo "
"authors" => array:6 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DAVIDOVIC T."
]
3 => array:1 [
"name" => "FURINI F."
]
4 => array:1 [
"name" => "MARAS V."
]
5 => array:1 [
"name" => "MARTIN S."
]
]
"ouvrage" => "21st Conference of the International Federation of Operational Research Societies (IFORS)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
61 => Essec\Faculty\Model\Contribution {#2356
#_index: "academ_contributions"
#_id: "7536"
#_source: array:18 [
"id" => "7536"
"slug" => "7536-un-algorithme-de-branch-and-price-and-cut-pour-la-planification-durable-des-rotations-agricoles"
"yearMonth" => "2014-02"
"year" => "2014"
"title" => "Un algorithme de branch-and-price-and-cut pour la planification durable des rotations agricoles"
"description" => "ALFANDARI, L., PLATEAU, A. et SCHEPLER, X. (2014). Un algorithme de branch-and-price-and-cut pour la planification durable des rotations agricoles. Dans: 15ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF). ALFANDARI, L., PLATEAU, A. et SCHEPLER, X. (2014). Un algorithme de branch-and-price-and-cut pour la "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PLATEAU A."
]
2 => array:1 [
"name" => "SCHEPLER X."
]
]
"ouvrage" => "15ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF) 15ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (RO "
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
62 => Essec\Faculty\Model\Contribution {#2357
#_index: "academ_contributions"
#_id: "7862"
#_source: array:18 [
"id" => "7862"
"slug" => "7862-a-branch-and-price-and-cut-approach-for-sustainable-crop-rotation-planning"
"yearMonth" => "2014-04"
"year" => "2014"
"title" => "A Branch-and-Price-and-Cut Approach for Sustainable Crop Rotation Planning"
"description" => "ALFANDARI, L., PLATEAU, A. et SCHEPLER, X. (2014). <i>A Branch-and-Price-and-Cut Approach for Sustainable Crop Rotation Planning</i>. ESSEC Business School. ALFANDARI, L., PLATEAU, A. et SCHEPLER, X. (2014). <i>A Branch-and-Price-and-Cut Approach for Sustai "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PLATEAU A."
]
2 => array:1 [
"name" => "SCHEPLER X."
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Agriculture"
1 => "Branch-and-Price-and-Cut"
2 => "Génération de colonnes"
3 => "Planification de production"
4 => "Recherche opérationnelle"
5 => "Rotations culturales"
]
"updatedAt" => "2020-12-17 21:00:33"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Nous étudions un problème de planification de production agricole multi-périodique. Ce problème appartient à la classe des problèmes de planification de rotations culturales, qui ont été particulièrement étudiés dans la littérature ces dernières années. Il consiste à alterner des périodes de cultures et de jachères sur un sous-ensemble de parcelles et sur un horizon de temps donné, de manière à minimiser l'espace agricole requis pour satisfaire les demandes de chaque culture à chaque saison. Nous montrons que ce problème est NP-difficile. Nous proposons une formulation compacte de type Programmation Linéaire en variables 0-1, basée sur des graphes de séquences. Une formulation étendue est ensuite présentée, et un algorithme de Branch-and-Cut-and-Price (BPC) basé sur cette formulation est proposé, avec un sous-problème de pricing polynomial, des règles de branchement ad-hoc et des coupes associées aux contraintes de couverture des demandes. Ceci constitue le premier algorithme de BPC de la littérature pour les problèmes de construction de rotations agricoles. Les expériences numériques sur des instances faisant varier le nombre de cultures, de périodes et de parcelles, montrent l'efficacité de l'approche BPC sur la formulation étendue comparée à la résolution de la formulation compacte, bien que ces deux formulations fournissent la même borne pour la relaxation continue. Nous étudions un problème de planification de production agricole multi-périodique. Ce problème appa "
"en" => "In this paper, we study a multi-periodic production planning problem in agriculture. This problem belongs to the class of crop rotation planning problems, which have received increased attention in the literature in recent years. Crop cultivation and fallow periods must be scheduled on land plots over a given time horizon so as to minimize the total surface area of land used, while satisfying crop demands every period. This problem is proven strongly NP-hard. We propose a 0-1 linear programming compact formulation based on crop-sequence graphs. An extended formulation is then provided with a polynomial-time pricing problem, and a Branch-and-Price-and-Cut (BPC) algorithm is presented with adapted branching rules and cutting planes. This is the first BPC approach of the literature for crop rotation planning. The numerical experiments on instances varying the number of crops, periods and plots show the effectiveness of the BPC for the extended formulation compared to solving the compact formulation, even though these two formulations have the same linear relaxation bound. In this paper, we study a multi-periodic production planning problem in agriculture. This problem be "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
63 => Essec\Faculty\Model\Contribution {#2358
#_index: "academ_contributions"
#_id: "7876"
#_source: array:18 [
"id" => "7876"
"slug" => "7876-a-path-relinking-algorithm-for-the-generalized-assignement-problem"
"yearMonth" => "2002-04"
"year" => "2002"
"title" => "A Path-relinking Algorithm for the Generalized Assignement Problem"
"description" => "ALFANDARI, L., PLATEAU, A. et TOLLA, P. (2002). <i>A Path-relinking Algorithm for the Generalized Assignement Problem</i>. ESSEC Business School. ALFANDARI, L., PLATEAU, A. et TOLLA, P. (2002). <i>A Path-relinking Algorithm for the Generalized As "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PLATEAU A."
]
2 => array:1 [
"name" => "TOLLA P."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2020-12-17 21:00:33"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Le Problème d'Affectation Généralisé (GAP) consiste à rechercher une affectation optimale de tâches à des agents soumis à des contraintes de capacité. Nous proposons un algorithme de Recomposition de Chemins (Path Relinking) pour ce problème, explorant à la fois l'espace des solutions réalisables et non réalisables. Les expériences numériques menées sur des instances de taille réduite de la OR-library illustrent l'efficacité de l'algorithme comparativement à la plupart des autres méthodes de la littérature. En particulier, les optima de plus de 95% des instances du fichier-test ont été trouvés en des temps de calcul relativement restreints. Le Problème d'Affectation Généralisé (GAP) consiste à rechercher une affectation optimale de tâches "
"en" => "The well-studied NP-hard Generalized Assignment Problem (GAP) consists in finding a maximum-profit assignment of tasks to agents such that each task is assigned to one agent and capacity constraints are satisfied for every agent. We propose a Path-Relinking heuristic for the GAPrelying on exploration of both feasible and infeasible solutions. Numerical experiments reported on small-size testbed instances of the OR-library show that the algorithm compares favorably to several other methods of the literature. In particular, more than 95% of the instances in the test-file were solved to optimality with short computation time. The well-studied NP-hard Generalized Assignment Problem (GAP) consists in finding a maximum-profit a "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
64 => Essec\Faculty\Model\Contribution {#2359
#_index: "academ_contributions"
#_id: "14432"
#_source: array:18 [
"id" => "14432"
"slug" => "14432-optimizing-drone-use-in-early-infant-diagnosis-of-hiv-supply-chainin-less-developed-countries"
"yearMonth" => "2022-07"
"year" => "2022"
"title" => "Optimizing Drone Use in Early Infant Diagnosis of HIV Supply Chainin Less Developed Countries"
"description" => "ALFANDARI, L. (2022). Optimizing Drone Use in Early Infant Diagnosis of HIV Supply Chainin Less Developed Countries. Dans: 2022 Euro. Espoo. ALFANDARI, L. (2022). Optimizing Drone Use in Early Infant Diagnosis of HIV Supply Chainin Less Deve "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "2022 Euro"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
65 => Essec\Faculty\Model\Contribution {#2360
#_index: "academ_contributions"
#_id: "7943"
#_source: array:18 [
"id" => "7943"
"slug" => "7943-choice-rules-with-size-constraints-for-multiple-criteria-decision-making"
"yearMonth" => "2004-01"
"year" => "2004"
"title" => "Choice Rules with Size Constraints for Multiple Criteria Decision Making"
"description" => "ALFANDARI, L. (2004). <i>Choice Rules with Size Constraints for Multiple Criteria Decision Making</i>. ESSEC Business School. ALFANDARI, L. (2004). <i>Choice Rules with Size Constraints for Multiple Criteria Decision Making</i "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2020-12-17 21:00:33"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Dans les méthodes de surclassement pour l'Aide Multicritère à la Décision, la comparaison par paire des actions potentielles aboutit le plus souvent à la construction d'une relation floue de préférence. Dans ce papier, nous proposons d'étendre la relation binaire de préférence aux sous-ensembles d'actions, ce qui nous conduit à déterminer une fonction de score associée à chaque sous-ensemble. Une procédure de choix basée sur la maximisation du score sous contrainte de cardinalité est étudiée. Nous montrons que cette procédure de choix équivaut à résoudre de façon séquentielle des problèmes combinatoires de localisation bien connus. Afin de comparer cette nouvelle approche à la méthode classique de recherche de noyaux, nous analysons la propriété de stabilité du sous-ensemble choisi et discutons de la pertinence de cette contrainte. Dans les méthodes de surclassement pour l'Aide Multicritère à la Décision, la comparaison par paire "
"en" => "In outranking methods for Multiple Criteria Decision Making (MCDM), pair-wise comparisons of alternatives are often summarized through a fuzzy preference relation. In this paper, the binary preference relation is extended to pairs of subsets of alternatives in order to define on this basis a scoring function over subsets. A choice rule based on maximizing score under size constraints is studied, which turns to formulate as solving a sequence of classical location problems. For comparison with the kernel approach, the interior stability property of the selected subset is discussed and analized. In outranking methods for Multiple Criteria Decision Making (MCDM), pair-wise comparisons of alterna "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
66 => Essec\Faculty\Model\Contribution {#2361
#_index: "academ_contributions"
#_id: "4386"
#_source: array:18 [
"id" => "4386"
"slug" => "4386-approximation-of-the-clustered-set-covering-problem"
"yearMonth" => "2010-03"
"year" => "2010"
"title" => "Approximation of the Clustered Set Covering Problem"
"description" => "ALFANDARI, L. et MONNOT, J. (2010). Approximation of the Clustered Set Covering Problem. Dans: <i>Electronic Notes in Discrete Mathematics</i>. ISCO. ALFANDARI, L. et MONNOT, J. (2010). Approximation of the Clustered Set Covering Problem. Dans: <i>El "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "MONNOT J."
]
]
"ouvrage" => "Electronic Notes in Discrete Mathematics"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning. We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into "
"en" => "We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning. We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
67 => Essec\Faculty\Model\Contribution {#2362
#_index: "academ_contributions"
#_id: "10846"
#_source: array:18 [
"id" => "10846"
"slug" => "10846-une-methode-exacte-pour-le-probleme-dassortiment-optimal-avec-modele-de-choix-nested-logit"
"yearMonth" => "2020-02"
"year" => "2020"
"title" => "Une méthode exacte pour le problème d'assortiment optimal avec modèle de choix nested-logit"
"description" => "ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2020). Une méthode exacte pour le problème d'assortiment optimal avec modèle de choix nested-logit. Dans: 21st ROADEF 2020. ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2020). Une méthode exacte pour le problème d'assortime "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "HASSANZADEH Alborz"
]
]
"ouvrage" => "21st ROADEF 2020"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Management des opérations"
"en" => "Operations Management"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
68 => Essec\Faculty\Model\Contribution {#2363
#_index: "academ_contributions"
#_id: "4918"
#_source: array:18 [
"id" => "4918"
"slug" => "4918-on-the-approximation-of-some-spanning-arborescence-problems"
"yearMonth" => "1998-01"
"year" => "1998"
"title" => "On the Approximation of Some Spanning Arborescence Problems"
"description" => "ALFANDARI, L. et PASCHOS, V. (1998). On the Approximation of Some Spanning Arborescence Problems. Dans: <i>Advances in Computer and Information Sciences '98. 13th International Symposium on Computer and Information Sciences (ISCIS)</i>. IOS Press, pp. 574-581. ALFANDARI, L. et PASCHOS, V. (1998). On the Approximation of Some Spanning Arborescence Problems. Da "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "PASCHOS V."
]
]
"ouvrage" => "Advances in Computer and Information Sciences '98. 13th International Symposium on Computer and Information Sciences (ISCIS) Advances in Computer and Information Sciences '98. 13th International Symposium on Computer and Info "
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "574-581"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Nous présentons une classe de problèmes d'optimisation, appelée M-ST (Master-Slave Tractable), consistant à couvrir ou partitionner les sommets ou les arêtes d'un graphe par des sous-graphes. Ces problèmes, en général NP-difficiles, sont tous approximables à rapport logarithmique par une instanciation de l'algorithme glouton classique par le problème de Set Covering. Des applications sont présentées dans le domaine du dimensionnement de réseau (Network Design). Nous présentons une classe de problèmes d'optimisation, appelée M-ST (Master-Slave Tractable), consi "
"en" => "We define a new class of optimization problems, called M-ST (Master-Slave Tractable), which consist in covering or partitioning the vertex-set (or the edge-set) of a weighted graph by subgraphs. These NP-hard problems can be approximated within logarithmic ratio by an instanciation of the classical greedy algorithm for the Set Covering problem. Several applications are presented in the field of Network Design. We define a new class of optimization problems, called M-ST (Master-Slave Tractable), which consist "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
69 => Essec\Faculty\Model\Contribution {#2364
#_index: "academ_contributions"
#_id: "12418"
#_source: array:18 [
"id" => "12418"
"slug" => "12418-sustainable-city-logistics"
"yearMonth" => "2021-05"
"year" => "2021"
"title" => "Sustainable city logistics"
"description" => "ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2021). Sustainable city logistics. <i>ESSEC Knowledge</i>. ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2021). Sustainable city logistics. <i>ESSEC Knowledge</i> "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "http://knowledge.essec.edu/en/innovation/sustainable-city-logistics.html"
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles ou vidéos de vulgarisation"
"en" => "Press article, video or other popular media"
]
"support_type" => array:2 [
"fr" => "Presse"
"en" => "Press"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
70 => Essec\Faculty\Model\Contribution {#2365
#_index: "academ_contributions"
#_id: "12569"
#_source: array:18 [
"id" => "12569"
"slug" => "12569-the-edge-interdiction-clique-problem"
"yearMonth" => "2021-07"
"year" => "2021"
"title" => "The Edge Interdiction Clique Problem"
"description" => "FURINI, F., LJUBIC, I., SAN SEGUNDO, P. et ZHAO, Y. (2021). The Edge Interdiction Clique Problem. Dans: 31st European Conference on Operational Research 2021. Athens (virtual). FURINI, F., LJUBIC, I., SAN SEGUNDO, P. et ZHAO, Y. (2021). The Edge Interdiction Clique Problem. Da "
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:3 [
"name" => "ZHAO Yanlu"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:1 [
"name" => "FURINI Fabio"
]
3 => array:1 [
"name" => "SAN SEGUNDO Pablo"
]
]
"ouvrage" => "31st European Conference on Operational Research 2021"
"keywords" => []
"updatedAt" => "2022-02-09 11:31:42"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
71 => Essec\Faculty\Model\Contribution {#2366
#_index: "academ_contributions"
#_id: "13713"
#_source: array:18 [
"id" => "13713"
"slug" => "13713-freight-on-transit-for-urban-last-mile-deliveries-a-strategic-planning-approach"
"yearMonth" => "2023-03"
"year" => "2023"
"title" => "Freight-on-Transit for urban last-mile deliveries: A strategic planning approach"
"description" => "DELLE DONNE, D., ARCHETTI, C., ALFANDARI, L. et LJUBIC, I. (2023). Freight-on-Transit for urban last-mile deliveries: A strategic planning approach. <i>Transportation Research Part B: Methodological</i>, 169, pp. 53-81. DELLE DONNE, D., ARCHETTI, C., ALFANDARI, L. et LJUBIC, I. (2023). Freight-on-Transit for urban last "
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Freight-on-Transit"
1 => "Network flow"
2 => "Column generation"
3 => "Mixed integer linear programming"
]
"updatedAt" => "2023-02-09 01:00:51"
"publicationUrl" => "https://doi.org/10.1016/j.trb.2023.01.004"
"publicationInfo" => array:3 [
"pages" => "53-81"
"volume" => "169"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study a delivery strategy for last-mile deliveries in urban areas which combines freight transportation with mass mobility systems with the goal of creating synergies contrasting negative externalities caused by transportation. The idea is to use the residual capacity on public transport means for moving freight within the city. In particular, the system is such that parcels are first transported from origins (central distribution centers) to drop-in stations, which are stop locations on public vehicle itineraries. Then, they are transported on public vehicles to drop-out stations, from where they are delivered to destination by green vehicles (such as bikes, drones, porters, etc.). The system is known as Freight-On-Transit (FOT). In this paper, we focus on the strategic decisions related to defining the public transportation network that will take part in the delivery system, i.e., which public vehicle lines and stop locations will be included (and thus equipped for the service). We propose different formulations for the problem and effective heuristic solution approaches based on column generation. We perform exhaustive tests aimed at providing managerial insights on the performance and the efficiency of the system. We study a delivery strategy for last-mile deliveries in urban areas which combines freight transpor "
"en" => "We study a delivery strategy for last-mile deliveries in urban areas which combines freight transportation with mass mobility systems with the goal of creating synergies contrasting negative externalities caused by transportation. The idea is to use the residual capacity on public transport means for moving freight within the city. In particular, the system is such that parcels are first transported from origins (central distribution centers) to drop-in stations, which are stop locations on public vehicle itineraries. Then, they are transported on public vehicles to drop-out stations, from where they are delivered to destination by green vehicles (such as bikes, drones, porters, etc.). The system is known as Freight-On-Transit (FOT). In this paper, we focus on the strategic decisions related to defining the public transportation network that will take part in the delivery system, i.e., which public vehicle lines and stop locations will be included (and thus equipped for the service). We propose different formulations for the problem and effective heuristic solution approaches based on column generation. We perform exhaustive tests aimed at providing managerial insights on the performance and the efficiency of the system. We study a delivery strategy for last-mile deliveries in urban areas which combines freight transpor "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
72 => Essec\Faculty\Model\Contribution {#2367
#_index: "academ_contributions"
#_id: "14206"
#_source: array:18 [
"id" => "14206"
"slug" => "14206-capacity-design-and-resource-allocation-in-online-food-delivery-platforms"
"yearMonth" => "2022-05"
"year" => "2022"
"title" => "Capacity Design and Resource Allocation in Online Food Delivery Platforms"
"description" => "ARCHETTI, C., ALFANDARI, L. et ALFANDARI, L. (2022). Capacity Design and Resource Allocation in Online Food Delivery Platforms. Dans: International Workshop on Freight Transportation and Logistics (Odysseus 2022). Tanger. ARCHETTI, C., ALFANDARI, L. et ALFANDARI, L. (2022). Capacity Design and Resource Allocation in Onli "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "International Workshop on Freight Transportation and Logistics (Odysseus 2022)"
"keywords" => []
"updatedAt" => "2023-07-21 01:00:39"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
73 => Essec\Faculty\Model\Contribution {#2368
#_index: "academ_contributions"
#_id: "14257"
#_source: array:18 [
"id" => "14257"
"slug" => "14257-a-tailored-benders-decomposition-approach-for-last-mile-delivery-with-autonomous-robots"
"yearMonth" => "2022-02"
"year" => "2022"
"title" => "A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots"
"description" => "ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2022). A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots. Dans: International Conference on Operations Research and Enterprise Systems (ICORES). Online. ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2022). A Tailored Benders Decomposition Approach "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DE MELO DA SILVA Marcos"
]
]
"ouvrage" => "International Conference on Operations Research and Enterprise Systems (ICORES)"
"keywords" => []
"updatedAt" => "2023-08-29 13:21:46"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
74 => Essec\Faculty\Model\Contribution {#2369
#_index: "academ_contributions"
#_id: "14268"
#_source: array:18 [
"id" => "14268"
"slug" => "14268-designing-an-optimal-sequence-of-non%e2%80%90pharmaceutical-interventions-for-controlling-covid-19 14268-designing-an-optimal-sequence-of-non%e2%80%90pharmaceutical-interventions-for-controlling-covi "
"yearMonth" => "2022-12"
"year" => "2022"
"title" => "Designing an optimal sequence of non‐pharmaceutical interventions for controlling COVID-19"
"description" => "BISWAS, D. et ALFANDARI, L. (2022). Designing an optimal sequence of non‐pharmaceutical interventions for controlling COVID-19. <i>European Journal of Operational Research</i>, 303(3), pp. 1372-1391. BISWAS, D. et ALFANDARI, L. (2022). Designing an optimal sequence of non‐pharmaceutical intervention "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "BISWAS Debajyoti"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "OR in healthcare"
1 => "COVID-19"
2 => "Non-Pharmaceutical interventions"
3 => "Scheduling"
4 => "Integer programming"
]
"updatedAt" => "2023-08-30 10:46:26"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2022.03.052"
"publicationInfo" => array:3 [
"pages" => "1372-1391"
"volume" => "303"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The COVID-19 pandemic has had an unprecedented impact on global health and the economy since its inception in December, 2019 in Wuhan, China. Non-pharmaceutical interventions (NPI) like lockdowns and curfews have been deployed by affected countries for controlling the spread of infections. In this paper, we develop a Mixed Integer Non-Linear Programming (MINLP) epidemic model for computing the optimal sequence of NPIs over a planning horizon, considering shortages in doctors and hospital beds, under three different lockdown scenarios. We analyse two strategies - centralised (homogeneous decisions at the national level) and decentralised (decisions differentiated across regions), for two objectives separately - minimization of infections and deaths, using actual pandemic data of France. We linearize the quadratic constraints and objective functions in the MINLP model and convert it to a Mixed Integer Linear Programming (MILP) model. A major result that we show analytically is that under the epidemic model used, the optimal sequence of NPIs always follows a decreasing severity pattern. Using this property, we further simplify the MILP model into an Integer Linear Programming (ILP) model, reducing computational time up to 99%. Our numerical results show that a decentralised strategy is more effective in controlling infections for a given severity budget, yielding up to 20% lesser infections, 15% lesser deaths and 60% lesser shortages in healthcare resources. These results hold without considering logistics aspects and for a given level of compliance of the population. The COVID-19 pandemic has had an unprecedented impact on global health and the economy since its inc "
"en" => "The COVID-19 pandemic has had an unprecedented impact on global health and the economy since its inception in December, 2019 in Wuhan, China. Non-pharmaceutical interventions (NPI) like lockdowns and curfews have been deployed by affected countries for controlling the spread of infections. In this paper, we develop a Mixed Integer Non-Linear Programming (MINLP) epidemic model for computing the optimal sequence of NPIs over a planning horizon, considering shortages in doctors and hospital beds, under three different lockdown scenarios. We analyse two strategies - centralised (homogeneous decisions at the national level) and decentralised (decisions differentiated across regions), for two objectives separately - minimization of infections and deaths, using actual pandemic data of France. We linearize the quadratic constraints and objective functions in the MINLP model and convert it to a Mixed Integer Linear Programming (MILP) model. A major result that we show analytically is that under the epidemic model used, the optimal sequence of NPIs always follows a decreasing severity pattern. Using this property, we further simplify the MILP model into an Integer Linear Programming (ILP) model, reducing computational time up to 99%. Our numerical results show that a decentralised strategy is more effective in controlling infections for a given severity budget, yielding up to 20% lesser infections, 15% lesser deaths and 60% lesser shortages in healthcare resources. These results hold without considering logistics aspects and for a given level of compliance of the population. The COVID-19 pandemic has had an unprecedented impact on global health and the economy since its inc "
]
"authors_fields" => array:2 [
"fr" => "Autre discipline"
"en" => "Other Discipline"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
75 => Essec\Faculty\Model\Contribution {#2370
#_index: "academ_contributions"
#_id: "14360"
#_source: array:18 [
"id" => "14360"
"slug" => "14360-robust-facility-location-in-disaster-preparation-for-earthquakes-with-aftershocks"
"yearMonth" => "2023-09"
"year" => "2023"
"title" => "Robust Facility Location in Disaster Preparation for Earthquakes with Aftershocks"
"description" => "ALFANDARI, L., LJUBIC, I. et PUNAM-MANDAL, M. (2023). Robust Facility Location in Disaster Preparation for Earthquakes with Aftershocks. Dans: OR 2023: Decision Support & Choice-Based Analytics for a Disruptive World. Hamburg. ALFANDARI, L., LJUBIC, I. et PUNAM-MANDAL, M. (2023). Robust Facility Location in Disaster Preparati "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "PUNAM-MANDAL M"
]
]
"ouvrage" => "OR 2023: Decision Support & Choice-Based Analytics for a Disruptive World"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
76 => Essec\Faculty\Model\Contribution {#2371
#_index: "academ_contributions"
#_id: "14369"
#_source: array:18 [
"id" => "14369"
"slug" => "14369-approximation-of-the-double-traveling-salesman-problem-with-multiple-stacks"
"yearMonth" => "2023-07"
"year" => "2023"
"title" => "Approximation of the Double Traveling Salesman Problem with Multiple Stacks"
"description" => "ALFANDARI, L. (2023). Approximation of the Double Traveling Salesman Problem with Multiple Stacks. Dans: 23rd Congress of International Federation of Operational Research Societies (IFORS) 2023. Santiago de Chile. ALFANDARI, L. (2023). Approximation of the Double Traveling Salesman Problem with Multiple Stacks. D "
"authors" => array:1 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
]
"ouvrage" => "23rd Congress of International Federation of Operational Research Societies (IFORS) 2023"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
77 => Essec\Faculty\Model\Contribution {#2372
#_index: "academ_contributions"
#_id: "14413"
#_source: array:18 [
"id" => "14413"
"slug" => "14413-a-branch-and-price-approach-for-last-mile-deliveries-with-capacitated-robot-stations"
"yearMonth" => "2023-07"
"year" => "2023"
"title" => "A Branch-and-price Approach for Last-mile Deliveries with Capacitated Robot Stations"
"description" => "DELLE DONNE, D., KUZBAKOV, Y. et ALFANDARI, L. (2023). A Branch-and-price Approach for Last-mile Deliveries with Capacitated Robot Stations. Dans: 23rd Conference of the International Federation of Operational Research Societies 2023. Santiago. DELLE DONNE, D., KUZBAKOV, Y. et ALFANDARI, L. (2023). A Branch-and-price Approach for Last-mile Del "
"authors" => array:3 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:1 [
"name" => "KUZBAKOV Yerlan"
]
]
"ouvrage" => "23rd Conference of the International Federation of Operational Research Societies 2023"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
78 => Essec\Faculty\Model\Contribution {#2373
#_index: "academ_contributions"
#_id: "14483"
#_source: array:18 [
"id" => "14483"
"slug" => "14483-when-public-transport-delivers"
"yearMonth" => "2023-09"
"year" => "2023"
"title" => "When public transport delivers"
"description" => "DELLE DONNE, D., ARCHETTI, C., LJUBIC, I. et ALFANDARI, L. (2023). When public transport delivers. <i>ESSEC Knowledge</i>. DELLE DONNE, D., ARCHETTI, C., LJUBIC, I. et ALFANDARI, L. (2023). When public transport delivers. < "
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://knowledge.essec.edu/en/sustainability/when-public-transport-delivers.html"
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles ou vidéos de vulgarisation"
"en" => "Press article, video or other popular media"
]
"support_type" => array:2 [
"fr" => "Presse"
"en" => "Press"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "E-commerce is now part of the consumer experience – why brave a busy mall when you could get your shopping delivered to your doorstep, and return it for free if you don’t like it? This trend has exploded: in the US, e-commerce consumer spending is projected to reach one trillion USD (1), and in China, over 40 billion packages were delivered in 2017 (2). While undeniably practical for the consumer, this presents challenges for the companies and for the environment, since consumers expect fast delivery and this can be a costly process. This results in an abundance of commercial vehicles traveling to make home deliveries: an unsustainable system both in terms of feasibility and environmental impact. These commercial vehicles add to pollution and traffic congestion. The authors explored the challenges of last-mile delivery (the last leg of the distribution process) and how emerging technologies, including AI, can play a role in reducing the pollution caused by urban freight transportation. In their latest paper published in Transportation Research Part B (3), they explore the possibility of using “freight-on-transit” delivery methods: using public transportation to transport packages in big cities. E-commerce is now part of the consumer experience – why brave a busy mall when you could get your sh "
"en" => "E-commerce is now part of the consumer experience – why brave a busy mall when you could get your shopping delivered to your doorstep, and return it for free if you don’t like it? This trend has exploded: in the US, e-commerce consumer spending is projected to reach one trillion USD (1), and in China, over 40 billion packages were delivered in 2017 (2). While undeniably practical for the consumer, this presents challenges for the companies and for the environment, since consumers expect fast delivery and this can be a costly process. This results in an abundance of commercial vehicles traveling to make home deliveries: an unsustainable system both in terms of feasibility and environmental impact. These commercial vehicles add to pollution and traffic congestion. The authors explored the challenges of last-mile delivery (the last leg of the distribution process) and how emerging technologies, including AI, can play a role in reducing the pollution caused by urban freight transportation. In their latest paper published in Transportation Research Part B (3), they explore the possibility of using “freight-on-transit” delivery methods: using public transportation to transport packages in big cities. E-commerce is now part of the consumer experience – why brave a busy mall when you could get your sh "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
79 => Essec\Faculty\Model\Contribution {#2374
#_index: "academ_contributions"
#_id: "14781"
#_source: array:18 [
"id" => "14781"
"slug" => "14781-a-triple-bottom-line-optimization-model-for-assignment-and-routing-of-on-demand-home-services"
"yearMonth" => "2024-07"
"year" => "2024"
"title" => "A Triple Bottom Line optimization model for assignment and routing of on-demand home services"
"description" => "BISWAS, D., ALFANDARI, L. et ARCHETTI, C. (2024). A Triple Bottom Line optimization model for assignment and routing of on-demand home services. <i>Computers & Operations Research</i>, 167, pp. 106644. BISWAS, D., ALFANDARI, L. et ARCHETTI, C. (2024). A Triple Bottom Line optimization model for assign "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "Biswas Debajyoti"
]
2 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "On demand services"
1 => "Scheduling"
2 => "Triple bottom line"
3 => "Integer programming"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2024.106644"
"publicationInfo" => array:3 [
"pages" => "106644"
"volume" => "167"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "'On-demand home services’ is a fast-growing industry where online platforms match independent service professionals with customers seeking aid for household tasks. In this paper, we study the assignment and routing of service professionals for serving customers of an on-demand home services platform considering the Triple Bottom Line (TBL) criteria for ensuring sustainability in operations. We characterise this as the Home Services Assignment and Routing Problem with the Triple Bottom Line (HSARP-TBL) and implement a Mixed Integer Linear Programming (MILP) model for solving it. We assign service professionals to customers based on their desired time slots and also transport modes for each customer visit by a professional, considering either combinations of public transport or a personal vehicle for each professional’s tour. The objective is to minimize costs due to time window violations and uncovered customers, catering to the economic pillar of the TBL. We incorporate additional constraints related to the TBL by improving customer satisfaction based on the ratings of assigned professionals to customers, with and without subscription (economic), controlling emissions due to transportation of professionals (environmental) and ensuring equity in service allocation and net earnings between professionals (social). For tackling large instances we implement a Hybrid Genetic Search (HGS) algorithm adapting it to our problem setting. We demonstrate that the HGS outperforms the MILP model systematically for large instances in terms of solution value and computational time. Finally, we observe that for some instances, without worsening the primary economic objective, all the TBL indicators can be improved. 'On-demand home services’ is a fast-growing industry where online platforms match independent servic "
"en" => "'On-demand home services’ is a fast-growing industry where online platforms match independent service professionals with customers seeking aid for household tasks. In this paper, we study the assignment and routing of service professionals for serving customers of an on-demand home services platform considering the Triple Bottom Line (TBL) criteria for ensuring sustainability in operations. We characterise this as the Home Services Assignment and Routing Problem with the Triple Bottom Line (HSARP-TBL) and implement a Mixed Integer Linear Programming (MILP) model for solving it. We assign service professionals to customers based on their desired time slots and also transport modes for each customer visit by a professional, considering either combinations of public transport or a personal vehicle for each professional’s tour. The objective is to minimize costs due to time window violations and uncovered customers, catering to the economic pillar of the TBL. We incorporate additional constraints related to the TBL by improving customer satisfaction based on the ratings of assigned professionals to customers, with and without subscription (economic), controlling emissions due to transportation of professionals (environmental) and ensuring equity in service allocation and net earnings between professionals (social). For tackling large instances we implement a Hybrid Genetic Search (HGS) algorithm adapting it to our problem setting. We demonstrate that the HGS outperforms the MILP model systematically for large instances in terms of solution value and computational time. Finally, we observe that for some instances, without worsening the primary economic objective, all the TBL indicators can be improved. 'On-demand home services’ is a fast-growing industry where online platforms match independent servic "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
80 => Essec\Faculty\Model\Contribution {#2375
#_index: "academ_contributions"
#_id: "14887"
#_source: array:18 [
"id" => "14887"
"slug" => "14887-robust-facility-location-for-earthquake-preparedness-with-aftershocks"
"yearMonth" => "2024-04"
"year" => "2024"
"title" => "Robust facility location for earthquake preparedness with aftershocks"
"description" => "ALFANDARI, L., LJUBIC, I. et PUNAM-MANDAL, M. (2024). Robust facility location for earthquake preparedness with aftershocks. Dans: 2024 Optimisation au deuxième niveau (Centre International de Rencontres Mathématiques). Marseille. ALFANDARI, L., LJUBIC, I. et PUNAM-MANDAL, M. (2024). Robust facility location for earthquake prepar "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "PUNAM-MANDAL Minakshi"
]
]
"ouvrage" => "2024 Optimisation au deuxième niveau (Centre International de Rencontres Mathématiques)"
"keywords" => []
"updatedAt" => "2024-07-10 01:01:22"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
81 => Essec\Faculty\Model\Contribution {#2376
#_index: "academ_contributions"
#_id: "14919"
#_source: array:18 [
"id" => "14919"
"slug" => "14919-fractional-programming-for-assortment-optimization"
"yearMonth" => "2024-05"
"year" => "2024"
"title" => "Fractional programming for Assortment optimization"
"description" => "ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2024). Fractional programming for Assortment optimization. Dans: 2024 International Symposium on Combinatorial Optimization (ISCO). Tenerife. ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2024). Fractional programming for Assortment optimizat "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "HASSANZADEH Alborz"
]
]
"ouvrage" => "2024 International Symposium on Combinatorial Optimization (ISCO)"
"keywords" => []
"updatedAt" => "2024-07-10 01:01:23"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
82 => Essec\Faculty\Model\Contribution {#2377
#_index: "academ_contributions"
#_id: "15016"
#_source: array:18 [
"id" => "15016"
"slug" => "15016-a-column-generation-approach-for-last-mile-deliveries-with-capacitated-robot-stations"
"yearMonth" => "2024-05"
"year" => "2024"
"title" => "A column generation approach for last-mile deliveries with capacitated robot stations"
"description" => "DELLE DONNE, D., ALFANDARI, L. et KUZBAKOV, Y. (2024). A column generation approach for last-mile deliveries with capacitated robot stations. Dans: International Symposium on Combinatorial Optimization (ISCO). Tenerife, Spain. DELLE DONNE, D., ALFANDARI, L. et KUZBAKOV, Y. (2024). A column generation approach for last-mile de "
"authors" => array:3 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:1 [
"name" => "KUZBAKOV Yerlan"
]
]
"ouvrage" => "International Symposium on Combinatorial Optimization (ISCO)"
"keywords" => []
"updatedAt" => "2024-07-31 12:38:56"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
83 => Essec\Faculty\Model\Contribution {#2378
#_index: "academ_contributions"
#_id: "15394"
#_source: array:18 [
"id" => "15394"
"slug" => "15394-stochastic-scheduling-and-routing-decisions-in-online-meal-delivery-platforms-with-mixed-force"
"yearMonth" => "2025-05"
"year" => "2025"
"title" => "Stochastic scheduling and routing decisions in online meal delivery platforms with mixed force"
"description" => "ZHAO, Y., ALFANDARI, L. et ARCHETTI, C. (2025). Stochastic scheduling and routing decisions in online meal delivery platforms with mixed force. <i>European Journal of Operational Research</i>, 323(1), pp. 139-152. ZHAO, Y., ALFANDARI, L. et ARCHETTI, C. (2025). Stochastic scheduling and routing decisions in onlin "
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "Zhao Yanlu"
]
2 => array:1 [
"name" => "Archetti Claudia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Routing"
1 => "Online meal delivery"
2 => "Scheduling and routing decisions"
3 => "Mixed delivery force"
4 => "Markov decision process"
]
"updatedAt" => "2025-03-26 11:05:22"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2024.11.028"
"publicationInfo" => array:3 [
"pages" => "139-152"
"volume" => "323"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This paper investigates stochastic scheduling and routing problems in the online meal delivery (OMD) service. The huge increase in meal delivery demand requires the service providers to construct a highly efficient logistics network to deal with a large-volume of time-sensitive and fluctuating fulfillment, often using inhouse and crowdsourced drivers to secure the ambitious service quality. We aim to address the problem of developing an effective scheduling and routing policy that can handle real-life situations. To this end, we first model the dynamic problem as a Markov Decision Process (MDP) and analyze the structural properties of the optimal policy. Then we propose four integrated approaches to solve the operational level scheduling and routing problem. In addition, we provide a continuous approximation formula to estimate the bounds of required fleet size for the inhouse drivers. Numerical experiments based on a real dataset show the effectiveness of the proposed solution approaches. We also obtain several managerial insights that can help decision makers in solving similar resource allocation problems in real-time. This paper investigates stochastic scheduling and routing problems in the online meal delivery (OMD) "
"en" => "This paper investigates stochastic scheduling and routing problems in the online meal delivery (OMD) service. The huge increase in meal delivery demand requires the service providers to construct a highly efficient logistics network to deal with a large-volume of time-sensitive and fluctuating fulfillment, often using inhouse and crowdsourced drivers to secure the ambitious service quality. We aim to address the problem of developing an effective scheduling and routing policy that can handle real-life situations. To this end, we first model the dynamic problem as a Markov Decision Process (MDP) and analyze the structural properties of the optimal policy. Then we propose four integrated approaches to solve the operational level scheduling and routing problem. In addition, we provide a continuous approximation formula to estimate the bounds of required fleet size for the inhouse drivers. Numerical experiments based on a real dataset show the effectiveness of the proposed solution approaches. We also obtain several managerial insights that can help decision makers in solving similar resource allocation problems in real-time. This paper investigates stochastic scheduling and routing problems in the online meal delivery (OMD) "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
84 => Essec\Faculty\Model\Contribution {#2379
#_index: "academ_contributions"
#_id: "15563"
#_source: array:18 [
"id" => "15563"
"slug" => "15563-a-genetic-approach-to-the-operational-freight-on-transit-problem"
"yearMonth" => "2025-04"
"year" => "2025"
"title" => "A Genetic Approach to the Operational Freight-on-Transit Problem"
"description" => "JUVIGNY, C., DELLE DONNE, D. et ALFANDARI, L. (2025). A Genetic Approach to the Operational Freight-on-Transit Problem. Dans: <i>Evolutionary Computation in Combinatorial Optimization</i>. Springer Cham, pp. 116-132. JUVIGNY, C., DELLE DONNE, D. et ALFANDARI, L. (2025). A Genetic Approach to the Operational Freight- "
"authors" => array:3 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:1 [
"name" => "JUVIGNY Corentin"
]
]
"ouvrage" => "Evolutionary Computation in Combinatorial Optimization"
"keywords" => []
"updatedAt" => "2025-04-03 01:00:50"
"publicationUrl" => "https://doi.org/10.1007/978-3-031-86849-8_8"
"publicationInfo" => array:3 [
"pages" => "116-132"
"volume" => "2025"
"number" => ""
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Last-mile delivery problems have become a subject of increasing academic study in recent years. This paper examines the operational level Three-Tier Delivery Problem with Public Transportation (3T-DPPT), which concerns the conveyance of customers’ parcels from a warehouse, typically situated outside the city, to the customers in the city center, using public transport vehicles as an intermediate leg. The parcels are conveyed from the depot to public transport stops, then taken into the city center by public transportation vehicles, and finally delivered to the customers by freighters using green and lightweight means (or even walking). In this paper, we introduce a genetic algorithm (GA) to address the resolution of large-scale instances, which exact approaches in practice cannot tackle. We provide a detailed account of its encoding and the distinct genetic operators tailored for it. We undertake a comparative analysis of its performance vis-à-vis that of a compact mixed-integer linear programming formulation on a diverse array of instances of various sizes. The outcomes underscore the efficacy and robustness of the GA approach across different instance sizes, yielding solutions that are near the optimal ones in a relatively short span of time. Last-mile delivery problems have become a subject of increasing academic study in recent years. This "
"en" => "Last-mile delivery problems have become a subject of increasing academic study in recent years. This paper examines the operational level Three-Tier Delivery Problem with Public Transportation (3T-DPPT), which concerns the conveyance of customers’ parcels from a warehouse, typically situated outside the city, to the customers in the city center, using public transport vehicles as an intermediate leg. The parcels are conveyed from the depot to public transport stops, then taken into the city center by public transportation vehicles, and finally delivered to the customers by freighters using green and lightweight means (or even walking). In this paper, we introduce a genetic algorithm (GA) to address the resolution of large-scale instances, which exact approaches in practice cannot tackle. We provide a detailed account of its encoding and the distinct genetic operators tailored for it. We undertake a comparative analysis of its performance vis-à-vis that of a compact mixed-integer linear programming formulation on a diverse array of instances of various sizes. The outcomes underscore the efficacy and robustness of the GA approach across different instance sizes, yielding solutions that are near the optimal ones in a relatively short span of time. Last-mile delivery problems have become a subject of increasing academic study in recent years. This "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T20:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.9226046
+"parent": null
}
]
"avatar" => "https://faculty.essec.edu/wp-content/uploads/avatars/B00000901.jpg"
"contributionCounts" => 85
"personalLinks" => array:2 [
0 => "<a href="https://orcid.org/0000-0001-6751-3650" target="_blank">ORCID</a>"
1 => "<a href="https://scholar.google.com/citations?user=zUsKlrMAAAAJ" target="_blank">Google scholar</a>"
]
"docTitle" => "Laurent ALFANDARI"
"docSubtitle" => "Professeur"
"docDescription" => "Département: Systèmes d'Information, Data Analytics et Opérations<br>Campus de Cergy"
"docType" => "cv"
"docPreview" => "<img src="https://faculty.essec.edu/wp-content/uploads/avatars/B00000901.jpg"><span><span>Laurent ALFANDARI</span><span>B00000901</span></span> <img src="https://faculty.essec.edu/wp-content/uploads/avatars/B00000901.jpg"><span><span>Laurent AL "
"academ_cv_info" => ""
]
#_index: "academ_cv"
+lang: "fr"
+"_type": "_doc"
+"_score": 5.0369525
+"parent": null
}
