Essec\Faculty\Model\Profile {#2190
#_id: "B00773540"
#_source: array:38 [
"bid" => "B00773540"
"slug" => "archetti-claudia"
"fullName" => "Claudia ARCHETTI"
"lastName" => "ARCHETTI"
"firstName" => "Claudia"
"title" => array:2 [
"fr" => "Professeur"
"en" => "Professor"
]
"email" => "claudia.archetti@essec.edu"
"status" => "ACTIF"
"campus" => "Campus de Cergy"
"departments" => []
"phone" => "+33 (0) 1 34 43 39 08"
"sites" => []
"facNumber" => "1925"
"externalCvUrl" => "https://faculty.essec.edu/en/cv/archetti-claudia/pdf"
"googleScholarUrl" => "https://scholar.google.com/citations?user=43HuqNMAAAAJ"
"facOrcId" => "https://orcid.org/0000-0002-3524-1600"
"career" => array:5 [
0 => Essec\Faculty\Model\CareerItem {#2239
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2019-09-01"
"endDate" => "2021-08-31"
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur Associé en Recherche Operationelle"
"en" => "Associate Professor in Operations Research"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
1 => Essec\Faculty\Model\CareerItem {#2240
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2005-01-01"
"endDate" => "2014-01-01"
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur assistant en Recherche Operationelle"
"en" => "Assistant Professor in Operations Research"
]
"institution" => array:2 [
"fr" => "Università degli Studi di Brescia"
"en" => "Università degli Studi di Brescia"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
2 => Essec\Faculty\Model\CareerItem {#2241
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2014-01-01"
"endDate" => "2019-08-31"
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur associé en Recherche Operationelle"
"en" => "Associate Professor in Operations Research"
]
"institution" => array:2 [
"fr" => "Università degli Studi di Brescia"
"en" => "Università degli Studi di Brescia"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
3 => Essec\Faculty\Model\CareerItem {#2242
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2021-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: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
4 => Essec\Faculty\Model\CareerItem {#2243
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2022-09-01"
"endDate" => "2025-08-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other appointments"
"fr" => "Autres positions"
]
"label" => array:2 [
"fr" => "Doyen Associé en charge des Chaires et Centres d'Excellence"
"en" => "Associate Dean in charge of Chairs and Excellence Centers"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
]
"diplomes" => array:2 [
0 => Essec\Faculty\Model\Diplome {#2192
#_index: null
#_id: null
#_source: array:5 [
"diplome" => "DIPLOMA"
"year" => "2002"
"label" => array:2 [
"fr" => "PhD en Méthodes de Calcul pour les Décisions et les Prévisions Economiques et Financières"
"en" => "PhD en Méthodes de Calcul pour les Décisions et les Prévisions Economiques et Financières"
]
"institution" => array:2 [
"fr" => "Università degli studi di Bergamo"
"en" => "Università degli studi di Bergamo"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
1 => Essec\Faculty\Model\Diplome {#2194
#_index: null
#_id: null
#_source: array:5 [
"diplome" => "DIPLOMA"
"year" => "2017"
"label" => array:2 [
"fr" => "Qualification de Professeur Titulaire en Recherche Opérationnelle du Ministère Italien de l'Education"
"en" => "Qualification de Professeur Titulaire en Recherche Opérationnelle du Ministère Italien de l'Education"
]
"institution" => array:2 [
"fr" => "Italian Ministry of Education"
"en" => "Italian Ministry of Education"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
]
"bio" => array:2 [
"fr" => """
<p> </p>\n
\n
<p>Claudia Archetti is Full Professor of Operations Research. She is member of the Operations Management & Operations Research (OMOR) Research Cluster. From September 2022, she is Associate Dean of Chairs at ESSEC.</p>\n
\n
<p>She teaches Decision Analytics, Optimimization for Decision Making, Introduction to Optimization and Math Refresher in ESSEC MSc and PhD programs. Prior to joining ESSEC in 2019, she was appointed at the University of Brescia as Assistant Professor in 2005 and as Associate Professor in 2014.</p>\n
\n
<p>Her research interests include models and algorithms for vehicle routing problems; mixed integer mathematical programming models for the minimization of the sum of inventory and transportation costs in logistic networks; exact and heuristic algorithms for supply-chain management; reoptimization of combinatorial optimization problems.</p>\n
\n
<p>Claudia Archetti has carried out the scientific activity in collaboration with Italian and foreign colleagues and published joint papers with some of the best researchers at the international level.</p>\n
\n
<p>She is author of more than 90 papers in international journals. She was EURO VIP 3, in charge on piblications and communication. She was Area Editor of Computers and Operations Research. She is co-Editor in Chief of Networks and member of the Editorial Board of European Journal of Operational Research and EURO Journal on Computational Optimizartion. </p>\n
\n
<p>Click <a href="https://www.unibs.it/sites/default/files/ugov_cvfiles/ugov_cvpersona_en_00000000003039.pdf" target="_blank">here</a> for the full list of publications, seminars, conferences and projects.</p>\n
\n
<p>Click <a href="https://scholar.google.it/citations?user=43HuqNMAAAAJ&hl=it&oi=ao" target="_blank">here</a> for Google Scholar profile.</p>\n
\n
<p> </p>
"""
"en" => """
<p>Claudia Archetti is Full Professor of Operations Research. She is member of the Operations Management & Operations Research (OMOR) Research Cluster. From September 2022, she is Associate Dean of Chairs at ESSEC.</p>\n
\n
<p>She teaches Decision Analytics, Optimimization for Decision Making, Introduction to Optimization and Math Refresher in ESSEC MSc and PhD programs. Prior to joining ESSEC in 2019, she was appointed at the University of Brescia as Assistant Professor in 2005 and as Associate Professor in 2014.</p>\n
\n
<p>Her research interests include models and algorithms for vehicle routing problems; mixed integer mathematical programming models for the minimization of the sum of inventory and transportation costs in logistic networks; exact and heuristic algorithms for supply-chain management; reoptimization of combinatorial optimization problems.</p>\n
\n
<p>Claudia Archetti has carried out the scientific activity in collaboration with Italian and foreign colleagues and published joint papers with some of the best researchers at the international level.</p>\n
\n
<p>She is author of more than 90 papers in international journals. She was EURO VIP 3, in charge on piblications and communication. She was Area Editor of Computers and Operations Research. She is co-Editor in Chief of Networks and member of the Editorial Board of European Journal of Operational Research and EURO Journal on Computational Optimizartion. </p>\n
\n
<p>Click <a href="https://www.unibs.it/sites/default/files/ugov_cvfiles/ugov_cvpersona_en_00000000003039.pdf" target="_blank">here</a> for the full list of publications, seminars, conferences and projects.</p>\n
\n
<p>Click <a href="https://scholar.google.it/citations?user=43HuqNMAAAAJ&hl=it&oi=ao" target="_blank">here</a> for Google Scholar profile.</p>
"""
]
"department" => array:2 [
"fr" => "Systèmes d’information, sciences de la décision et statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"site" => array:2 [
"fr" => ""
"en" => ""
]
"industrrySectors" => array:2 [
"fr" => null
"en" => null
]
"researchFields" => array:2 [
"fr" => "Sciences de la décision - Systèmes d'aide à la décision - Mathématiques - Recherche opérationnelle"
"en" => "Decision Sciences - Decision Support Systems - Mathematics - Operations Research"
]
"teachingFields" => array:2 [
"fr" => null
"en" => null
]
"distinctions" => []
"teaching" => array:38 [
0 => Essec\Faculty\Model\TeachingItem {#2201
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2018"
"program" => null
"label" => array:2 [
"fr" => "The Flexible Periodic Vehicle Routing Problem: Modeling Alternatives and solution techniques"
"en" => "The Flexible Periodic Vehicle Routing Problem: Modeling Alternatives and solution techniques"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Universitat Politècnica de Catalunya"
"en" => "Universitat Politècnica de Catalunya"
]
"country" => array:2 [
"fr" => "Espagne"
"en" => "Spain"
]
]
+lang: "en"
}
1 => Essec\Faculty\Model\TeachingItem {#2202
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2020"
"program" => null
"label" => array:2 [
"fr" => "Optimization Problems for Freight Forwarding Companies"
"en" => "Optimization Problems for Freight Forwarding Companies"
]
"type" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Università degli studi di Bergamo"
"en" => "Università degli studi di Bergamo"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
}
2 => Essec\Faculty\Model\TeachingItem {#2203
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Optimization models for omnichannel retail distribution"
"en" => "Optimization models for omnichannel retail distribution"
]
"type" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Università degli Studi di Brescia"
"en" => "Università degli Studi di Brescia"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
}
3 => Essec\Faculty\Model\TeachingItem {#2204
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Title still to define"
"en" => "Title still to define"
]
"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: "en"
}
4 => Essec\Faculty\Model\TeachingItem {#2205
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => ""
"en" => ""
]
"type" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Università degli Studi di Brescia"
"en" => "Università degli Studi di Brescia"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
}
5 => Essec\Faculty\Model\TeachingItem {#2206
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2012"
"program" => null
"label" => array:2 [
"fr" => """
Optimization of maritime routing and\n
scheduling problems with complicating\n
inter-route constraints
"""
"en" => """
Optimization of maritime routing and\n
scheduling problems with complicating\n
inter-route constraints
"""
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Norwegian University Of Science and Technology"
"en" => "Norwegian University Of Science and Technology"
]
"country" => array:2 [
"fr" => "Norvège"
"en" => "Norway"
]
]
+lang: "en"
}
6 => Essec\Faculty\Model\TeachingItem {#2207
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2013"
"program" => null
"label" => array:2 [
"fr" => "Swapping and repositioning"
"en" => "Swapping and repositioning"
]
"type" => array:2 [
"fr" => "Rapporteur"
"en" => "Thesis referee"
]
"institution" => array:2 [
"fr" => "Tel Aviv University"
"en" => "Tel Aviv University"
]
"country" => array:2 [
"fr" => "Israël"
"en" => "Israel"
]
]
+lang: "en"
}
7 => Essec\Faculty\Model\TeachingItem {#2208
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2015"
"program" => null
"label" => array:2 [
"fr" => "Optimization models and methods for maritime cargo and inventory routing problems"
"en" => "Optimization models and methods for maritime cargo and inventory routing problems"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Norwegian University Of Science and Technology"
"en" => "Norwegian University Of Science and Technology"
]
"country" => array:2 [
"fr" => "Norvège"
"en" => "Norway"
]
]
+lang: "en"
}
8 => Essec\Faculty\Model\TeachingItem {#2209
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2016"
"program" => null
"label" => array:2 [
"fr" => "Contributions to column-generation approaches in combinatorial optimization"
"en" => "Contributions to column-generation approaches in combinatorial optimization"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "University of Mainz"
"en" => "University of Mainz"
]
"country" => array:2 [
"fr" => "Allemagne"
"en" => "Germany"
]
]
+lang: "en"
}
9 => Essec\Faculty\Model\TeachingItem {#2210
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2016"
"program" => null
"label" => array:2 [
"fr" => "The split-demand one-commodity pickup-and-delivery travelling salesman problem"
"en" => "The split-demand one-commodity pickup-and-delivery travelling salesman problem"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "University of La Laguna"
"en" => "University of La Laguna"
]
"country" => array:2 [
"fr" => "Espagne"
"en" => "Spain"
]
]
+lang: "en"
}
10 => Essec\Faculty\Model\TeachingItem {#2211
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2016"
"program" => null
"label" => array:2 [
"fr" => "Supply chain optimization: location, production, inventory and distribution"
"en" => "Supply chain optimization: location, production, inventory and distribution"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université Laval"
"en" => "Université Laval"
]
"country" => array:2 [
"fr" => "Canada"
"en" => "Canada"
]
]
+lang: "en"
}
11 => Essec\Faculty\Model\TeachingItem {#2212
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2017"
"program" => null
"label" => array:2 [
"fr" => "Vehicle Routing Problems with Road-Network information"
"en" => "Vehicle Routing Problems with Road-Network information"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "École des Mines de Saint-Etienne"
"en" => "École des Mines de Saint-Etienne"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
}
12 => Essec\Faculty\Model\TeachingItem {#2213
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2019"
"program" => null
"label" => array:2 [
"fr" => """
Designing Two-Echelon Distribution Networks under\n
Uncertainty
"""
"en" => """
Designing Two-Echelon Distribution Networks under\n
Uncertainty
"""
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université de bordeaux"
"en" => "Université de bordeaux"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
}
13 => Essec\Faculty\Model\TeachingItem {#2214
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2019"
"program" => null
"label" => array:2 [
"fr" => "Balanced Vehicle Routing: Models, Methods, Insights"
"en" => "Balanced Vehicle Routing: Models, Methods, Insights"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "en"
}
14 => Essec\Faculty\Model\TeachingItem {#2215
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2019"
"program" => null
"label" => array:2 [
"fr" => "Improving Distribution Efficiencyin Cash Supply Chains"
"en" => "Improving Distribution Efficiencyin Cash Supply Chains"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "University of Amsterdam"
"en" => "University of Amsterdam"
]
"country" => array:2 [
"fr" => "Pays-Bas"
"en" => "Netherlands"
]
]
+lang: "en"
}
15 => Essec\Faculty\Model\TeachingItem {#2216
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2019"
"program" => null
"label" => array:2 [
"fr" => "Models and algorithms for last mile delivery problems with multiple shipping options"
"en" => "Models and algorithms for last mile delivery problems with multiple shipping options"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "École Centrale Lille"
"en" => "École Centrale Lille"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
}
16 => Essec\Faculty\Model\TeachingItem {#2217
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2019"
"program" => null
"label" => array:2 [
"fr" => "Inventory routing problems on two-echelon systems: exact and heuristic methods for the tactical and operational problems"
"en" => "Inventory routing problems on two-echelon systems: exact and heuristic methods for the tactical and operational problems"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université Grenoble Alpes"
"en" => "Université Grenoble Alpes"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
}
17 => Essec\Faculty\Model\TeachingItem {#2218
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2020"
"program" => null
"label" => array:2 [
"fr" => "Solving a Multi-Attribute Vehicle Routing Problem in the freight delivery industry"
"en" => "Solving a Multi-Attribute Vehicle Routing Problem in the freight delivery industry"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "University of Padova"
"en" => "University of Padova"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
}
18 => Essec\Faculty\Model\TeachingItem {#2219
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2020"
"program" => null
"label" => array:2 [
"fr" => "Polyhedral Analysis and Branch and Cut Algorithm for Some Np-Hard Spanning Subgraph Problems"
"en" => "Polyhedral Analysis and Branch and Cut Algorithm for Some Np-Hard Spanning Subgraph Problems"
]
"type" => array:2 [
"fr" => "Rapporteur"
"en" => "Thesis referee"
]
"institution" => array:2 [
"fr" => "University of Salerno"
"en" => "University of Salerno"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
}
19 => Essec\Faculty\Model\TeachingItem {#2220
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Optimization models and algorithms for drone management in logistics"
"en" => "Optimization models and algorithms for drone management in logistics"
]
"type" => array:2 [
"fr" => "Rapporteur"
"en" => "Thesis referee"
]
"institution" => array:2 [
"fr" => "Università di Napoli Federico II"
"en" => "Università di Napoli Federico II"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
}
20 => Essec\Faculty\Model\TeachingItem {#2221
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2011"
"program" => null
"label" => array:2 [
"fr" => "Location and Distribution Problems: A General Approach"
"en" => "Location and Distribution Problems: A General Approach"
]
"type" => array:2 [
"fr" => "Rapporteur"
"en" => "Thesis referee"
]
"institution" => array:2 [
"fr" => "Universita degli studi di Milano"
"en" => "Universita degli studi di Milano"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
}
21 => Essec\Faculty\Model\TeachingItem {#2222
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Title still to define"
"en" => "Title still to define"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "École Centrale Lille"
"en" => "École Centrale Lille"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
}
22 => Essec\Faculty\Model\TeachingItem {#2223
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Optimization problems for autonomous vehicles"
"en" => "Optimization problems for autonomous vehicles"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "École des Mines de Saint-Etienne"
"en" => "École des Mines de Saint-Etienne"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
}
23 => Essec\Faculty\Model\TeachingItem {#2224
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Title to be defined"
"en" => "Title to be defined"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "University of Molise"
"en" => "University of Molise"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
}
24 => Essec\Faculty\Model\TeachingItem {#2225
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "To be defined"
"en" => "To be defined"
]
"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: "en"
}
25 => Essec\Faculty\Model\TeachingItem {#2226
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => ""
"en" => ""
]
"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: "en"
}
26 => Essec\Faculty\Model\TeachingItem {#2227
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2020"
"program" => null
"label" => array:2 [
"fr" => """
OPTIMIZATION MODELS AND ALGORITHMS FOR\n
DRONE MANAGEMENT IN LOGISTICS
"""
"en" => """
OPTIMIZATION MODELS AND ALGORITHMS FOR\n
DRONE MANAGEMENT IN LOGISTICS
"""
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
27 => Essec\Faculty\Model\TeachingItem {#2228
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2020"
"program" => null
"label" => array:2 [
"fr" => """
PROBLÈMES DE TOURNÉES DE VÉHICULES SUR DEUX\n
NIVEAUX POUR LA LOGISTIQUE URBAINE\n
Approches basées sur les méthodes exactes de l’optimisation\n
mathématique
"""
"en" => """
PROBLÈMES DE TOURNÉES DE VÉHICULES SUR DEUX\n
NIVEAUX POUR LA LOGISTIQUE URBAINE\n
Approches basées sur les méthodes exactes de l’optimisation\n
mathématique
"""
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
28 => Essec\Faculty\Model\TeachingItem {#2229
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2020"
"program" => null
"label" => array:2 [
"fr" => "Optimisation in Feeder and Liner Shipping Operations"
"en" => "Optimisation in Feeder and Liner Shipping Operations"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
29 => Essec\Faculty\Model\TeachingItem {#2230
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2021"
"program" => null
"label" => array:2 [
"fr" => """
Approches matheuristiques pour la résolution de problèmes\n
d’optimisation des transports en logistique urbaine
"""
"en" => """
Approches matheuristiques pour la résolution de problèmes\n
d’optimisation des transports en logistique urbaine
"""
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
30 => Essec\Faculty\Model\TeachingItem {#2231
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2021"
"program" => null
"label" => array:2 [
"fr" => "Cost Allocation in Collaborative Transportation"
"en" => "Cost Allocation in Collaborative Transportation"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
31 => Essec\Faculty\Model\TeachingItem {#2232
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2021"
"program" => null
"label" => array:2 [
"fr" => "Uncertainty in Crowd-Based Last-Mile Logistics"
"en" => "Uncertainty in Crowd-Based Last-Mile Logistics"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
32 => Essec\Faculty\Model\TeachingItem {#2233
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2022"
"program" => null
"label" => array:2 [
"fr" => "Metaheuristics for two-echelon routing problems"
"en" => "Metaheuristics for two-echelon routing problems"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "en"
}
33 => Essec\Faculty\Model\TeachingItem {#2234
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2023"
"program" => null
"label" => array:2 [
"fr" => "Analysis of integrated planning models in logistics"
"en" => "Analysis of integrated planning models in logistics"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
34 => Essec\Faculty\Model\TeachingItem {#2235
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2023"
"program" => null
"label" => array:2 [
"fr" => "Demand-based operations of vehicle sharing systems"
"en" => "Demand-based operations of vehicle sharing systems"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
35 => Essec\Faculty\Model\TeachingItem {#2236
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2023"
"program" => null
"label" => array:2 [
"fr" => "Three Essays on Assortment, Omnichannel Inventory, and Drone-Enabled Health Supply Chain Optimization"
"en" => "Three Essays on Assortment, Omnichannel Inventory, and Drone-Enabled Health Supply Chain Optimization"
]
"type" => array:2 [
"fr" => "Président de jury"
"en" => "Thesis jury president"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
}
36 => Essec\Faculty\Model\TeachingItem {#2237
#_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 services optimisation"
"en" => "Four Essays in Healthcare analytics, Insurance pricing and Home services optimisation"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
}
37 => Essec\Faculty\Model\TeachingItem {#2238
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Heuristic and exact algorithms for solving the electric autonomous dial-a-ride problem"
"en" => "Heuristic and exact algorithms for solving the electric autonomous dial-a-ride problem"
]
"type" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
}
]
"otherActivities" => array:9 [
0 => Essec\Faculty\Model\ExtraActivity {#2191
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2016-01-01"
"endDate" => "2018-12-31"
"year" => null
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Redactrice Secteur pour Computers and Operations Research"
"en" => "Area Editor of Computers and Operations Research"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
1 => Essec\Faculty\Model\ExtraActivity {#2195
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-10-23"
"endDate" => null
"year" => null
"uuid" => "103"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Membre d'un comité de lecture"
"en" => "Editorial Board Membership"
]
"label" => array:2 [
"fr" => "Membre du Conseil Editorial de European Journal of Operational Research"
"en" => "Member of the Editorial Board of European Journal of Operational Research"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
2 => Essec\Faculty\Model\ExtraActivity {#2189
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-02-13"
"endDate" => null
"year" => null
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Redacteur Associé de Transportation Science"
"en" => "Associate Editor of Transportation Science"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
3 => Essec\Faculty\Model\ExtraActivity {#2193
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-01-01"
"endDate" => null
"year" => null
"uuid" => "204"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Membre d'une association académique"
"en" => "Member of an academic association"
]
"label" => array:2 [
"fr" => "VIP3 de EURO, Association of European Operational Research Societies, en charge des publications et de la communication"
"en" => "VIP3 of EURO, the Association of European Operational Research Societies, in charge of publications and communication"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
4 => Essec\Faculty\Model\ExtraActivity {#2196
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2010-05-01"
"endDate" => null
"year" => null
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Redacteur Associé de Networks"
"en" => "Associate Editor for Networks"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
5 => Essec\Faculty\Model\ExtraActivity {#2197
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2020-08-11"
"endDate" => "2022-12-31"
"year" => null
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Redacteur Associé de Omega"
"en" => "Associate Editor for Omega"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
6 => Essec\Faculty\Model\ExtraActivity {#2198
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2020-05-14"
"endDate" => "2022-12-31"
"year" => null
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Redacteur Associé de TOP"
"en" => "Associate Editor for TOP"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
7 => Essec\Faculty\Model\ExtraActivity {#2199
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2021-07-06"
"endDate" => null
"year" => null
"uuid" => "203"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Rôle d’expert ou évaluateur dans une organisation de recherche"
"en" => "Role as an expert or appraisor in a research organization"
]
"label" => array:2 [
"fr" => "Interview from Elsevier"
"en" => "Interview from Elsevier"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
8 => Essec\Faculty\Model\ExtraActivity {#2200
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2023-01-01"
"endDate" => null
"year" => null
"uuid" => "101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Activités de recherche"
]
"subType" => array:2 [
"fr" => "Direction d'une revue - Rédacteur en chef"
"en" => "Chief Editor"
]
"label" => array:2 [
"fr" => "Editor in Chief"
"en" => "Editor in Chief"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
]
"theses" => array:38 [
0 => Essec\Faculty\Model\These {#2244
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "ANDREA DI PLACIDO A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Title to be defined"
"en" => "Title to be defined"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "University of Molise"
"en" => "University of Molise"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
1 => Essec\Faculty\Model\These {#2245
#_index: null
#_id: null
#_source: array:9 [
"year" => "2023"
"startDate" => null
"endDate" => "2023"
"student" => "ATAÇ S."
"firstJob" => ""
"label" => array:2 [
"fr" => "Demand-based operations of vehicle sharing systems"
"en" => "Demand-based operations of vehicle sharing systems"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
2 => Essec\Faculty\Model\These {#2246
#_index: null
#_id: null
#_source: array:9 [
"year" => "2019"
"startDate" => null
"endDate" => "2019"
"student" => "BALLER A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Improving Distribution Efficiencyin Cash Supply Chains"
"en" => "Improving Distribution Efficiencyin Cash Supply Chains"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "University of Amsterdam"
"en" => "University of Amsterdam"
]
"country" => array:2 [
"fr" => "Pays-Bas"
"en" => "Netherlands"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
3 => Essec\Faculty\Model\These {#2247
#_index: null
#_id: null
#_source: array:9 [
"year" => "2023"
"startDate" => null
"endDate" => "2023"
"student" => "BEN AHMED M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Analysis of integrated planning models in logistics"
"en" => "Analysis of integrated planning models in logistics"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
4 => Essec\Faculty\Model\These {#2248
#_index: null
#_id: null
#_source: array:9 [
"year" => "2019"
"startDate" => null
"endDate" => "2019"
"student" => "BEN MOHAMED I."
"firstJob" => ""
"label" => array:2 [
"fr" => """
Designing Two-Echelon Distribution Networks under\n
Uncertainty
"""
"en" => """
Designing Two-Echelon Distribution Networks under\n
Uncertainty
"""
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université de bordeaux"
"en" => "Université de bordeaux"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
5 => Essec\Faculty\Model\These {#2249
#_index: null
#_id: null
#_source: array:9 [
"year" => "2017"
"startDate" => null
"endDate" => "2017"
"student" => "BEN TICHA H."
"firstJob" => ""
"label" => array:2 [
"fr" => "Vehicle Routing Problems with Road-Network information"
"en" => "Vehicle Routing Problems with Road-Network information"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "École des Mines de Saint-Etienne"
"en" => "École des Mines de Saint-Etienne"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
6 => Essec\Faculty\Model\These {#2250
#_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 services optimisation"
"en" => "Four Essays in Healthcare analytics, Insurance pricing and Home services optimisation"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
7 => Essec\Faculty\Model\These {#2251
#_index: null
#_id: null
#_source: array:9 [
"year" => "2022"
"startDate" => null
"endDate" => "2022"
"student" => "BREUNIG U."
"firstJob" => ""
"label" => array:2 [
"fr" => "Metaheuristics for two-echelon routing problems"
"en" => "Metaheuristics for two-echelon routing problems"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
8 => Essec\Faculty\Model\These {#2252
#_index: null
#_id: null
#_source: array:9 [
"year" => "2016"
"startDate" => null
"endDate" => "2016"
"student" => "DARVISH M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Supply chain optimization: location, production, inventory and distribution"
"en" => "Supply chain optimization: location, production, inventory and distribution"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université Laval"
"en" => "Université Laval"
]
"country" => array:2 [
"fr" => "Canada"
"en" => "Canada"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
9 => Essec\Faculty\Model\These {#2253
#_index: null
#_id: null
#_source: array:9 [
"year" => "2021"
"startDate" => null
"endDate" => "2021"
"student" => "DUMEZ D."
"firstJob" => ""
"label" => array:2 [
"fr" => """
Approches matheuristiques pour la résolution de problèmes\n
d’optimisation des transports en logistique urbaine
"""
"en" => """
Approches matheuristiques pour la résolution de problèmes\n
d’optimisation des transports en logistique urbaine
"""
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
10 => Essec\Faculty\Model\These {#2254
#_index: null
#_id: null
#_source: array:9 [
"year" => "2019"
"startDate" => null
"endDate" => "2019"
"student" => "FARIAS DE ARAUJO K."
"firstJob" => ""
"label" => array:2 [
"fr" => "Inventory routing problems on two-echelon systems: exact and heuristic methods for the tactical and operational problems"
"en" => "Inventory routing problems on two-echelon systems: exact and heuristic methods for the tactical and operational problems"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université Grenoble Alpes"
"en" => "Université Grenoble Alpes"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
11 => Essec\Faculty\Model\These {#2255
#_index: null
#_id: null
#_source: array:9 [
"year" => "2020"
"startDate" => null
"endDate" => "2020"
"student" => "GASTALDON N."
"firstJob" => ""
"label" => array:2 [
"fr" => "Solving a Multi-Attribute Vehicle Routing Problem in the freight delivery industry"
"en" => "Solving a Multi-Attribute Vehicle Routing Problem in the freight delivery industry"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "University of Padova"
"en" => "University of Padova"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
12 => Essec\Faculty\Model\These {#2256
#_index: null
#_id: null
#_source: array:9 [
"year" => "2023"
"startDate" => null
"endDate" => "2023"
"student" => "HASSANZADEH A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Three Essays on Assortment, Omnichannel Inventory, and Drone-Enabled Health Supply Chain Optimization"
"en" => "Three Essays on Assortment, Omnichannel Inventory, and Drone-Enabled Health Supply Chain Optimization"
]
"role" => array:2 [
"fr" => "Président de jury"
"en" => "Thesis jury president"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
13 => Essec\Faculty\Model\These {#2257
#_index: null
#_id: null
#_source: array:9 [
"year" => "2015"
"startDate" => null
"endDate" => "2015"
"student" => "HEMMATI A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Optimization models and methods for maritime cargo and inventory routing problems"
"en" => "Optimization models and methods for maritime cargo and inventory routing problems"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Norwegian University Of Science and Technology"
"en" => "Norwegian University Of Science and Technology"
]
"country" => array:2 [
"fr" => "Norvège"
"en" => "Norway"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
14 => Essec\Faculty\Model\These {#2258
#_index: null
#_id: null
#_source: array:9 [
"year" => "2018"
"startDate" => null
"endDate" => "2018"
"student" => "HUERTA-MUNOZ D."
"firstJob" => ""
"label" => array:2 [
"fr" => "The Flexible Periodic Vehicle Routing Problem: Modeling Alternatives and solution techniques"
"en" => "The Flexible Periodic Vehicle Routing Problem: Modeling Alternatives and solution techniques"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Universitat Politècnica de Catalunya"
"en" => "Universitat Politècnica de Catalunya"
]
"country" => array:2 [
"fr" => "Espagne"
"en" => "Spain"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
15 => Essec\Faculty\Model\These {#2259
#_index: null
#_id: null
#_source: array:9 [
"year" => "2020"
"startDate" => null
"endDate" => "2020"
"student" => "LAUREANA F."
"firstJob" => ""
"label" => array:2 [
"fr" => "Polyhedral Analysis and Branch and Cut Algorithm for Some Np-Hard Spanning Subgraph Problems"
"en" => "Polyhedral Analysis and Branch and Cut Algorithm for Some Np-Hard Spanning Subgraph Problems"
]
"role" => array:2 [
"fr" => "Rapporteur"
"en" => "Thesis referee"
]
"institution" => array:2 [
"fr" => "University of Salerno"
"en" => "University of Salerno"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
16 => Essec\Faculty\Model\These {#2260
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "LI Y."
"firstJob" => ""
"label" => array:2 [
"fr" => ""
"en" => ""
]
"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: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
17 => Essec\Faculty\Model\These {#2261
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "MAMMADOV N."
"firstJob" => ""
"label" => array:2 [
"fr" => "Optimization models for omnichannel retail distribution"
"en" => "Optimization models for omnichannel retail distribution"
]
"role" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Università degli Studi di Brescia"
"en" => "Università degli Studi di Brescia"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
18 => Essec\Faculty\Model\These {#2262
#_index: null
#_id: null
#_source: array:9 [
"year" => "2020"
"startDate" => null
"endDate" => "2020"
"student" => "MARQUES G."
"firstJob" => ""
"label" => array:2 [
"fr" => """
PROBLÈMES DE TOURNÉES DE VÉHICULES SUR DEUX\n
NIVEAUX POUR LA LOGISTIQUE URBAINE\n
Approches basées sur les méthodes exactes de l’optimisation\n
mathématique
"""
"en" => """
PROBLÈMES DE TOURNÉES DE VÉHICULES SUR DEUX\n
NIVEAUX POUR LA LOGISTIQUE URBAINE\n
Approches basées sur les méthodes exactes de l’optimisation\n
mathématique
"""
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
19 => Essec\Faculty\Model\These {#2263
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "MARTINELLO M."
"firstJob" => ""
"label" => array:2 [
"fr" => ""
"en" => ""
]
"role" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Università degli Studi di Brescia"
"en" => "Università degli Studi di Brescia"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
20 => Essec\Faculty\Model\These {#2264
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "MASONE A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Optimization models and algorithms for drone management in logistics"
"en" => "Optimization models and algorithms for drone management in logistics"
]
"role" => array:2 [
"fr" => "Rapporteur"
"en" => "Thesis referee"
]
"institution" => array:2 [
"fr" => "Università di Napoli Federico II"
"en" => "Università di Napoli Federico II"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
21 => Essec\Faculty\Model\These {#2265
#_index: null
#_id: null
#_source: array:9 [
"year" => "2020"
"startDate" => null
"endDate" => "2020"
"student" => "MASONE A."
"firstJob" => ""
"label" => array:2 [
"fr" => """
OPTIMIZATION MODELS AND ALGORITHMS FOR\n
DRONE MANAGEMENT IN LOGISTICS
"""
"en" => """
OPTIMIZATION MODELS AND ALGORITHMS FOR\n
DRONE MANAGEMENT IN LOGISTICS
"""
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
22 => Essec\Faculty\Model\These {#2266
#_index: null
#_id: null
#_source: array:9 [
"year" => "2019"
"startDate" => null
"endDate" => "2019"
"student" => "MATL P."
"firstJob" => ""
"label" => array:2 [
"fr" => "Balanced Vehicle Routing: Models, Methods, Insights"
"en" => "Balanced Vehicle Routing: Models, Methods, Insights"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
23 => Essec\Faculty\Model\These {#2267
#_index: null
#_id: null
#_source: array:9 [
"year" => "2020"
"startDate" => null
"endDate" => "2020"
"student" => "ORM HELLSTEN E."
"firstJob" => ""
"label" => array:2 [
"fr" => "Optimisation in Feeder and Liner Shipping Operations"
"en" => "Optimisation in Feeder and Liner Shipping Operations"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
24 => Essec\Faculty\Model\These {#2268
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "PARAPPATHODI J."
"firstJob" => ""
"label" => array:2 [
"fr" => "Title still to define"
"en" => "Title still to define"
]
"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: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
25 => Essec\Faculty\Model\These {#2269
#_index: null
#_id: null
#_source: array:9 [
"year" => "2020"
"startDate" => null
"endDate" => "2020"
"student" => "PEIRANO L."
"firstJob" => ""
"label" => array:2 [
"fr" => "Optimization Problems for Freight Forwarding Companies"
"en" => "Optimization Problems for Freight Forwarding Companies"
]
"role" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Università degli studi di Bergamo"
"en" => "Università degli studi di Bergamo"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
26 => Essec\Faculty\Model\These {#2270
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "PETRIS M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Title still to define"
"en" => "Title still to define"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "École Centrale Lille"
"en" => "École Centrale Lille"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
27 => Essec\Faculty\Model\These {#2271
#_index: null
#_id: null
#_source: array:9 [
"year" => "2013"
"startDate" => null
"endDate" => "2013"
"student" => "PFEFFER A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Swapping and repositioning"
"en" => "Swapping and repositioning"
]
"role" => array:2 [
"fr" => "Rapporteur"
"en" => "Thesis referee"
]
"institution" => array:2 [
"fr" => "Tel Aviv University"
"en" => "Tel Aviv University"
]
"country" => array:2 [
"fr" => "Israël"
"en" => "Israel"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
28 => Essec\Faculty\Model\These {#2272
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "PUNAM MANDAL M."
"firstJob" => ""
"label" => array:2 [
"fr" => "To be defined"
"en" => "To be defined"
]
"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: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
29 => Essec\Faculty\Model\These {#2273
#_index: null
#_id: null
#_source: array:9 [
"year" => "2016"
"startDate" => null
"endDate" => "2016"
"student" => "SANTOS HERNANDEZ B."
"firstJob" => ""
"label" => array:2 [
"fr" => "The split-demand one-commodity pickup-and-delivery travelling salesman problem"
"en" => "The split-demand one-commodity pickup-and-delivery travelling salesman problem"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "University of La Laguna"
"en" => "University of La Laguna"
]
"country" => array:2 [
"fr" => "Espagne"
"en" => "Spain"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
30 => Essec\Faculty\Model\These {#2274
#_index: null
#_id: null
#_source: array:9 [
"year" => "2012"
"startDate" => null
"endDate" => "2012"
"student" => "STALHANE M."
"firstJob" => ""
"label" => array:2 [
"fr" => """
Optimization of maritime routing and\n
scheduling problems with complicating\n
inter-route constraints
"""
"en" => """
Optimization of maritime routing and\n
scheduling problems with complicating\n
inter-route constraints
"""
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "Norwegian University Of Science and Technology"
"en" => "Norwegian University Of Science and Technology"
]
"country" => array:2 [
"fr" => "Norvège"
"en" => "Norway"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
31 => Essec\Faculty\Model\These {#2275
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "SU Y."
"firstJob" => ""
"label" => array:2 [
"fr" => "Heuristic and exact algorithms for solving the electric autonomous dial-a-ride problem"
"en" => "Heuristic and exact algorithms for solving the electric autonomous dial-a-ride problem"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
32 => Essec\Faculty\Model\These {#2276
#_index: null
#_id: null
#_source: array:9 [
"year" => "2016"
"startDate" => null
"endDate" => "2016"
"student" => "TILK C."
"firstJob" => ""
"label" => array:2 [
"fr" => "Contributions to column-generation approaches in combinatorial optimization"
"en" => "Contributions to column-generation approaches in combinatorial optimization"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "University of Mainz"
"en" => "University of Mainz"
]
"country" => array:2 [
"fr" => "Allemagne"
"en" => "Germany"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
33 => Essec\Faculty\Model\These {#2277
#_index: null
#_id: null
#_source: array:9 [
"year" => "2021"
"startDate" => null
"endDate" => "2021"
"student" => "TORRES F."
"firstJob" => ""
"label" => array:2 [
"fr" => "Uncertainty in Crowd-Based Last-Mile Logistics"
"en" => "Uncertainty in Crowd-Based Last-Mile Logistics"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
34 => Essec\Faculty\Model\These {#2278
#_index: null
#_id: null
#_source: array:9 [
"year" => "2011"
"startDate" => null
"endDate" => "2011"
"student" => "TRESOLDI M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Location and Distribution Problems: A General Approach"
"en" => "Location and Distribution Problems: A General Approach"
]
"role" => array:2 [
"fr" => "Rapporteur"
"en" => "Thesis referee"
]
"institution" => array:2 [
"fr" => "Universita degli studi di Milano"
"en" => "Universita degli studi di Milano"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
35 => Essec\Faculty\Model\These {#2279
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "TROTTA M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Optimization problems for autonomous vehicles"
"en" => "Optimization problems for autonomous vehicles"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "École des Mines de Saint-Etienne"
"en" => "École des Mines de Saint-Etienne"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
36 => Essec\Faculty\Model\These {#2280
#_index: null
#_id: null
#_source: array:9 [
"year" => "2021"
"startDate" => null
"endDate" => "2021"
"student" => "VAN ZON M. A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Cost Allocation in Collaborative Transportation"
"en" => "Cost Allocation in Collaborative Transportation"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
37 => Essec\Faculty\Model\These {#2281
#_index: null
#_id: null
#_source: array:9 [
"year" => "2019"
"startDate" => null
"endDate" => "2019"
"student" => "YUAN Y."
"firstJob" => ""
"label" => array:2 [
"fr" => "Models and algorithms for last mile delivery problems with multiple shipping options"
"en" => "Models and algorithms for last mile delivery problems with multiple shipping options"
]
"role" => array:2 [
"fr" => "Membre de jury"
"en" => "Thesis jury member"
]
"institution" => array:2 [
"fr" => "École Centrale Lille"
"en" => "École Centrale Lille"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "en"
+"parent": Essec\Faculty\Model\Profile {#2190}
}
]
"indexedAt" => "2023-12-02T04:21:26.000Z"
"contributions" => array:130 [
0 => Essec\Faculty\Model\Contribution {#2282
#_index: "academ_contributions"
#_id: "10693"
#_source: array:18 [
"id" => "10693"
"slug" => "a-branch-and-cut-algorithm-for-the-inventory-routing-problem-with-pickups-and-deliveries"
"yearMonth" => "2020-05"
"year" => "2020"
"title" => "A Branch-And-Cut Algorithm for the Inventory Routing Problem with Pickups and Deliveries"
"description" => "ARCHETTI, C., SPERANZA, M.G., BOCCIA, M., SFORZA, A. et STERLE, C. (2020). A Branch-And-Cut Algorithm for the Inventory Routing Problem with Pickups and Deliveries. <i>European Journal of Operational Research</i>, 282(3), pp. 886-895."
"authors" => array:5 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "SPERANZA Maria Grazia"
]
2 => array:1 [
"name" => "BOCCIA Maurizio"
]
3 => array:1 [
"name" => "SFORZA Antonio"
]
4 => array:1 [
"name" => "STERLE Claudio"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Routing"
1 => "Inventory management"
2 => "Pickups and deliveries"
3 => "Branch-and-cut"
4 => "Lot-sizing reformulation"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221719308136"
"publicationInfo" => array:3 [
"pages" => "886-895"
"volume" => "282"
"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" => "This paper addresses the Inventory Routing Problem with Pickups and Deliveries (IRP-PD). A single commodity has to be picked up from several origins and distributed to several destinations. The commodity is made available at the supplier depot and at the pickup customers, with known amounts in each period of a discretized time horizon. The commodity is consumed by the delivery customers, whose demand, in each period of the time horizon, is known. The vehicles start and end their routes at the supplier depot. The objective is to determine a collection and distribution plan minimizing the sum of routing and inventory costs, satisfying inventory and capacity constraints. A mixed integer linear programming model is presented for the IRP-PD. Valid inequalities are proposed that are adapted from the inventory routing, the vehicle routing and the lot-sizing problems literature. Moreover, a new set of valid inequalities, called interval inequalities, is presented. A branch-and-cut algorithm is designed and tested on a large set of instances. Computational results show that the proposed approach is able to solve to optimality 946 out of 1280 instances. Moreover, the approach outperforms the state-of-the art method for the single vehicle case, increasing the number of instances solved to optimality from 473 to 538 out of 640 instances tested, with 133 new best known solutions."
"en" => "This paper addresses the Inventory Routing Problem with Pickups and Deliveries (IRP-PD). A single commodity has to be picked up from several origins and distributed to several destinations. The commodity is made available at the supplier depot and at the pickup customers, with known amounts in each period of a discretized time horizon. The commodity is consumed by the delivery customers, whose demand, in each period of the time horizon, is known. The vehicles start and end their routes at the supplier depot. The objective is to determine a collection and distribution plan minimizing the sum of routing and inventory costs, satisfying inventory and capacity constraints. A mixed integer linear programming model is presented for the IRP-PD. Valid inequalities are proposed that are adapted from the inventory routing, the vehicle routing and the lot-sizing problems literature. Moreover, a new set of valid inequalities, called interval inequalities, is presented. A branch-and-cut algorithm is designed and tested on a large set of instances. Computational results show that the proposed approach is able to solve to optimality 946 out of 1280 instances. Moreover, the approach outperforms the state-of-the art method for the single vehicle case, increasing the number of instances solved to optimality from 473 to 538 out of 640 instances tested, with 133 new best known solutions."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
1 => Essec\Faculty\Model\Contribution {#2284
#_index: "academ_contributions"
#_id: "10695"
#_source: array:18 [
"id" => "10695"
"slug" => "an-exact-algorithm-for-the-inventory-routing-problem-with-logistic-ratio"
"yearMonth" => "2019-11"
"year" => "2019"
"title" => "An Exact Algorithm for the Inventory Routing Problem with Logistic Ratio"
"description" => "ARCHETTI, C., COELHO, L.C. et SPERANZA, M.G. (2019). An Exact Algorithm for the Inventory Routing Problem with Logistic Ratio. <i>Transportation Research Part E: Logistics and Transportation Review</i>, 131, pp. 96-107."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "COELHO Leandro C."
]
2 => array:1 [
"name" => "SPERANZA Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "Inventory routing problem"
1 => "Logistic ratio"
2 => "Exact method"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.tre.2019.09.016"
"publicationInfo" => array:3 [
"pages" => "96-107"
"volume" => "131"
"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" => "The Inventory Routing Problem with Logistic Ratio (IRPLR) is a variant of the classical IRP where, instead of the total distribution cost, the ratio between the total distribution cost and the total delivered quantity is minimized, giving rise to a fractional objective function. An exact algorithm is known, solving instances with up to 15 customers. We propose an iterative exact algorithm where, at each iteration, an IRP with a linear objective function is solved. Experiments show that the proposed algorithm is faster when the number of vehicles is small, solving instances with more customers and a longer planning horizon."
"en" => "The Inventory Routing Problem with Logistic Ratio (IRPLR) is a variant of the classical IRP where, instead of the total distribution cost, the ratio between the total distribution cost and the total delivered quantity is minimized, giving rise to a fractional objective function. An exact algorithm is known, solving instances with up to 15 customers. We propose an iterative exact algorithm where, at each iteration, an IRP with a linear objective function is solved. Experiments show that the proposed algorithm is faster when the number of vehicles is small, solving instances with more customers and a longer planning horizon."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
2 => Essec\Faculty\Model\Contribution {#2286
#_index: "academ_contributions"
#_id: "10699"
#_source: array:18 [
"id" => "10699"
"slug" => "dynamic-traveling-salesman-problem-with-stochastic-release-dates"
"yearMonth" => "2020-02"
"year" => "2020"
"title" => "Dynamic traveling salesman problem with stochastic release dates"
"description" => "ARCHETTI, C., FEILLET, D., MOR, A. et SPERANZA, M.G. (2020). Dynamic traveling salesman problem with stochastic release dates. <i>European Journal of Operational Research</i>, 280(3), pp. 832-844."
"authors" => array:4 [
0 => array:3 [
"name" => "Archetti Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Feillet Dominique"
]
2 => array:1 [
"name" => "Mor Andrea"
]
3 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Routing"
1 => "Traveling salesman problem with release dates"
2 => "Dynamic problem"
3 => "Stochastic information"
4 => "Reoptimization"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2019.07.062"
"publicationInfo" => array:3 [
"pages" => "832-844"
"volume" => "280"
"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 dynamic traveling salesman problem with stochastic release dates (DTSP-srd) is a problem in which a supplier has to deliver parcels to its customers. These parcels are delivered to its depot while the distribution is taking place. The arrival time of a parcel to the depot is called its release date. In the DTSP-srd, release dates are stochastic and dynamically updated as the distribution takes place. The objective of the problem is the minimization of the total time needed to serve all customers, given by the sum of the traveling time and the waiting time at the depot. The problem is represented as a Markov Decision Process and is solved through a reoptimization approach. Two models are proposed for the problem to be solved at each stage. The first model is stochastic and exploits the entire probabilistic information available for the release dates. The second model is deterministic and uses an estimation of the release dates. An instance generation procedure is proposed to simulate the evolution of the information to perform computational tests. The results show that a more frequent reoptimization provides better results across all tested instances and that the stochastic model performs better than the deterministic model. The main drawback of the stochastic model lies in the computational time required to evaluate a solution, which makes an iteration of the heuristic substantially more time-consuming than in the case where the deterministic model is used."
"en" => "The dynamic traveling salesman problem with stochastic release dates (DTSP-srd) is a problem in which a supplier has to deliver parcels to its customers. These parcels are delivered to its depot while the distribution is taking place. The arrival time of a parcel to the depot is called its release date. In the DTSP-srd, release dates are stochastic and dynamically updated as the distribution takes place. The objective of the problem is the minimization of the total time needed to serve all customers, given by the sum of the traveling time and the waiting time at the depot. The problem is represented as a Markov Decision Process and is solved through a reoptimization approach. Two models are proposed for the problem to be solved at each stage. The first model is stochastic and exploits the entire probabilistic information available for the release dates. The second model is deterministic and uses an estimation of the release dates. An instance generation procedure is proposed to simulate the evolution of the information to perform computational tests. The results show that a more frequent reoptimization provides better results across all tested instances and that the stochastic model performs better than the deterministic model. The main drawback of the stochastic model lies in the computational time required to evaluate a solution, which makes an iteration of the heuristic substantially more time-consuming than in the case where the deterministic model is used."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
3 => Essec\Faculty\Model\Contribution {#2283
#_index: "academ_contributions"
#_id: "10700"
#_source: array:18 [
"id" => "10700"
"slug" => "exact-solution-methods-for-the-multi-period-vehicle-routing-problem-with-due-dates"
"yearMonth" => "2019-09"
"year" => "2019"
"title" => "Exact solution methods for the multi-period vehicle routing problem with due dates"
"description" => "LARRAIN, H., COELHO, L.C., ARCHETTI, C. et SPERANZA, M.G. (2019). Exact solution methods for the multi-period vehicle routing problem with due dates. <i>Computers & Operations Research</i>, 110, pp. 148-158."
"authors" => array:4 [
0 => array:3 [
"name" => "Archetti Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Larrain Homero"
]
2 => array:1 [
"name" => "Coelho Leandro C."
]
3 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:7 [
0 => "Routing"
1 => "Due dates"
2 => "Heuristic"
3 => "Local search"
4 => "Exact algorithm"
5 => "Hybrid algorithm"
6 => "VMND"
]
"updatedAt" => "2022-10-11 10:54:40"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2019.05.026"
"publicationInfo" => array:3 [
"pages" => "148-158"
"volume" => "110"
"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" => "In this paper we study the multi-period vehicle routing problem with due dates. A supplier has to determine a distribution plan to visit a set of customers over a given planning horizon. Each customer is associated with a release date and a due date, that is, the date at which the goods required by the customer become available at the supplier’s depot, and the date by which the customer has to be visited, respectively. A fleet of capacitated vehicles is available at the depot to perform the distribution and the objective is to minimize the distribution costs and the costs related to delayed deliveries. New families of valid inequalities are presented that allow us to improve a branch-and-bound algorithm proposed in the literature. The new branch-and-bound algorithm reduces to 5.1% the optimality gap which is 12.1% for the known branch-and-bound on instances with one vehicle. A variable MIP neighborhood descent (VMND) algorithm is also presented, which speeds up the search for high quality solutions through a local search heuristic embedded in the branch-and-bound algorithm. Computational tests are performed to assess the quality of the VMND algorithm against the new branch-and-bound algorithm. The computational results show that the VMND algorithm improves 35 out of 80 solutions on instances with one vehicle, reducing the average optimality gap from 5.1% to 3.6%. It further matches the performance of the new branch-and-bound algorithm on another 35 instances. On instances with two and three vehicles the average optimality gap obtained by the VMND algorithm is 5.5% and 5.6%, respectively."
"en" => "In this paper we study the multi-period vehicle routing problem with due dates. A supplier has to determine a distribution plan to visit a set of customers over a given planning horizon. Each customer is associated with a release date and a due date, that is, the date at which the goods required by the customer become available at the supplier’s depot, and the date by which the customer has to be visited, respectively. A fleet of capacitated vehicles is available at the depot to perform the distribution and the objective is to minimize the distribution costs and the costs related to delayed deliveries. New families of valid inequalities are presented that allow us to improve a branch-and-bound algorithm proposed in the literature. The new branch-and-bound algorithm reduces to 5.1% the optimality gap which is 12.1% for the known branch-and-bound on instances with one vehicle. A variable MIP neighborhood descent (VMND) algorithm is also presented, which speeds up the search for high quality solutions through a local search heuristic embedded in the branch-and-bound algorithm. Computational tests are performed to assess the quality of the VMND algorithm against the new branch-and-bound algorithm. The computational results show that the VMND algorithm improves 35 out of 80 solutions on instances with one vehicle, reducing the average optimality gap from 5.1% to 3.6%. It further matches the performance of the new branch-and-bound algorithm on another 35 instances. On instances with two and three vehicles the average optimality gap obtained by the VMND algorithm is 5.5% and 5.6%, respectively."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
4 => Essec\Faculty\Model\Contribution {#2287
#_index: "academ_contributions"
#_id: "10702"
#_source: array:18 [
"id" => "10702"
"slug" => "flexible-two-echelon-location-routing-problem"
"yearMonth" => "2019-09"
"year" => "2019"
"title" => "Flexible two-echelon location routing problem"
"description" => "DARVISH, M., ARCHETTI, C., COELHO, L.C. et SPERANZA, M.G. (2019). Flexible two-echelon location routing problem. <i>European Journal of Operational Research</i>, 277(3), pp. 1124-1136."
"authors" => array:4 [
0 => array:3 [
"name" => "Archetti Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Darvish Maryam"
]
2 => array:1 [
"name" => "Coelho Leandro C."
]
3 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Multi-depot vehicle routing"
1 => "Location routing"
2 => "Due dates"
3 => "Integrated logistics flexibility"
]
"updatedAt" => "2022-10-20 11:38:56"
"publicationUrl" => "https://doi-org.ezp.essec.fr/10.1016/j.ejor.2019.04.002"
"publicationInfo" => array:3 [
"pages" => "1124-1136"
"volume" => "277"
"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" => "This paper deals with an integrated routing problem in which a supplier delivers a commodity to its customers through a two-echelon supply network. Over a planning horizon, the commodity is first sent from a single depot to a set of Distribution Centers (DCs). Then, from the DCs, it is delivered to customers. Two sources of flexibility are analyzed: flexibility in network design and flexibility in due dates. The former is related to the possibility of renting any of the DCs in any period of the planning horizon, whereas the latter is related to the possibility of serving a customer between the period an order is set and a due date. The objective is to minimize the total cost consisting of the sum of the shipping cost from the depot to the DCs, the traveling cost from the DCs to the customers, the renting cost of DCs, and the penalty cost for unmet due dates. A mathematical programming formulation is presented, together with different classes of valid inequalities. Moreover, an exact method is proposed that is based on the interplay between two branch-and-bound algorithms. Computational results on randomly generated instances show the value of each of the two kinds of flexibility. Their combination leads to average savings of up to about 30%."
"en" => "This paper deals with an integrated routing problem in which a supplier delivers a commodity to its customers through a two-echelon supply network. Over a planning horizon, the commodity is first sent from a single depot to a set of Distribution Centers (DCs). Then, from the DCs, it is delivered to customers. Two sources of flexibility are analyzed: flexibility in network design and flexibility in due dates. The former is related to the possibility of renting any of the DCs in any period of the planning horizon, whereas the latter is related to the possibility of serving a customer between the period an order is set and a due date. The objective is to minimize the total cost consisting of the sum of the shipping cost from the depot to the DCs, the traveling cost from the DCs to the customers, the renting cost of DCs, and the penalty cost for unmet due dates. A mathematical programming formulation is presented, together with different classes of valid inequalities. Moreover, an exact method is proposed that is based on the interplay between two branch-and-bound algorithms. Computational results on randomly generated instances show the value of each of the two kinds of flexibility. Their combination leads to average savings of up to about 30%."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
5 => Essec\Faculty\Model\Contribution {#1845
#_index: "academ_contributions"
#_id: "10708"
#_source: array:18 [
"id" => "10708"
"slug" => "trade-offs-between-environmental-and-economic-performance-in-production-and-inventory-routing-problems"
"yearMonth" => "2019-10"
"year" => "2019"
"title" => "Trade-offs between environmental and economic performance in production and inventory-routing problems"
"description" => "DARVISH, M., ARCHETTI, C. et COELHO, L.C. (2019). Trade-offs between environmental and economic performance in production and inventory-routing problems. <i>International Journal of Production Economics</i>, 217, pp. 269-280."
"authors" => array:3 [
0 => array:3 [
"name" => "Archetti Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Darvish Maryam"
]
2 => array:1 [
"name" => "Coelho Leandro C."
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "Sustainability"
1 => "Multi-tier supply chain management"
2 => "Integrated optimization"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ijpe.2018.08.020"
"publicationInfo" => array:3 [
"pages" => "269-280"
"volume" => "217"
"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" => "The integration of operational decisions of different supply chain functions is an important success factor in minimizing their total costs. Traditionally, supply chain optimization has merely concentrated on costs or the economic aspects of sustainability, neglecting its environmental and social aspects. However, with the growing concern towards green operations, the impact of short term decisions on the reduction of carbon emissions can no longer be overlooked. In this paper, we aim to compare the effect of operational decisions not only on costs but also on emissions, and we reassess some well-known logistic optimization problems under new objectives. We study two integrated systems dealing with production, inventory, and routing decisions, in which a commodity produced at the plant is shipped to the customers over a finite time horizon. These two problems are known as the production-routing and the inventory-routing problems. We define and measure several metrics under different scenarios, namely by minimizing total costs, routing costs only, or minimizing emissions. Each solution is evaluated under all three objective functions, and their costs and business performance indicators are then compared. We provide elaborated sensitivity analyses allowing us to gain useful managerial insights on the costs and emissions in integrated supply chains, besides important insights on the cost of being environmentally friendly."
"en" => "The integration of operational decisions of different supply chain functions is an important success factor in minimizing their total costs. Traditionally, supply chain optimization has merely concentrated on costs or the economic aspects of sustainability, neglecting its environmental and social aspects. However, with the growing concern towards green operations, the impact of short term decisions on the reduction of carbon emissions can no longer be overlooked. In this paper, we aim to compare the effect of operational decisions not only on costs but also on emissions, and we reassess some well-known logistic optimization problems under new objectives. We study two integrated systems dealing with production, inventory, and routing decisions, in which a commodity produced at the plant is shipped to the customers over a finite time horizon. These two problems are known as the production-routing and the inventory-routing problems. We define and measure several metrics under different scenarios, namely by minimizing total costs, routing costs only, or minimizing emissions. Each solution is evaluated under all three objective functions, and their costs and business performance indicators are then compared. We provide elaborated sensitivity analyses allowing us to gain useful managerial insights on the costs and emissions in integrated supply chains, besides important insights on the cost of being environmentally friendly."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
6 => Essec\Faculty\Model\Contribution {#2285
#_index: "academ_contributions"
#_id: "10793"
#_source: array:18 [
"id" => "10793"
"slug" => "minimum-cost-network-design-in-strategic-alliances"
"yearMonth" => "2020-10"
"year" => "2020"
"title" => "Minimum Cost Network Design in Strategic Alliances"
"description" => "ARSLAN, O., ARCHETTI, C., JABALI, O., LAPORTE, G. et SPERANZA, M.G. (2020). Minimum Cost Network Design in Strategic Alliances. <i>Omega</i>, 96."
"authors" => array:5 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "ARSLAN Okan"
]
2 => array:1 [
"name" => "JABALI Ola"
]
3 => array:1 [
"name" => "LAPORTE Gilbert"
]
4 => array:1 [
"name" => "SPERANZA Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Network design"
1 => "CollaborationStrategic alliances"
2 => "Centralized planning"
3 => "Transaction costs"
]
"updatedAt" => "2023-05-25 12:30:24"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0305048318310351"
"publicationInfo" => array:3 [
"pages" => ""
"volume" => "96"
"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" => "Strategic alliances are established between firms to improve their competitiveness in markets and generally appear in the form of joint ventures. Such collaborative efforts require centralized planning, and the survival of the alliance largely depends on the success of joint planning processes. In this regard, we investigate the opportunities that centralized collaboration can offer to firms when designing their service networks. Apart from the classical fixed and variable costs associated with the network design, we also consider transaction costs induced by the formation of the alliance, which can broadly be defined as cost components related to the coordination and monitoring of the people, efforts and resources. We concentrate on bilateral alliances and develop alternative models for solving their associated network design problem. We also adopt a state-of-the-art heuristic to solve large-scale instances. Our findings confirm that accounting for the transaction cost in network design is vital for the alliance. These transaction costs can be high enough to even render the collaboration unattractive. Hence, careful data collection and model treatment are required before deciding whether to form an alliance."
"en" => "Strategic alliances are established between firms to improve their competitiveness in markets and generally appear in the form of joint ventures. Such collaborative efforts require centralized planning, and the survival of the alliance largely depends on the success of joint planning processes. In this regard, we investigate the opportunities that centralized collaboration can offer to firms when designing their service networks. Apart from the classical fixed and variable costs associated with the network design, we also consider transaction costs induced by the formation of the alliance, which can broadly be defined as cost components related to the coordination and monitoring of the people, efforts and resources. We concentrate on bilateral alliances and develop alternative models for solving their associated network design problem. We also adopt a state-of-the-art heuristic to solve large-scale instances. Our findings confirm that accounting for the transaction cost in network design is vital for the alliance. These transaction costs can be high enough to even render the collaboration unattractive. Hence, careful data collection and model treatment are required before deciding whether to form an alliance."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
7 => Essec\Faculty\Model\Contribution {#2288
#_index: "academ_contributions"
#_id: "10835"
#_source: array:18 [
"id" => "10835"
"slug" => "air-intermodal-freight-transportation-the-freight-forwarder-service-problem"
"yearMonth" => "2020-07"
"year" => "2020"
"title" => "Air intermodal freight transportation: the freight forwarder service problem"
"description" => "ARCHETTI, C. et PEIRANO, L. (2020). Air intermodal freight transportation: the freight forwarder service problem. <i>Omega</i>, 94, pp. 102040."
"authors" => array:2 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "PEIRANO Lorenzo"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Freight forwarder"
1 => "Air transportation"
2 => "Service network"
3 => "Case study"
4 => "MILP"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.omega.2019.02.009"
"publicationInfo" => array:3 [
"pages" => "102040"
"volume" => "94"
"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" => "Despite being one of the most relevant figures in international multimodal transportation, freight forwarding companies optimization problems did not receive much attention from the research community. In this work we try to fill this gap by presenting the general features of air transportation from the freight forwarder’s perspective and we introduce the air transportation freight forwarder service problem (ATFFSP). A MILP formulation of the problem is proposed and tested on real-life data coming from an Italian freight forwarding company. We study the performance of the model in terms of optimality gap and time needed to reach the optimal solution. Furthermore we compare the solutions found with the ones provided by the company in order to evaluate the effectiveness of the model and its ability to find good and practical solutions. Finally, we study the possibility of opening a new warehouse facility to better manage services and we analyze the corresponding potential benefits."
"en" => "Despite being one of the most relevant figures in international multimodal transportation, freight forwarding companies optimization problems did not receive much attention from the research community. In this work we try to fill this gap by presenting the general features of air transportation from the freight forwarder’s perspective and we introduce the air transportation freight forwarder service problem (ATFFSP). A MILP formulation of the problem is proposed and tested on real-life data coming from an Italian freight forwarding company. We study the performance of the model in terms of optimality gap and time needed to reach the optimal solution. Furthermore we compare the solutions found with the ones provided by the company in order to evaluate the effectiveness of the model and its ability to find good and practical solutions. Finally, we study the possibility of opening a new warehouse facility to better manage services and we analyze the corresponding potential benefits."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
8 => Essec\Faculty\Model\Contribution {#2289
#_index: "academ_contributions"
#_id: "10958"
#_source: array:18 [
"id" => "10958"
"slug" => "a-matheuristic-for-the-air-transportation-freight-forwarder-service-problem"
"yearMonth" => "2020-11"
"year" => "2020"
"title" => "A Matheuristic for the Air Transportation Freight Forwarder Service Problem"
"description" => "ANGELELLI, E., ARCHETTI, C. et PEIRANO, L. (2020). A Matheuristic for the Air Transportation Freight Forwarder Service Problem. <i>Computers & Operations Research</i>, 123."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "ANGELELLI E."
]
2 => array:1 [
"name" => "PEIRANO L."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Freight forwarder"
1 => "Air transportation"
2 => "Service network"
3 => "Matheuristic"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2020.105002"
"publicationInfo" => array:3 [
"pages" => null
"volume" => "123"
"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" => "Freight forwarding companies provide transportation services to shipping companies by organizing shipment of freights from origins to destinations. They typically handle long-haul intermodal transportation requiring synchronization among different transportation legs and modes as well as complex bureaucratic and administrative operations, like customs clearance for international transportation. Because of the complexity of these operations, shipper companies prefer to focus on their core business activities and are more and more relying on third parties to organize shipments. In this paper we focus on the freight forwarding activity where the main transportation mode is air transportation. The problem has been recently introduced in the literature and finds interesting practical applications related to the recent raise in air freight transportation due to fast delivery times requested by e-commerce customers. In this paper, we propose a matheuristic algorithm based on the construction of feasible routes from origins to destinations and on the solution of a set-partitioning formulation. Computational tests are made on instances proposed in the literature which are based on real data. The results show that the matheuristic is capable of offering good solutions for large size instances within reasonable computing times."
"en" => "Freight forwarding companies provide transportation services to shipping companies by organizing shipment of freights from origins to destinations. They typically handle long-haul intermodal transportation requiring synchronization among different transportation legs and modes as well as complex bureaucratic and administrative operations, like customs clearance for international transportation. Because of the complexity of these operations, shipper companies prefer to focus on their core business activities and are more and more relying on third parties to organize shipments. In this paper we focus on the freight forwarding activity where the main transportation mode is air transportation. The problem has been recently introduced in the literature and finds interesting practical applications related to the recent raise in air freight transportation due to fast delivery times requested by e-commerce customers. In this paper, we propose a matheuristic algorithm based on the construction of feasible routes from origins to destinations and on the solution of a set-partitioning formulation. Computational tests are made on instances proposed in the literature which are based on real data. The results show that the matheuristic is capable of offering good solutions for large size instances within reasonable computing times."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
9 => Essec\Faculty\Model\Contribution {#2290
#_index: "academ_contributions"
#_id: "11116"
#_source: array:18 [
"id" => "11116"
"slug" => "recent-challenges-in-routing-and-inventory-routing-e%e2%80%90commerce-and-last%e2%80%90mile-delivery"
"yearMonth" => "2021-03"
"year" => "2021"
"title" => "Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery"
"description" => "ARCHETTI, C. et BERTAZZI, L. (2021). Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery. <i>Networks</i>, 77(2), pp. 255-268."
"authors" => array:2 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "BERTAZZI Luca"
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "crowdshipping"
1 => "e‐commerce"
2 => "inventory routing"
3 => "last‐mile delivery"
4 => "release dates"
5 => "routing problems"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1002/net.21995"
"publicationInfo" => array:3 [
"pages" => "255-268"
"volume" => "77"
"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" => "In the e‐commerce era, vendors have to satisfy a large number of on‐line orders, mainly from private customers, with low weight and volume, reduced delivery time, and overlap of customers' time windows. Production is made available all day long. New strategies and new technologies are emerging for deliveries. The processing time of the orders is reduced. These new features generate interesting challenges in formulating and solving Routing and Inventory Routing problems. After discussing these features and the corresponding challenges, we recall the relevant literature in Routing and Inventory Routing and provide future research directions, mainly related to routing problems with release dates, routing problems with crowdshipping, and inventory routing problems in the e‐commerce era."
"en" => "In the e‐commerce era, vendors have to satisfy a large number of on‐line orders, mainly from private customers, with low weight and volume, reduced delivery time, and overlap of customers' time windows. Production is made available all day long. New strategies and new technologies are emerging for deliveries. The processing time of the orders is reduced. These new features generate interesting challenges in formulating and solving Routing and Inventory Routing problems. After discussing these features and the corresponding challenges, we recall the relevant literature in Routing and Inventory Routing and provide future research directions, mainly related to routing problems with release dates, routing problems with crowdshipping, and inventory routing problems in the e‐commerce era."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
10 => Essec\Faculty\Model\Contribution {#2291
#_index: "academ_contributions"
#_id: "11998"
#_source: array:18 [
"id" => "11998"
"slug" => "the-online-vehicle-routing-problem-with-occasional-drivers"
"yearMonth" => "2021-03"
"year" => "2021"
"title" => "The Online Vehicle Routing Problem with Occasional Drivers"
"description" => "ARCHETTI, C., GUERRIERO, F. et MACRINA, G. (2021). The Online Vehicle Routing Problem with Occasional Drivers. <i>Computers & Operations Research</i>, 127, pp. 105144."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Guerriero Francesca"
]
2 => array:1 [
"name" => "Macrina Giusy"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "Logistics, crowd-shipping, Online vehicle routing, Occasional drivers, Re-optimisation"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2020.105144"
"publicationInfo" => array:3 [
"pages" => "105144"
"volume" => "127"
"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 investigate a vehicle routing problem in which customer requests are either known in advance with respect to the planning of the distribution, or they arrive online during the distribution process. Each request is associated with a time window. The company managing the distribution has a given fleet of vehicles to serve the customers, and, in addition, occasional drivers are available to perform the service, i.e., private citizens who are willing to distribute some customer orders in exchange for a compensation. Each occasional driver specifies the time window in which he/she is available. A penalty is incurred when violating time windows as well as when a request is not served. The objective of the company is to determine the distribution plan that minimises the distribution cost, which is given by the sum of the cost of regular vehicles, the compensation paid to the occasional drivers and the penalty cost."
"en" => "We investigate a vehicle routing problem in which customer requests are either known in advance with respect to the planning of the distribution, or they arrive online during the distribution process. Each request is associated with a time window. The company managing the distribution has a given fleet of vehicles to serve the customers, and, in addition, occasional drivers are available to perform the service, i.e., private citizens who are willing to distribute some customer orders in exchange for a compensation. Each occasional driver specifies the time window in which he/she is available. A penalty is incurred when violating time windows as well as when a request is not served. The objective of the company is to determine the distribution plan that minimises the distribution cost, which is given by the sum of the cost of regular vehicles, the compensation paid to the occasional drivers and the penalty cost."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
11 => Essec\Faculty\Model\Contribution {#2292
#_index: "academ_contributions"
#_id: "12112"
#_source: array:18 [
"id" => "12112"
"slug" => "reoptimizing-the-traveling-salesman-problem"
"yearMonth" => "2003-10"
"year" => "2003"
"title" => "Reoptimizing the traveling salesman problem"
"description" => "ARCHETTI, C., BERTAZZI, L. et SPERANZA, M.G. (2003). Reoptimizing the traveling salesman problem. <i>Networks</i>, 42(3), pp. 154-159."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bertazzi Luca"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "reoptimization problems"
]
"updatedAt" => "2021-07-13 14:31:59"
"publicationUrl" => "https://onlinelibrary.wiley.com/doi/abs/10.1002/net.10091"
"publicationInfo" => array:3 [
"pages" => "154-159"
"volume" => "42"
"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" => "In this paper, we study the reoptimization problems which arise when a new node is added to an optimal solution of a traveling salesman problem (TSP) instance or when a node is removed. We show that both reoptimization problems are NP‐hard. Moreover, we show that, while the cheapest insertion heuristic has a tight worst‐case ratio equal to 2 when applied to a TSP instance, it guarantees, in linear time, a tight worst‐case ratio equal to 3/2 when used to add the new node and that also the simplest heuristic to remove a node from the optimal tour guarantees a tight ratio equal to 3/2 in constant time."
"en" => "In this paper, we study the reoptimization problems which arise when a new node is added to an optimal solution of a traveling salesman problem (TSP) instance or when a node is removed. We show that both reoptimization problems are NP‐hard. Moreover, we show that, while the cheapest insertion heuristic has a tight worst‐case ratio equal to 2 when applied to a TSP instance, it guarantees, in linear time, a tight worst‐case ratio equal to 3/2 when used to add the new node and that also the simplest heuristic to remove a node from the optimal tour guarantees a tight ratio equal to 3/2 in constant time."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
12 => Essec\Faculty\Model\Contribution {#2293
#_index: "academ_contributions"
#_id: "12113"
#_source: array:18 [
"id" => "12113"
"slug" => "vehicle-routing-in-the-1-skip-collection-problem"
"yearMonth" => "2004-07"
"year" => "2004"
"title" => "Vehicle routing in the 1-skip collection problem"
"description" => "ARCHETTI, C. et SPERANZA, M.G. (2004). Vehicle routing in the 1-skip collection problem. <i>Journal of the Operational Research Society</i>, 55(7), pp. 717-727."
"authors" => array:2 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "vehicle routing"
1 => "heuristic algorithms"
2 => "waste collection"
3 => "skips"
4 => "transportation problem"
]
"updatedAt" => "2021-07-13 14:31:59"
"publicationUrl" => "https://www.tandfonline.com/doi/abs/10.1057/palgrave.jors.2601743?journalCode=tjor20"
"publicationInfo" => array:3 [
"pages" => "717-727"
"volume" => "55"
"number" => "7"
]
"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" => "In this paper, we consider a real problem, which we call the 1-skip collection problem, where a fleet of vehicles must collect a number of skips situated in different locations and transport them to one among different plants chosen on the basis of the kind of waste contained in the skip. Each vehicle has a capacity of one skip and it starts and ends its tour at the depot. Each time a vehicle collects a skip, it has to go to a plant and empty it. A number of constraints are imposed, which involve time windows for the customers and the plants, shift-time, different kinds of skips, number of drivers available to carry out the service and priorities assigned to the customers who have to be served. The objective is to minimize the total cost of the service given by the fixed cost of the drivers engaged to carry out the service, the cost of the extra time and the penalty cost paid if a customer is not served. A heuristic algorithm to solve the real problem is presented. The algorithm first constructs a feasible solution by means of the nearest-neighbour algorithm. Then, if it finds a feasible solution, it improves it. The computational results show that the solution of the algorithm is much better than the solution applied by the firm that carries out the service since it serves a higher number of skips with a smaller number of drivers."
"en" => "In this paper, we consider a real problem, which we call the 1-skip collection problem, where a fleet of vehicles must collect a number of skips situated in different locations and transport them to one among different plants chosen on the basis of the kind of waste contained in the skip. Each vehicle has a capacity of one skip and it starts and ends its tour at the depot. Each time a vehicle collects a skip, it has to go to a plant and empty it. A number of constraints are imposed, which involve time windows for the customers and the plants, shift-time, different kinds of skips, number of drivers available to carry out the service and priorities assigned to the customers who have to be served. The objective is to minimize the total cost of the service given by the fixed cost of the drivers engaged to carry out the service, the cost of the extra time and the penalty cost paid if a customer is not served. A heuristic algorithm to solve the real problem is presented. The algorithm first constructs a feasible solution by means of the nearest-neighbour algorithm. Then, if it finds a feasible solution, it improves it. The computational results show that the solution of the algorithm is much better than the solution applied by the firm that carries out the service since it serves a higher number of skips with a smaller number of drivers."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
13 => Essec\Faculty\Model\Contribution {#2294
#_index: "academ_contributions"
#_id: "12114"
#_source: array:18 [
"id" => "12114"
"slug" => "complexity-and-reducibility-of-the-skip-delivery-problem"
"yearMonth" => "2005-05"
"year" => "2005"
"title" => "Complexity and Reducibility of the Skip Delivery Problem"
"description" => "ARCHETTI, C., MANSINI, R. et SPERANZA, M.G. (2005). Complexity and Reducibility of the Skip Delivery Problem. <i>Transportation Science</i>, 39(2), pp. 182-187."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Mansini Renata"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "vehicle routing"
1 => "skip delivery problem"
2 => "split delivery"
3 => "triangle inequality"
4 => "computational complexity"
]
"updatedAt" => "2021-07-13 14:31:59"
"publicationUrl" => "https://pubsonline.informs.org/doi/10.1287/trsc.1030.0084"
"publicationInfo" => array:3 [
"pages" => "182-187"
"volume" => "39"
"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" => "In the skip delivery problem (SDP), a fleet of vehicles must deliver skips to a set of customers. Each vehicle has a maximum capacity of two skips, and has to start and end its tour at a central depot. The demand of each customer can be greater than the capacity of the vehicles. The objective is to minimize the cost of the total distance traveled by the vehicles to serve all the customers. We show that the SDP is solvable in polynomial time, while its generalization to the case where all vehicles have a capacity greater than two, known as the split delivery vehicle routing problem (SDVRP), is shown to be NP-hard, even under restricted conditions on the costs. We also show that, if the costs are symmetrical and satisfy the triangle inequality, the SDP is reducible in polynomial time to a problem of possibly smaller size, where each customer has unitary demand. This property allows a remarkable simplification of the problem."
"en" => "In the skip delivery problem (SDP), a fleet of vehicles must deliver skips to a set of customers. Each vehicle has a maximum capacity of two skips, and has to start and end its tour at a central depot. The demand of each customer can be greater than the capacity of the vehicles. The objective is to minimize the cost of the total distance traveled by the vehicles to serve all the customers. We show that the SDP is solvable in polynomial time, while its generalization to the case where all vehicles have a capacity greater than two, known as the split delivery vehicle routing problem (SDVRP), is shown to be NP-hard, even under restricted conditions on the costs. We also show that, if the costs are symmetrical and satisfy the triangle inequality, the SDP is reducible in polynomial time to a problem of possibly smaller size, where each customer has unitary demand. This property allows a remarkable simplification of the problem."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
14 => Essec\Faculty\Model\Contribution {#2295
#_index: "academ_contributions"
#_id: "12115"
#_source: array:18 [
"id" => "12115"
"slug" => "a-tabu-search-algorithm-for-the-split-delivery-vehicle-routing-problem"
"yearMonth" => "2006-02"
"year" => "2006"
"title" => "A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem"
"description" => "ARCHETTI, C., SPERANZA, M.G. et HERTZ, A. (2006). A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. <i>Transportation Science</i>, 40(1), pp. 64-73."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "SPERANZA Maria Grazia"
]
2 => array:1 [
"name" => "HERTZ A."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "split delivery vehicle routing problem"
1 => "triangle inequality"
2 => "metaheuristics"
3 => "tabu search"
]
"updatedAt" => "2021-07-13 14:31:59"
"publicationUrl" => "https://www.jstor.org/stable/25769283"
"publicationInfo" => array:3 [
"pages" => "64-73"
"volume" => "40"
"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" => "We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbor solution is obtained by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity. The algorithm also considers the possibility of inserting a customer into a route without removing it from another route. The insertion of a customer into a route is done by means of the cheapest insertion method. Computational experiments are reported for a set of benchmark problems, and the results are compared with those obtained by the algorithm proposed by Dror and Trudeau."
"en" => "We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbor solution is obtained by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity. The algorithm also considers the possibility of inserting a customer into a route without removing it from another route. The insertion of a customer into a route is done by means of the cheapest insertion method. Computational experiments are reported for a set of benchmark problems, and the results are compared with those obtained by the algorithm proposed by Dror and Trudeau."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
15 => Essec\Faculty\Model\Contribution {#2296
#_index: "academ_contributions"
#_id: "12116"
#_source: array:18 [
"id" => "12116"
"slug" => "worst-case-analysis-for-split-delivery-vehicle-routing-problems"
"yearMonth" => "2006-05"
"year" => "2006"
"title" => "Worst-Case Analysis for Split Delivery Vehicle Routing Problems"
"description" => "ARCHETTI, C., SAVELSBERGH, M.W.P. et SPERANZA, M.G. (2006). Worst-Case Analysis for Split Delivery Vehicle Routing Problems. <i>Transportation Science</i>, 40(2), pp. 226-234."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Savelsbergh Martin W. P."
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "vehicle routing"
1 => "split deliveries"
2 => "worst-case analysis"
]
"updatedAt" => "2021-07-13 14:31:59"
"publicationUrl" => "https://pubsonline.informs.org/doi/abs/10.1287/trsc.1050.0117"
"publicationInfo" => array:3 [
"pages" => "226-234"
"volume" => "40"
"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" => "In the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity and where each customer is visited once. In the split delivery vehicle routing problem (SDVRP) the restriction that each customer is visited once is removed. We show that the cost savings that can be realized by allowing split deliveries is at most 50%. We also study the variant of the VRP in which the demand of a customer may be larger than the vehicle capacity, but where each customer has to be visited a minimum number of times. We show that the cost savings that can be realized by allowing more than the minimum number of required visits is again at most 50%. Furthermore, we analyze the performance of simple heuristics that handle customers with demands larger than the vehicle capacity by employing full load out-and-back trips to these customers until the demands become less than or equal to the vehicle capacity. Finally, we investigate situations in which demands are discrete and vehicle capacities are small."
"en" => "In the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity and where each customer is visited once. In the split delivery vehicle routing problem (SDVRP) the restriction that each customer is visited once is removed. We show that the cost savings that can be realized by allowing split deliveries is at most 50%. We also study the variant of the VRP in which the demand of a customer may be larger than the vehicle capacity, but where each customer has to be visited a minimum number of times. We show that the cost savings that can be realized by allowing more than the minimum number of required visits is again at most 50%. Furthermore, we analyze the performance of simple heuristics that handle customers with demands larger than the vehicle capacity by employing full load out-and-back trips to these customers until the demands become less than or equal to the vehicle capacity. Finally, we investigate situations in which demands are discrete and vehicle capacities are small."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
16 => Essec\Faculty\Model\Contribution {#2297
#_index: "academ_contributions"
#_id: "12117"
#_source: array:18 [
"id" => "12117"
"slug" => "a-branch-and-cut-algorithm-for-a-vendor-managed-inventory-routing-problem"
"yearMonth" => "2007-08"
"year" => "2007"
"title" => "A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem"
"description" => "ARCHETTI, C., BERTAZZI, L., LAPORTE, G. et SPERANZA, M.G. (2007). A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. <i>Transportation Science</i>, 41(3), pp. 382-391."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "BERTAZZI Luca"
]
2 => array:1 [
"name" => "LAPORTE Gilbert"
]
3 => array:1 [
"name" => "SPERANZA Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Supply chain management"
1 => "vendor managed inventory"
2 => "deterministic order-up-to level"
3 => "inventory routing problem"
4 => "branch and cut"
]
"updatedAt" => "2021-07-13 14:31:59"
"publicationUrl" => "https://www.jstor.org/stable/25769361"
"publicationInfo" => array:3 [
"pages" => "382-391"
"volume" => "41"
"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 consider a distribution problem in which a product has to be shipped from a supplier to several retailers over a given time horizon. Each retailer defines a maximum inventory level. The supplier monitors the inventory of each retailer and determines its replenishment policy, guaranteeing that no stockout occurs at the retailer (vendor-managed inventory policy). Every time a retailer is visited, the quantity delivered by the supplier is such that the maximum inventory level is reached (deterministic order-up-to level policy). Shipments from the supplier to the retailers are performed by a vehicle of given capacity. The problem is to determine for each discrete time instant the quantity to ship to each retailer and the vehicle route. We present a mixed-integer linear programming model and derive new additional valid inequalities used to strengthen the linear relaxation of the model. We implement a branch-and-cut algorithm to solve the model optimally. We then compare the optimal solution of the problem with the optimal solution of two problems obtained by relaxing in different ways the deterministic order-up-to level policy. Computational results are presented on a set of randomly generated problem instances."
"en" => "We consider a distribution problem in which a product has to be shipped from a supplier to several retailers over a given time horizon. Each retailer defines a maximum inventory level. The supplier monitors the inventory of each retailer and determines its replenishment policy, guaranteeing that no stockout occurs at the retailer (vendor-managed inventory policy). Every time a retailer is visited, the quantity delivered by the supplier is such that the maximum inventory level is reached (deterministic order-up-to level policy). Shipments from the supplier to the retailers are performed by a vehicle of given capacity. The problem is to determine for each discrete time instant the quantity to ship to each retailer and the vehicle route. We present a mixed-integer linear programming model and derive new additional valid inequalities used to strengthen the linear relaxation of the model. We implement a branch-and-cut algorithm to solve the model optimally. We then compare the optimal solution of the problem with the optimal solution of two problems obtained by relaxing in different ways the deterministic order-up-to level policy. Computational results are presented on a set of randomly generated problem instances."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
17 => Essec\Faculty\Model\Contribution {#2298
#_index: "academ_contributions"
#_id: "12118"
#_source: array:18 [
"id" => "12118"
"slug" => "metaheuristics-for-the-team-orienteering-problem"
"yearMonth" => "2007-02"
"year" => "2007"
"title" => "Metaheuristics for the team orienteering problem"
"description" => "ARCHETTI, C., HERTZ, A. et SPERANZA, M.G. (2007). Metaheuristics for the team orienteering problem. <i>Journal of Heuristics</i>, 13(1), pp. 49-76."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Hertz Alain"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Team orienteering problem"
1 => "Selective traveling salesman problem"
2 => "Tabu search heuristic"
3 => "Variable neighborhood search heuristic"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1007/s10732-006-9004-0"
"publicationInfo" => array:3 [
"pages" => "49-76"
"volume" => "13"
"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" => "The Team Orienteering Problem (TOP) is the generalization to the case of multiple tours of the Orienteering Problem, known also as Selective Traveling Salesman Problem. A set of potential customers is available and a profit is collected from the visit to each customer. A fleet of vehicles is available to visit the customers, within a given time limit. The profit of a customer can be collected by one vehicle at most. The objective is to identify the customers which maximize the total collected profit while satisfying the given time limit for each vehicle. We propose two variants of a generalized tabu search algorithm and a variable neighborhood search algorithm for the solution of the TOP and show that each of these algorithms beats the already known heuristics. Computational experiments are made on standard instances."
"en" => "The Team Orienteering Problem (TOP) is the generalization to the case of multiple tours of the Orienteering Problem, known also as Selective Traveling Salesman Problem. A set of potential customers is available and a profit is collected from the visit to each customer. A fleet of vehicles is available to visit the customers, within a given time limit. The profit of a customer can be collected by one vehicle at most. The objective is to identify the customers which maximize the total collected profit while satisfying the given time limit for each vehicle. We propose two variants of a generalized tabu search algorithm and a variable neighborhood search algorithm for the solution of the TOP and show that each of these algorithms beats the already known heuristics. Computational experiments are made on standard instances."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
18 => Essec\Faculty\Model\Contribution {#2299
#_index: "academ_contributions"
#_id: "12119"
#_source: array:18 [
"id" => "12119"
"slug" => "to-split-or-not-to-split-that-is-the-question"
"yearMonth" => "2008-01"
"year" => "2008"
"title" => "To split or not to split: that is the question"
"description" => "ARCHETTI, C., SAVELSBERGH, M.W.P. et SPERANZA, M.G. (2008). To split or not to split: that is the question. <i>Transportation Research Part E: Logistics and Transportation Review</i>, 44(1), pp. 114-123."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "SAVELSBERGH Martin W. P."
]
2 => array:1 [
"name" => "SPERANZA M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:2 [
0 => "Vehicle routing"
1 => "Split deliveries"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.tre.2006.04.003"
"publicationInfo" => array:3 [
"pages" => "114-123"
"volume" => "44"
"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" => "In distribution problems, a fleet of vehicles serves the demand of a set of customers. Each customer is typically served by a single vehicle. However, more cost effective distribution plans may exist if some customers are served by more than one vehicle, i.e., if some deliveries are split. We characterize distribution environments in which allowing split deliveries is likely to be beneficial. We show, through an empirical study, that the largest benefits are obtained when mean customer demand is a little over half the vehicle capacity and customer demand variance is relatively small."
"en" => "In distribution problems, a fleet of vehicles serves the demand of a set of customers. Each customer is typically served by a single vehicle. However, more cost effective distribution plans may exist if some customers are served by more than one vehicle, i.e., if some deliveries are split. We characterize distribution environments in which allowing split deliveries is likely to be beneficial. We show, through an empirical study, that the largest benefits are obtained when mean customer demand is a little over half the vehicle capacity and customer demand variance is relatively small."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
19 => Essec\Faculty\Model\Contribution {#2300
#_index: "academ_contributions"
#_id: "12120"
#_source: array:18 [
"id" => "12120"
"slug" => "an-optimization-based-heuristic-for-the-split-delivery-vehicle-routing-problem"
"yearMonth" => "2008-02"
"year" => "2008"
"title" => "An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem"
"description" => "ARCHETTI, C., SPERANZA, M.G. et SAVELSBERGH, M.W.P. (2008). An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. <i>Transportation Science</i>, 42(1), pp. 22-31."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Speranza M. Grazia"
]
2 => array:1 [
"name" => "Savelsbergh Martin W. P."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "vehicle routing"
1 => "split delivery"
2 => "tabu search"
3 => "integer programming"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://pubsonline.informs.org/doi/abs/10.1287/trsc.1070.0204"
"publicationInfo" => array:3 [
"pages" => "22-31"
"volume" => "42"
"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" => "The split delivery vehicle routing problem is concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost. Contrary to what is assumed in the classical vehicle routing problem, a customer can be served by more than one vehicle, if convenient. We present a solution approach that integrates heuristic search with optimization by using an integer program to explore promising parts of the search space identified by a tabu search heuristic. Computational results show that the method improves the solution of the tabu search in all but one instance of a large test set."
"en" => "The split delivery vehicle routing problem is concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost. Contrary to what is assumed in the classical vehicle routing problem, a customer can be served by more than one vehicle, if convenient. We present a solution approach that integrates heuristic search with optimization by using an integer program to explore promising parts of the search space identified by a tabu search heuristic. Computational results show that the method improves the solution of the tabu search in all but one instance of a large test set."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
20 => Essec\Faculty\Model\Contribution {#2301
#_index: "academ_contributions"
#_id: "12121"
#_source: array:18 [
"id" => "12121"
"slug" => "ants-can-solve-the-team-orienteering-problem"
"yearMonth" => "2008-01"
"year" => "2008"
"title" => "Ants can solve the team orienteering problem"
"description" => "KE, L., ARCHETTI, C. et FENG, Z. (2008). Ants can solve the team orienteering problem. <i>Computers & Industrial Engineering</i>, 54(3), pp. 648-665."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "KE Liangjun"
]
2 => array:1 [
"name" => "FENG Zuren"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Team orienteering problem"
1 => "Ant colony optimization"
2 => "Ant system"
3 => "Heuristics"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.cie.2007.10.001"
"publicationInfo" => array:3 [
"pages" => "648-665"
"volume" => "54"
"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 team orienteering problem (TOP) involves finding a set of paths from the starting point to the ending point such that the total collected reward received from visiting a subset of locations is maximized and the length of each path is restricted by a pre-specified limit. In this paper, an ant colony optimization (ACO) approach is proposed for the team orienteering problem. Four methods, i.e., the sequential, deterministic-concurrent and random-concurrent and simultaneous methods, are proposed to construct candidate solutions in the framework of ACO. We compare these methods according to the results obtained on well-known problems from the literature. Finally, we compare the algorithm with several existing algorithms. The results show that our algorithm is promising."
"en" => "The team orienteering problem (TOP) involves finding a set of paths from the starting point to the ending point such that the total collected reward received from visiting a subset of locations is maximized and the length of each path is restricted by a pre-specified limit. In this paper, an ant colony optimization (ACO) approach is proposed for the team orienteering problem. Four methods, i.e., the sequential, deterministic-concurrent and random-concurrent and simultaneous methods, are proposed to construct candidate solutions in the framework of ACO. We compare these methods according to the results obtained on well-known problems from the literature. Finally, we compare the algorithm with several existing algorithms. The results show that our algorithm is promising."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
21 => Essec\Faculty\Model\Contribution {#2302
#_index: "academ_contributions"
#_id: "12122"
#_source: array:18 [
"id" => "12122"
"slug" => "the-capacitated-team-orienteering-and-profitable-tour-problems"
"yearMonth" => "2009-06"
"year" => "2009"
"title" => "The capacitated team orienteering and profitable tour problems"
"description" => "ARCHETTI, C., FEILLET, D., HERTZ, A. et SPERANZA, M.G. (2009). The capacitated team orienteering and profitable tour problems. <i>Journal of the Operational Research Society</i>, 60(6), pp. 831-842."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Feillet D"
]
2 => array:1 [
"name" => "Hertz A"
]
3 => array:1 [
"name" => "Speranza M G"
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "team orienteering problem"
1 => "profitable tour problem"
2 => "column generation"
3 => "branch and price"
4 => "tabu search"
5 => "variable neighbourhood search"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1057/palgrave.jors.2602603"
"publicationInfo" => array:3 [
"pages" => "831-842"
"volume" => "60"
"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" => "In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors."
"en" => "In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
22 => Essec\Faculty\Model\Contribution {#2303
#_index: "academ_contributions"
#_id: "12123"
#_source: array:18 [
"id" => "12123"
"slug" => "the-trip-scheduling-problem"
"yearMonth" => "2009-11"
"year" => "2009"
"title" => "The Trip Scheduling Problem"
"description" => "ARCHETTI, C. et SAVELSBERGH, M.W.P. (2009). The Trip Scheduling Problem. <i>Transportation Science</i>, 43(4), pp. 417-431."
"authors" => array:2 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "SAVELSBERGH Martin W. P."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "truckload transportation"
1 => "driver"
2 => "scheduling"
3 => "hours of service"
4 => "dispatch windows"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://www.jstor.org/stable/25769466"
"publicationInfo" => array:3 [
"pages" => "417-431"
"volume" => "43"
"number" => "4"
]
"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 hours of service (HOS) regulations of the department of transportation severely restrict the set of feasible driver schedules. So much so that establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can feasibly be executed by a driver is no longer a matter of simple forward simulation. We consider this problem and prove that the feasibility of a driver schedule can be checked in polynomial time by providing an O(n³) algorithm for establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can be executed by a driver."
"en" => "The hours of service (HOS) regulations of the department of transportation severely restrict the set of feasible driver schedules. So much so that establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can feasibly be executed by a driver is no longer a matter of simple forward simulation. We consider this problem and prove that the feasibility of a driver schedule can be checked in polynomial time by providing an O(n³) algorithm for establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can be executed by a driver."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
23 => Essec\Faculty\Model\Contribution {#2304
#_index: "academ_contributions"
#_id: "12124"
#_source: array:18 [
"id" => "12124"
"slug" => "reoptimizing-the-0-1-knapsack-problem"
"yearMonth" => "2010-10"
"year" => "2010"
"title" => "Reoptimizing the 0–1 knapsack problem"
"description" => "ARCHETTI, C., BERTAZZI, L. et SPERANZA, M.G. (2010). Reoptimizing the 0–1 knapsack problem. <i>Discrete Applied Mathematics</i>, 158(17), pp. 1879-1887."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bertazzi Luca"
]
2 => array:1 [
"name" => "Speranza M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "0–1 knapsack problem"
1 => "Reoptimization"
2 => "Worst-case analysis"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.dam.2010.08.003"
"publicationInfo" => array:3 [
"pages" => "1879-1887"
"volume" => "158"
"number" => "17"
]
"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" => "In this paper we study the problem where an optimal solution of a knapsack problem on items is known and a very small number of new items arrive. The objective is to find an optimal solution of the knapsack problem with items, given an optimal solution on the items (reoptimization of the knapsack problem). We show that this problem, even in the case , is NP-hard and that, in order to have effective heuristics, it is necessary to consider not only the items included in the previously optimal solution and the new items, but also the discarded items. Then, we design a general algorithm that makes use, for the solution of a subproblem, of an -approximation algorithm known for the knapsack problem. We prove that this algorithm has a worst-case performance bound of , which is always greater than , and therefore that this algorithm always outperforms the corresponding -approximation algorithm applied from scratch on the items. We show that this bound is tight when the classical Ext-Greedy algorithm and the algorithm are used to solve the subproblem. We also show that there exist classes of instances on which the running time of the reoptimization algorithm is smaller than the running time of an equivalent PTAS and FPTAS."
"en" => "In this paper we study the problem where an optimal solution of a knapsack problem on items is known and a very small number of new items arrive. The objective is to find an optimal solution of the knapsack problem with items, given an optimal solution on the items (reoptimization of the knapsack problem). We show that this problem, even in the case , is NP-hard and that, in order to have effective heuristics, it is necessary to consider not only the items included in the previously optimal solution and the new items, but also the discarded items. Then, we design a general algorithm that makes use, for the solution of a subproblem, of an -approximation algorithm known for the knapsack problem. We prove that this algorithm has a worst-case performance bound of , which is always greater than , and therefore that this algorithm always outperforms the corresponding -approximation algorithm applied from scratch on the items. We show that this bound is tight when the classical Ext-Greedy algorithm and the algorithm are used to solve the subproblem. We also show that there exist classes of instances on which the running time of the reoptimization algorithm is smaller than the running time of an equivalent PTAS and FPTAS."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
24 => Essec\Faculty\Model\Contribution {#2305
#_index: "academ_contributions"
#_id: "12125"
#_source: array:18 [
"id" => "12125"
"slug" => "the-undirected-capacitated-arc-routing-problem-with-profits"
"yearMonth" => "2010-11"
"year" => "2010"
"title" => "The undirected capacitated arc routing problem with profits"
"description" => "ARCHETTI, C., FEILLET, D., HERTZ, A. et SPERANZA, M.G. (2010). The undirected capacitated arc routing problem with profits. <i>Computers & Operations Research</i>, 37(11), pp. 1860-1869."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Feillet Dominique"
]
2 => array:1 [
"name" => "Hertz Alain"
]
3 => array:1 [
"name" => "Speranza M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Undirected capacitated arc routing with profits"
1 => "Auctions in transportation"
2 => "Carrier"
3 => "Branch-and-price"
4 => "Heuristics"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2009.05.005"
"publicationInfo" => array:3 [
"pages" => "1860-1869"
"volume" => "37"
"number" => "11"
]
"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" => "A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A travel time is associated with each edge of the graph. A fleet of capacitated vehicles is given to serve the profitable edges. A maximum duration of the route of each vehicle is also given. The profit of an edge can be collected by one vehicle only that also serves the demand of the edge. The objective of this problem, which is called the undirected capacitated arc routing problem with profits (UCARPP), is to find a set of routes that satisfy the constraints on the duration of the route and on the capacity of the vehicle and maximize the total collected profit. We propose a branch-and-price algorithm and several heuristics. We can solve exactly instances with up to 97 profitable edges. The best heuristics find the optimal solution on most of instances where it is available."
"en" => "A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A travel time is associated with each edge of the graph. A fleet of capacitated vehicles is given to serve the profitable edges. A maximum duration of the route of each vehicle is also given. The profit of an edge can be collected by one vehicle only that also serves the demand of the edge. The objective of this problem, which is called the undirected capacitated arc routing problem with profits (UCARPP), is to find a set of routes that satisfy the constraints on the duration of the route and on the capacity of the vehicle and maximize the total collected profit. We propose a branch-and-price algorithm and several heuristics. We can solve exactly instances with up to 97 profitable edges. The best heuristics find the optimal solution on most of instances where it is available."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
25 => Essec\Faculty\Model\Contribution {#2306
#_index: "academ_contributions"
#_id: "12126"
#_source: array:18 [
"id" => "12126"
"slug" => "exact-solutions-to-the-double-travelling-salesman-problem-with-multiple-stacks"
"yearMonth" => "2010-12"
"year" => "2010"
"title" => "Exact solutions to the double travelling salesman problem with multiple stacks"
"description" => "PETERSEN, H.L., ARCHETTI, C. et SPERANZA, M.G. (2010). Exact solutions to the double travelling salesman problem with multiple stacks. <i>Networks</i>, 56(4), pp. 229-243."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Petersen Hanne L."
]
2 => array:1 [
"name" => "Speranza M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "pickup and delivery"
1 => "travelling salesman problem"
2 => "loading"
3 => "LIFO"
4 => "branch and cut"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1002/net.20375"
"publicationInfo" => array:3 [
"pages" => "229-243"
"volume" => "56"
"number" => "4"
]
"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" => "In this paper we present mathematical programming formulations and solution approaches for the optimal solution of the Double Travelling Salesman Problem with Multiple Stacks (DTSPMS). A set of orders is given, each one requiring transportation of one item from a customer in a pickup region to a customer in a delivery region. The vehicle available for the transportation in each region carries a container. The container is organized in rows of given length. Each row is handled independently from the others according to a LIFO (Last In First Out) stack policy. The DTSPMS problem consists of determining the pickup tour, the loading plan of the container and the delivery tour in such a way that the total length of the two tours is minimized. The formulations are based on different modelling ideas and each formulation gives rise to a specific solution approach. We present computational results on a set of benchmark instances that compare the different approaches and show that the most successful one is a decomposition approach applied to a new model."
"en" => "In this paper we present mathematical programming formulations and solution approaches for the optimal solution of the Double Travelling Salesman Problem with Multiple Stacks (DTSPMS). A set of orders is given, each one requiring transportation of one item from a customer in a pickup region to a customer in a delivery region. The vehicle available for the transportation in each region carries a container. The container is organized in rows of given length. Each row is handled independently from the others according to a LIFO (Last In First Out) stack policy. The DTSPMS problem consists of determining the pickup tour, the loading plan of the container and the delivery tour in such a way that the total length of the two tours is minimized. The formulations are based on different modelling ideas and each formulation gives rise to a specific solution approach. We present computational results on a set of benchmark instances that compare the different approaches and show that the most successful one is a decomposition approach applied to a new model."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
26 => Essec\Faculty\Model\Contribution {#2307
#_index: "academ_contributions"
#_id: "12127"
#_source: array:18 [
"id" => "12127"
"slug" => "analysis-of-the-maximum-level-policy-in-a-production-distribution-system"
"yearMonth" => "2011-12"
"year" => "2011"
"title" => "Analysis of the maximum level policy in a production-distribution system"
"description" => "ARCHETTI, C., BERTAZZI, L., PALETTA, G. et SPERANZA, M.G. (2011). Analysis of the maximum level policy in a production-distribution system. <i>Computers & Operations Research</i>, 38(12), pp. 1731-1746."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bertazzi Luca"
]
2 => array:1 [
"name" => "Paletta Giuseppe"
]
3 => array:1 [
"name" => "Speranza M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Logistics"
1 => "Production"
2 => "Transportation"
3 => "Inventory"
4 => "Computational complexity"
5 => "Exact and hybrid heuristic algorithms"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2011.03.002"
"publicationInfo" => array:3 [
"pages" => "1731-1746"
"volume" => "38"
"number" => "12"
]
"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 consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the inventory. The production policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The overall cost is composed by fixed and variable production costs at the facility, inventory costs at both facility and retailers and routing costs. We study two different types of replenishment policies. The well-known order-up to level (OU) policy, where the quantity shipped to each retailer is such that the level of its inventory reaches the maximum level, and the maximum level (ML) policy, where the quantity shipped to each retailer is such that the inventory is not greater than the maximum level. We first show that when the transportation is outsourced, the problem with OU policy is NP-hard, whereas there exists a class of instances where the problem with ML policy can be solved in polynomial time. We also show the worst-case performance of the OU policy with respect to the more flexible ML policy. Then, we focus on the ML policy and the design of a hybrid heuristic. We also present an exact algorithm for the solution of the problem with one vehicle. Results of computational experiments carried out on small size instances show that the heuristic can produce high quality solutions in a very short amount of time. Results obtained on a large set of randomly generated problem instances are also shown, aimed at comparing the two policies."
"en" => "We consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the inventory. The production policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The overall cost is composed by fixed and variable production costs at the facility, inventory costs at both facility and retailers and routing costs. We study two different types of replenishment policies. The well-known order-up to level (OU) policy, where the quantity shipped to each retailer is such that the level of its inventory reaches the maximum level, and the maximum level (ML) policy, where the quantity shipped to each retailer is such that the inventory is not greater than the maximum level. We first show that when the transportation is outsourced, the problem with OU policy is NP-hard, whereas there exists a class of instances where the problem with ML policy can be solved in polynomial time. We also show the worst-case performance of the OU policy with respect to the more flexible ML policy. Then, we focus on the ML policy and the design of a hybrid heuristic. We also present an exact algorithm for the solution of the problem with one vehicle. Results of computational experiments carried out on small size instances show that the heuristic can produce high quality solutions in a very short amount of time. Results obtained on a large set of randomly generated problem instances are also shown, aimed at comparing the two policies."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
27 => Essec\Faculty\Model\Contribution {#2308
#_index: "academ_contributions"
#_id: "12128"
#_source: array:18 [
"id" => "12128"
"slug" => "a-column-generation-approach-for-the-split-delivery-vehicle-routing-problem"
"yearMonth" => "2011-12"
"year" => "2011"
"title" => "A column generation approach for the split delivery vehicle routing problem"
"description" => "ARCHETTI, C., BIANCHESSI, N. et SPERANZA, M.G. (2011). A column generation approach for the split delivery vehicle routing problem. <i>Networks</i>, 58(4), pp. 241-254."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchessi N."
]
2 => array:1 [
"name" => "Speranza M. G."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "split delivery vehicle routing problem"
1 => "unlimited and limited fleet"
2 => "column generation"
3 => " branch‐and‐price‐and‐cut method"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1002/net.20467"
"publicationInfo" => array:3 [
"pages" => "241-254"
"volume" => "58"
"number" => "4"
]
"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" => "In this article we present a branch‐and‐price‐and‐cut method for the solution of the split delivery vehicle routing problem (SDVRP). The SDVRP is the problem to serve customers with a fleet of capacitated vehicles at minimum traveling cost. With respect to the classical vehicle routing problem, where each customer is visited exactly once, in the SDVRP a customer may be visited any number of times. The exact method we propose is based on a decomposition of the problem where the possible routes, with the delivery quantities, are generated in the subproblem. The generated routes are also used to find a heuristic solution to the problem. We consider both the case where the fleet of vehicles is unlimited and the case where the fleet is limited to the minimum possible number of vehicles. We solve to optimality instances with larger size with respect to previous approaches, find new best solutions to several benchmark instances and reduce the optimality gap on most of the benchmark instances."
"en" => "In this article we present a branch‐and‐price‐and‐cut method for the solution of the split delivery vehicle routing problem (SDVRP). The SDVRP is the problem to serve customers with a fleet of capacitated vehicles at minimum traveling cost. With respect to the classical vehicle routing problem, where each customer is visited exactly once, in the SDVRP a customer may be visited any number of times. The exact method we propose is based on a decomposition of the problem where the possible routes, with the delivery quantities, are generated in the subproblem. The generated routes are also used to find a heuristic solution to the problem. We consider both the case where the fleet of vehicles is unlimited and the case where the fleet is limited to the minimum possible number of vehicles. We solve to optimality instances with larger size with respect to previous approaches, find new best solutions to several benchmark instances and reduce the optimality gap on most of the benchmark instances."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
28 => Essec\Faculty\Model\Contribution {#2309
#_index: "academ_contributions"
#_id: "12129"
#_source: array:18 [
"id" => "12129"
"slug" => "complexity-of-the-vrp-and-sdvrp"
"yearMonth" => "2011-08"
"year" => "2011"
"title" => "Complexity of the VRP and SDVRP"
"description" => "ARCHETTI, C., FEILLET, D., GENDREAU, M. et SPERANZA, M.G. (2011). Complexity of the VRP and SDVRP. <i>Transportation Research Part C: Emerging Technologies</i>, 19(5), pp. 741-750."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Feillet Dominique"
]
2 => array:1 [
"name" => "Gendreau Michel"
]
3 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Vehicle routing problem"
1 => "Split delivery vehicle routing problem"
2 => "Computational complexity on line"
3 => "TreeStar"
4 => "Circle"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.trc.2009.12.006"
"publicationInfo" => array:3 [
"pages" => "741-750"
"volume" => "19"
"number" => "5"
]
"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" => "In this paper we study the computational complexity of the vehicle routing problem (VRP) and of the split delivery vehicle routing problem (SDVRP) on some special classes of instances, characterized by special structures of the underlying graph, namely a line, a star, a tree and a circle. We both study the problems in the case of unlimited fleet (UF) and under the constraint that a limited fleet is available (LF)."
"en" => "In this paper we study the computational complexity of the vehicle routing problem (VRP) and of the split delivery vehicle routing problem (SDVRP) on some special classes of instances, characterized by special structures of the underlying graph, namely a line, a star, a tree and a circle. We both study the problems in the case of unlimited fleet (UF) and under the constraint that a limited fleet is available (LF)."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
29 => Essec\Faculty\Model\Contribution {#2310
#_index: "academ_contributions"
#_id: "12130"
#_source: array:18 [
"id" => "12130"
"slug" => "enhanced-branch-and-price-and-cut-for-vehicle-routing-with-split-deliveries-and-time-windows"
"yearMonth" => "2011-08"
"year" => "2011"
"title" => "Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows"
"description" => "ARCHETTI, C., BOUCHARD, M. et DESAULNIERS, G. (2011). Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows. <i>Transportation Science</i>, 45(3), pp. 285-298."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "BOUCHARD M."
]
2 => array:1 [
"name" => "DESAULNIERS G."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "vehicle routing"
1 => "time windows"
2 => "split deliveries"
3 => "branch and price"
4 => "valid inequalities"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://www.jstor.org/stable/23018528"
"publicationInfo" => array:3 [
"pages" => "285-298"
"volume" => "45"
"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" => "In this paper, we study the split delivery vehicle routing problem with time windows (SDVRPTW) that is a variant of the well-known vehicle routing problem with time windows (VRPTW), where each customer can be served by more than one vehicle. We propose enhancement procedures for the exact branch-and-priceand-cut algorithm that was recently developed for the SDVRPTW. In particular, we introduce a tabu search algorithm to solve the column-generation subproblem, extensions of several classes of valid inequalities, and a new separation algorithm for the k-path inequalities. Computational results show the effectiveness of the proposed enhancements."
"en" => "In this paper, we study the split delivery vehicle routing problem with time windows (SDVRPTW) that is a variant of the well-known vehicle routing problem with time windows (VRPTW), where each customer can be served by more than one vehicle. We propose enhancement procedures for the exact branch-and-priceand-cut algorithm that was recently developed for the SDVRPTW. In particular, we introduce a tabu search algorithm to solve the column-generation subproblem, extensions of several classes of valid inequalities, and a new separation algorithm for the k-path inequalities. Computational results show the effectiveness of the proposed enhancements."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
30 => Essec\Faculty\Model\Contribution {#2311
#_index: "academ_contributions"
#_id: "12131"
#_source: array:18 [
"id" => "12131"
"slug" => "a-hybrid-heuristic-for-an-inventory-routing-problem"
"yearMonth" => "2012-02"
"year" => "2012"
"title" => "A Hybrid Heuristic for an Inventory Routing Problem"
"description" => "ARCHETTI, C., BERTAZZI, L., HERTZ, A. et SPERANZA, M.G. (2012). A Hybrid Heuristic for an Inventory Routing Problem. <i>INFORMS Journal on Computing</i>, 24(1), pp. 101-116."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bertazzi Luca"
]
2 => array:1 [
"name" => "Hertz Alain"
]
3 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1287/ijoc.1100.0439"
"publicationInfo" => array:3 [
"pages" => "101-116"
"volume" => "24"
"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" => "We consider an inventory routing problem in discrete time where a supplier has to serve a set of customers over a multiperiod horizon. A capacity constraint for the inventory is given for each customer, and the service cannot cause any stockout situation. Two different replenishment policies are considered: the order-up-to-level and the maximum-level policies. A single vehicle with a given capacity is available. The transportation cost is proportional to the distance traveled, whereas the inventory holding cost is proportional to the level of the inventory at the customers and at the supplier. The objective is the minimization of the sum of the inventory and transportation costs. We present a heuristic that combines a tabu search scheme with ad hoc designed mixed-integer programming models. The effectiveness of the heuristic is proved over a set of benchmark instances for which the optimal solution is known."
"en" => "We consider an inventory routing problem in discrete time where a supplier has to serve a set of customers over a multiperiod horizon. A capacity constraint for the inventory is given for each customer, and the service cannot cause any stockout situation. Two different replenishment policies are considered: the order-up-to-level and the maximum-level policies. A single vehicle with a given capacity is available. The transportation cost is proportional to the distance traveled, whereas the inventory holding cost is proportional to the level of the inventory at the customers and at the supplier. The objective is the minimization of the sum of the inventory and transportation costs. We present a heuristic that combines a tabu search scheme with ad hoc designed mixed-integer programming models. The effectiveness of the heuristic is proved over a set of benchmark instances for which the optimal solution is known."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
31 => Essec\Faculty\Model\Contribution {#2312
#_index: "academ_contributions"
#_id: "12132"
#_source: array:18 [
"id" => "12132"
"slug" => "vehicle-routing-problems-with-split-deliveries"
"yearMonth" => "2012-01"
"year" => "2012"
"title" => "Vehicle routing problems with split deliveries"
"description" => "ARCHETTI, C. et SPERANZA, M.G. (2012). Vehicle routing problems with split deliveries. <i>International Transactions in Operational Research</i>, 19(1-2), pp. 3-22."
"authors" => array:2 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "traveling salesman problem"
1 => "vehicle routing problem"
2 => "split deliveries"
3 => "survey"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1111/j.1475-3995.2011.00811.x"
"publicationInfo" => array:3 [
"pages" => "3-22"
"volume" => "19"
"number" => "1-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 paper is a survey on the vehicle routing problems with split deliveries, a class of routing problems where each customer may be served by more than one vehicle. Starting from the most classical routing problems, we introduce the split delivery vehicle routing problem (SDVRP). We review a formulation, the main properties and exact and heuristic solution approaches for the SDVRP. Then, we present a general overview of several variants of the SDVRP and of the literature available."
"en" => "This paper is a survey on the vehicle routing problems with split deliveries, a class of routing problems where each customer may be served by more than one vehicle. Starting from the most classical routing problems, we introduce the split delivery vehicle routing problem (SDVRP). We review a formulation, the main properties and exact and heuristic solution approaches for the SDVRP. Then, we present a general overview of several variants of the SDVRP and of the literature available."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
32 => Essec\Faculty\Model\Contribution {#2313
#_index: "academ_contributions"
#_id: "12134"
#_source: array:18 [
"id" => "12134"
"slug" => "truck-driver-scheduling-in-australia"
"yearMonth" => "2012-05"
"year" => "2012"
"title" => "Truck driver scheduling in Australia"
"description" => "GOEL, A., ARCHETTI, C. et SAVELSBERGH, M. (2012). Truck driver scheduling in Australia. <i>Computers & Operations Research</i>, 39(5), pp. 1122-1132."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Goel Asvin"
]
2 => array:1 [
"name" => "Savelsbergh Martin"
]
]
"ouvrage" => ""
"keywords" => array:2 [
0 => "Vehicle scheduling"
1 => "Hours of service regulations"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2011.05.021"
"publicationInfo" => array:3 [
"pages" => "1122-1132"
"volume" => "39"
"number" => "5"
]
"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" => "In September 2008 new regulations for managing heavy vehicle driver fatigue entered into force in Australia. According to the new regulations there is a chain of responsibility ranging from drivers to dispatchers and shippers and thus, carriers must explicitly consider driving and working hour regulations when generating truck driver schedules. This paper presents and studies the Australian Truck Driver Scheduling Problem (AUS-TDSP) which is the problem of determining whether a sequence of locations can be visited within given time windows in such a way that driving and working activities of truck drivers comply with Australian Heavy Vehicle Driver Fatigue Law."
"en" => "In September 2008 new regulations for managing heavy vehicle driver fatigue entered into force in Australia. According to the new regulations there is a chain of responsibility ranging from drivers to dispatchers and shippers and thus, carriers must explicitly consider driving and working hour regulations when generating truck driver schedules. This paper presents and studies the Australian Truck Driver Scheduling Problem (AUS-TDSP) which is the problem of determining whether a sequence of locations can be visited within given time windows in such a way that driving and working activities of truck drivers comply with Australian Heavy Vehicle Driver Fatigue Law."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
33 => Essec\Faculty\Model\Contribution {#2314
#_index: "academ_contributions"
#_id: "12135"
#_source: array:18 [
"id" => "12135"
"slug" => "a-branch-and-cut-algorithm-for-the-pickup-and-delivery-traveling-salesman-problem-with-multiple-stacks"
"yearMonth" => "2012-12"
"year" => "2012"
"title" => "A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks"
"description" => "CÔTÉ, J.F., ARCHETTI, C., SPERANZA, M.G., GENDREAU, M. et POTVIN, J.Y. (2012). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. <i>Networks</i>, 60(4), pp. 212-226."
"authors" => array:5 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Côté Jean-François"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
3 => array:1 [
"name" => "Gendreau Michel"
]
4 => array:1 [
"name" => "Potvin Jean-Yves"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1002/net.21459"
"publicationInfo" => array:3 [
"pages" => "212-226"
"volume" => "60"
"number" => "4"
]
"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 article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last‐in‐first‐out constraint that states that any new item must be loaded on top of a stack and any unloaded item must be on top of its stack. A branch‐and‐cut algorithm is proposed for solving this problem. Computational results are reported on different types of randomly generated instances as well as on classical instances for some well‐known special cases of the problem. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012"
"en" => "This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last‐in‐first‐out constraint that states that any new item must be loaded on top of a stack and any unloaded item must be on top of its stack. A branch‐and‐cut algorithm is proposed for solving this problem. Computational results are reported on different types of randomly generated instances as well as on classical instances for some well‐known special cases of the problem. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
34 => Essec\Faculty\Model\Contribution {#2315
#_index: "academ_contributions"
#_id: "12138"
#_source: array:18 [
"id" => "12138"
"slug" => "reoptimizing-the-rural-postman-problem"
"yearMonth" => "2013-05"
"year" => "2013"
"title" => "Reoptimizing the rural postman problem"
"description" => "ARCHETTI, C., GUASTAROBA, G. et SPERANZA, M.G. (2013). Reoptimizing the rural postman problem. <i>Computers & Operations Research</i>, 40(5), pp. 1306-1313."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Guastaroba G."
]
2 => array:1 [
"name" => "Speranza M.G."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Reoptimization"
1 => "Rural postman problem"
2 => "Heuristic algorithms"
3 => "Worst-case analysis"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2012.12.010"
"publicationInfo" => array:3 [
"pages" => "1306-1313"
"volume" => "40"
"number" => "5"
]
"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 an instance of the Rural Postman Problem (RPP) together with its optimal solution, we study the problem of finding a good feasible solution after a perturbation of the instance has occurred. We refer to this problem as the reoptimization of the RPP. We first consider the case where a new required edge is added. Second, we address the case where an edge (required or not) is removed. We show that the reoptimization problems are -hard. We consider a heuristic for the case where a new required edge is added which is a modification of the cheapest insertion algorithm for the traveling salesman problem and show that it has a worst-case ratio equal to 2. Moreover, we show that simple algorithms to remove an edge from an optimal RPP tour guarantee a tight ratio equal to 3/2. Computational tests are made to compare the performance of these algorithms with respect to the Frederickson algorithm running from scratch."
"en" => "Given an instance of the Rural Postman Problem (RPP) together with its optimal solution, we study the problem of finding a good feasible solution after a perturbation of the instance has occurred. We refer to this problem as the reoptimization of the RPP. We first consider the case where a new required edge is added. Second, we address the case where an edge (required or not) is removed. We show that the reoptimization problems are -hard. We consider a heuristic for the case where a new required edge is added which is a modification of the cheapest insertion algorithm for the traveling salesman problem and show that it has a worst-case ratio equal to 2. Moreover, we show that simple algorithms to remove an edge from an optimal RPP tour guarantee a tight ratio equal to 3/2. Computational tests are made to compare the performance of these algorithms with respect to the Frederickson algorithm running from scratch."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
35 => Essec\Faculty\Model\Contribution {#2316
#_index: "academ_contributions"
#_id: "12139"
#_source: array:18 [
"id" => "12139"
"slug" => "optimal-solutions-for-routing-problems-with-profits"
"yearMonth" => "2013-03"
"year" => "2013"
"title" => "Optimal solutions for routing problems with profits"
"description" => "ARCHETTI, C., BIANCHESSI, N. et SPERANZA, M.G. (2013). Optimal solutions for routing problems with profits. <i>Discrete Applied Mathematics</i>, 161(4-5), pp. 547-557."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchessi N."
]
2 => array:1 [
"name" => "Speranza M.G."
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Routing"
1 => "Profits"
2 => "Branch-and-price"
3 => "Heuristic"
4 => "Capacitated Team Orienteering Problem"
5 => "Capacitated Profitable Tour Problem"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.dam.2011.12.021"
"publicationInfo" => array:3 [
"pages" => "547-557"
"volume" => "161"
"number" => "4-5"
]
"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" => "In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality."
"en" => "In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
36 => Essec\Faculty\Model\Contribution {#2317
#_index: "academ_contributions"
#_id: "12140"
#_source: array:18 [
"id" => "12140"
"slug" => "the-capacitated-team-orienteering-problem-with-incomplete-service"
"yearMonth" => "2013-10"
"year" => "2013"
"title" => "The capacitated team orienteering problem with incomplete service"
"description" => "ARCHETTI, C., BIANCHESSI, N. et SPERANZA, M.G. (2013). The capacitated team orienteering problem with incomplete service. <i>Optimization Letters</i>, 7, pp. 1405-1417."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchessi Nicola"
]
2 => array:1 [
"name" => "Speranza M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Capacitated Team Orienteering Problem"
1 => "Exact algorithms"
2 => "Incomplete service"
3 => "Split deliveries"
]
"updatedAt" => "2021-02-03 11:08:25"
"publicationUrl" => "https://link.springer.com/article/10.1007%2Fs11590-012-0559-4"
"publicationInfo" => array:3 [
"pages" => "1405-1417"
"volume" => "7"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue professionnelle"
"en" => "Professional journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this paper we study the capacitated version of the Team Orienteering Problem (TOP), that is the Capacitated TOP (CTOP) and the impact of relaxing the assumption that a customer, if served, must be completely served. We prove that the profit collected by the CTOP with Incomplete Service (CTOP-IS) may be as large as twice the profit collected by the CTOP. A computational study is also performed to evaluate the average increase of the profit due to allowing incomplete service. The results show that the increase of the profit strongly depends on the specific instance. On the tested instances the profit increase ranges between 0 and 50 %. We complete the computational study with the increase of the profit of the CTOP due to split deliveries, that is multiple visits to the same customer, and to split deliveries combined with incomplete service."
"en" => "In this paper we study the capacitated version of the Team Orienteering Problem (TOP), that is the Capacitated TOP (CTOP) and the impact of relaxing the assumption that a customer, if served, must be completely served. We prove that the profit collected by the CTOP with Incomplete Service (CTOP-IS) may be as large as twice the profit collected by the CTOP. A computational study is also performed to evaluate the average increase of the profit due to allowing incomplete service. The results show that the increase of the profit strongly depends on the specific instance. On the tested instances the profit increase ranges between 0 and 50 %. We complete the computational study with the increase of the profit of the CTOP due to split deliveries, that is multiple visits to the same customer, and to split deliveries combined with incomplete service."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
37 => Essec\Faculty\Model\Contribution {#2318
#_index: "academ_contributions"
#_id: "12141"
#_source: array:18 [
"id" => "12141"
"slug" => "a-heuristic-algorithm-for-the-free-newspaper-delivery-problem"
"yearMonth" => "2013-10"
"year" => "2013"
"title" => "A heuristic algorithm for the free newspaper delivery problem"
"description" => "ARCHETTI, C., DOERNER, K.F. et TRICOIRE, F. (2013). A heuristic algorithm for the free newspaper delivery problem. <i>European Journal of Operational Research</i>, 230(2), pp. 245-257."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Doerner Karl F."
]
2 => array:1 [
"name" => "Tricoire Fabien"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Vehicle routing problem with time windows"
1 => "Inventory routing"
2 => "Production schedule"
3 => "Metaheuristics"
4 => "Hybrid methods"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0377221713003536?via%3Dihub"
"publicationInfo" => array:3 [
"pages" => "245-257"
"volume" => "230"
"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 paper addresses the problem of finding an effective distribution plan to deliver free newspapers from a production plant to subway, bus, or tram stations. The overall goal is to combine two factors: first, the free newspaper producing company wants to minimize the number of vehicle trips needed to distribute all newspapers produced at the production plant. Second, the company is interested in minimizing the time needed to consume all newspapers, i.e., the time needed to get all the newspapers taken by the final readers. The resulting routing problem combines aspects of the vehicle routing problem with time windows, the inventory routing problem, and additional constraints related to the production schedule. We propose a formulation and different heuristic approaches, as well as a hybrid method. Computational tests with real world data show that the hybrid method is the best in various problem settings."
"en" => "This paper addresses the problem of finding an effective distribution plan to deliver free newspapers from a production plant to subway, bus, or tram stations. The overall goal is to combine two factors: first, the free newspaper producing company wants to minimize the number of vehicle trips needed to distribute all newspapers produced at the production plant. Second, the company is interested in minimizing the time needed to consume all newspapers, i.e., the time needed to get all the newspapers taken by the final readers. The resulting routing problem combines aspects of the vehicle routing problem with time windows, the inventory routing problem, and additional constraints related to the production schedule. We propose a formulation and different heuristic approaches, as well as a hybrid method. Computational tests with real world data show that the hybrid method is the best in various problem settings."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
38 => Essec\Faculty\Model\Contribution {#2319
#_index: "academ_contributions"
#_id: "12142"
#_source: array:18 [
"id" => "12142"
"slug" => "an-ilp-refined-tabu-search-for-the-directed-profitable-rural-postman-problem"
"yearMonth" => "2014-01"
"year" => "2014"
"title" => "An ILP-refined tabu search for the Directed Profitable Rural Postman Problem"
"description" => "ARCHETTI, C., GUASTAROBA, G. et SPERANZA, M.G. (2014). An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. <i>Discrete Applied Mathematics</i>, 163, pp. 3-16."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Guastaroba G."
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "Selective arc routing problems"
1 => "Heuristic algorithms"
2 => "ILP-refinement procedures"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1016/j.dam.2012.06.002"
"publicationInfo" => array:3 [
"pages" => "3-16"
"volume" => "163"
"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" => "In transportation services, the costs are highly dependent on the opportunity to serve neighboring customers. In this paper we study the problem faced by a shipper that has to serve a set of customers with one internal vehicle and to outsource the service of some of them. The problem is to identify the set of customers to outsource with the goal of minimizing the sum of the traveling costs (routing costs) and the costs associated with the outsourced customers (penalty costs). As the problem can be expressed as the maximization of the difference between a profit gained from the served customers and the traveling cost, we call this problem the Directed Profitable Rural Postman Problem (DPRPP). We propose an ILP-refined tabu search algorithm that combines a tabu search scheme with an Integer Linear Programming (ILP) model. Computational experiments carried out on several sets of instances show the good performance of the proposed solution procedure."
"en" => "In transportation services, the costs are highly dependent on the opportunity to serve neighboring customers. In this paper we study the problem faced by a shipper that has to serve a set of customers with one internal vehicle and to outsource the service of some of them. The problem is to identify the set of customers to outsource with the goal of minimizing the sum of the traveling costs (routing costs) and the costs associated with the outsourced customers (penalty costs). As the problem can be expressed as the maximization of the difference between a profit gained from the served customers and the traveling cost, we call this problem the Directed Profitable Rural Postman Problem (DPRPP). We propose an ILP-refined tabu search algorithm that combines a tabu search scheme with an Integer Linear Programming (ILP) model. Computational experiments carried out on several sets of instances show the good performance of the proposed solution procedure."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
39 => Essec\Faculty\Model\Contribution {#2320
#_index: "academ_contributions"
#_id: "12143"
#_source: array:18 [
"id" => "12143"
"slug" => "the-split-delivery-capacitated-team-orienteering-problem"
"yearMonth" => "2014-01"
"year" => "2014"
"title" => "The split delivery capacitated team orienteering problem"
"description" => "ARCHETTI, C., BIANCHESSI, N., SPERANZA, M.G. et HERTZ, A. (2014). The split delivery capacitated team orienteering problem. <i>Global Networks</i>, 63(1), pp. 16-33."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchessi N."
]
2 => array:1 [
"name" => "Speranza M.G."
]
3 => array:1 [
"name" => "Hertz A."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "capacitated team orienteering problem"
1 => "split deliveries"
2 => " worst‐case analysis"
3 => "branch‐and‐price"
4 => "heuristic"
]
"updatedAt" => "2021-07-13 14:32:00"
"publicationUrl" => "https://doi.org/10.1002/net.21519"
"publicationInfo" => array:3 [
"pages" => "16-33"
"volume" => "63"
"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" => "In this article, we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the profit collected is maximized, while satisfying constraints on the maximum time duration of each route and the vehicle capacity constraints. When split deliveries are allowed, each customer may be served by more than one vehicle. We show that the profit collected by allowing split deliveries may be as large as twice the profit collected under the constraint that each customer has to be served by one vehicle at most. We then present a branch‐and‐price exact algorithm and a hybrid heuristic. We show the effectiveness of the proposed approaches on benchmark instances and on a new set of instances that allow us to computationally evaluate the impact of split deliveries. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(1), 16–33 2014"
"en" => "In this article, we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the profit collected is maximized, while satisfying constraints on the maximum time duration of each route and the vehicle capacity constraints. When split deliveries are allowed, each customer may be served by more than one vehicle. We show that the profit collected by allowing split deliveries may be as large as twice the profit collected under the constraint that each customer has to be served by one vehicle at most. We then present a branch‐and‐price exact algorithm and a hybrid heuristic. We show the effectiveness of the proposed approaches on benchmark instances and on a new set of instances that allow us to computationally evaluate the impact of split deliveries. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(1), 16–33 2014"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
40 => Essec\Faculty\Model\Contribution {#2321
#_index: "academ_contributions"
#_id: "12144"
#_source: array:18 [
"id" => "12144"
"slug" => "a-two-phase-solution-algorithm-for-the-flexible-periodic-vehicle-routing-problem"
"yearMonth" => "2018-11"
"year" => "2018"
"title" => "A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem"
"description" => "ARCHETTI, C., FERNÁNDEZ, E. et HUERTA-MUÑOZ, D.L. (2018). A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. <i>Computers & Operations Research</i>, 99, pp. 27-37."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Fernández Elena"
]
2 => array:1 [
"name" => "Huerta-Muñoz Diana L."
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "Flexible periodic vehicle routing"
1 => "Matheuristic"
2 => "Service frequency"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2018.05.021"
"publicationInfo" => array:3 [
"pages" => "27-37"
"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" => "The Flexible Periodic Vehicle Routing Problem is the problem of visiting a given set of customers considering a certain periodicity to attend their demands. It is a generalization of the Periodic Vehicle Routing Problem where the fixed schedule constraint is relaxed and the quantity to deliver to each customer at each visit is a decision variable. This flexibility leads to remarkable savings in total costs and this explains the interest in studying the problem and developing effective solution approaches. In this work, an iterative two-phase matheuristic is developed to solve medium and large instances of the problem. Computational tests are made on benchmark instances and on newly generated instances. The results of the matheuristic are compared to the best-known solutions, on small-size instances, and to lower bounds on larger instances. Computational results show that good quality solutions are obtained in a reasonable amount of time."
"en" => "The Flexible Periodic Vehicle Routing Problem is the problem of visiting a given set of customers considering a certain periodicity to attend their demands. It is a generalization of the Periodic Vehicle Routing Problem where the fixed schedule constraint is relaxed and the quantity to deliver to each customer at each visit is a decision variable. This flexibility leads to remarkable savings in total costs and this explains the interest in studying the problem and developing effective solution approaches. In this work, an iterative two-phase matheuristic is developed to solve medium and large instances of the problem. Computational tests are made on benchmark instances and on newly generated instances. The results of the matheuristic are compared to the best-known solutions, on small-size instances, and to lower bounds on larger instances. Computational results show that good quality solutions are obtained in a reasonable amount of time."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
41 => Essec\Faculty\Model\Contribution {#2322
#_index: "academ_contributions"
#_id: "12145"
#_source: array:18 [
"id" => "12145"
"slug" => "an-iterated-local-search-for-the-traveling-salesman-problem-with-release-dates-and-completion-time-minimization"
"yearMonth" => "2018-10"
"year" => "2018"
"title" => "An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization"
"description" => "ARCHETTI, C., FEILLET, D., MOR, A. et SPERANZA, M.G. (2018). An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization. <i>Computers & Operations Research</i>, 98, pp. 24-37."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Feillet Dominique"
]
2 => array:1 [
"name" => "Mor Andrea"
]
3 => array:1 [
"name" => "Speranza M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Traveling Salesman Problem with release dates"
1 => "Heuristics"
2 => "Matheuristics"
3 => "Iterated local search"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2018.05.001"
"publicationInfo" => array:3 [
"pages" => "24-37"
"volume" => "98"
"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" => "In the Traveling Salesman Problem (TSP) with release dates and completion time minimization an uncapacitated vehicle delivers to customers goods which arrive at the depot over time. A customer cannot be served before the demanded goods arrive at the depot. A release date is associated with each customer which represents the time at which the goods requested by the customer arrive at the depot. The vehicle may perform multiple routes, all starting and ending at the depot. The release dates of the customers served in each route must be not larger than the time at which the route starts. The objective of the problem is to minimize the total time needed to serve all customers, given by the sum of the traveling time and the waiting time at the depot. The waiting time is due to the fact that the vehicle has to wait at the depot until the latest release date of the customers it is going to serve in the next route. We introduce some properties, propose a mathematical programming formulation and present a heuristic approach based on an iterated local search where the perturbation is performed by means of a destroy-and-repair method. Two alternative repair operators, one simple and fast and the other based on a mathematical programming model, are proposed, which give rise to two variants of the heuristic. The mathematical formulation is used to find the optimal solution on instances with up to 20 customers, built from benchmark instances for the classical TSP. Comparison with optimal solutions shows that both algorithms provide high-quality solutions. Tests are also made on larger instances to compare the performance of the two variants of the heuristic."
"en" => "In the Traveling Salesman Problem (TSP) with release dates and completion time minimization an uncapacitated vehicle delivers to customers goods which arrive at the depot over time. A customer cannot be served before the demanded goods arrive at the depot. A release date is associated with each customer which represents the time at which the goods requested by the customer arrive at the depot. The vehicle may perform multiple routes, all starting and ending at the depot. The release dates of the customers served in each route must be not larger than the time at which the route starts. The objective of the problem is to minimize the total time needed to serve all customers, given by the sum of the traveling time and the waiting time at the depot. The waiting time is due to the fact that the vehicle has to wait at the depot until the latest release date of the customers it is going to serve in the next route. We introduce some properties, propose a mathematical programming formulation and present a heuristic approach based on an iterated local search where the perturbation is performed by means of a destroy-and-repair method. Two alternative repair operators, one simple and fast and the other based on a mathematical programming model, are proposed, which give rise to two variants of the heuristic. The mathematical formulation is used to find the optimal solution on instances with up to 20 customers, built from benchmark instances for the classical TSP. Comparison with optimal solutions shows that both algorithms provide high-quality solutions. Tests are also made on larger instances to compare the performance of the two variants of the heuristic."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
42 => Essec\Faculty\Model\Contribution {#2323
#_index: "academ_contributions"
#_id: "12146"
#_source: array:18 [
"id" => "12146"
"slug" => "comparing-sequential-and-integrated-approaches-for-the-production-routing-problem"
"yearMonth" => "2018-09"
"year" => "2018"
"title" => "Comparing sequential and integrated approaches for the production routing problem"
"description" => "ABSI, N., ARCHETTI, C., DAUZÈRE-PÉRÈS, S., FEILLET, D. et SPERANZA, M.G. (2018). Comparing sequential and integrated approaches for the production routing problem. <i>European Journal of Operational Research</i>, 269(2), pp. 633-646."
"authors" => array:5 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Absi Nabil"
]
2 => array:1 [
"name" => "Dauzère-Pérès Stéphane"
]
3 => array:1 [
"name" => "Feillet Dominique"
]
4 => array:1 [
"name" => "Speranza M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Production routing"
1 => "Lot sizing"
2 => "Inventory routing"
3 => "Sequential optimization"
4 => "Global optimization"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2018.01.052"
"publicationInfo" => array:3 [
"pages" => "633-646"
"volume" => "269"
"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" => "We consider the Production Routing Problem where production planning, inventory management and distribution planning decisions must be taken. We compare two sequential approaches, one in which production decisions are optimized first and one in which distribution decisions are optimized first, with an integrated approach where all decisions are simultaneously optimized. Some properties of the solutions obtained with the different approaches are shown. Computational experiments are performed on instances of different size which are generated using two critical parameters. The numerical results illustrate the properties and show that the benefits of the integrated approach over the two sequential ones depend on the trade-off between production and distribution costs and on the trade-off between setup and inventory costs in production."
"en" => "We consider the Production Routing Problem where production planning, inventory management and distribution planning decisions must be taken. We compare two sequential approaches, one in which production decisions are optimized first and one in which distribution decisions are optimized first, with an integrated approach where all decisions are simultaneously optimized. Some properties of the solutions obtained with the different approaches are shown. Computational experiments are performed on instances of different size which are generated using two critical parameters. The numerical results illustrate the properties and show that the benefits of the integrated approach over the two sequential ones depend on the trade-off between production and distribution costs and on the trade-off between setup and inventory costs in production."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
43 => Essec\Faculty\Model\Contribution {#2324
#_index: "academ_contributions"
#_id: "12147"
#_source: array:18 [
"id" => "12147"
"slug" => "a-simulation-study-of-an-on-demand-transportation-system"
"yearMonth" => "2018-07"
"year" => "2018"
"title" => "A simulation study of an on-demand transportation system"
"description" => "ARCHETTI, C., SPERANZA, M.G. et WEYLAND, D. (2018). A simulation study of an on-demand transportation system. <i>International Transactions in Operational Research</i>, 25(4), pp. 1137-1161."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Speranza M. Grazia"
]
2 => array:1 [
"name" => "Weyland Dennis"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "simulation"
1 => "demand‐responsive transit systems"
2 => "on‐demand transportation"
3 => " conventional public transportation"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1111/itor.12476"
"publicationInfo" => array:3 [
"pages" => "1137-1161"
"volume" => "25"
"number" => "4"
]
"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" => "In this paper we present the results of a simulation study aimed at assessing an on‐demand transportation system. The on‐demand system uses minibuses that have neither fixed itineraries nor fixed stops. The minibuses are dynamically routed to accommodate the requests received by the users. To use the on‐demand service, users communicate, close to their desired departure time, the origin and destination of the trip. They accept the service if the estimated arrival time at destination fulfills their service level threshold. In the simulation users may decide whether to walk, to use a standard bus, to call the on‐demand service, and, if none of these options is satisfactory, to use a private car. We consider different scenarios to assess the potential benefits of the introduction of an on‐demand service. We also analyze the scalability and responsiveness of the service. The results suggest that an on‐demand system may be able to satisfy a large portion of user transportation requests and may be put beside standard transportation systems in order to provide a better transportation service to the users and substantially reduce the use of private cars."
"en" => "In this paper we present the results of a simulation study aimed at assessing an on‐demand transportation system. The on‐demand system uses minibuses that have neither fixed itineraries nor fixed stops. The minibuses are dynamically routed to accommodate the requests received by the users. To use the on‐demand service, users communicate, close to their desired departure time, the origin and destination of the trip. They accept the service if the estimated arrival time at destination fulfills their service level threshold. In the simulation users may decide whether to walk, to use a standard bus, to call the on‐demand service, and, if none of these options is satisfactory, to use a private car. We consider different scenarios to assess the potential benefits of the introduction of an on‐demand service. We also analyze the scalability and responsiveness of the service. The results suggest that an on‐demand system may be able to satisfy a large portion of user transportation requests and may be put beside standard transportation systems in order to provide a better transportation service to the users and substantially reduce the use of private cars."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
44 => Essec\Faculty\Model\Contribution {#2325
#_index: "academ_contributions"
#_id: "12148"
#_source: array:18 [
"id" => "12148"
"slug" => "inventory-routing-with-pickups-and-deliveries"
"yearMonth" => "2018-07"
"year" => "2018"
"title" => "Inventory routing with pickups and deliveries"
"description" => "ARCHETTI, C., CHRISTIANSEN, M. et GRAZIA SPERANZA, M. (2018). Inventory routing with pickups and deliveries. <i>European Journal of Operational Research</i>, 268(1), pp. 314-324."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Christiansen Marielle"
]
2 => array:1 [
"name" => "Grazia Speranza M."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Routing"
1 => "Pickup and delivery problems"
2 => "Inventory routing"
3 => "Valid inequalities"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2018.01.010"
"publicationInfo" => array:3 [
"pages" => "314-324"
"volume" => "268"
"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 introduces a class of problems which integrate pickup and delivery vehicle routing problems (PDPs) and inventory management, and we call them inventory routing problems with pickups and deliveries (IRP-PD). We consider a specific problem of this class, where a commodity is made available at several origins and demanded by several destinations. Time is discretized and transportation is performed by a single vehicle. A mathematical programming model is proposed together with several classes of valid inequalities. The models are solved with a branch-and-cut method. Computational tests are performed to show the effectiveness of the valid inequalities on instances generated from benchmark instances for the inventory routing problem. Results show that the branch-and-cut algorithm is able to solve to optimality 345 over 400 instances with up to 50 customers over 3 periods of time, and 142 over 240 instances with up to 30 customers and 6 periods. From a management perspective, results show that the average cost of a non integrated policy is more than 35% higher than the cost of an integrated policy."
"en" => "This paper introduces a class of problems which integrate pickup and delivery vehicle routing problems (PDPs) and inventory management, and we call them inventory routing problems with pickups and deliveries (IRP-PD). We consider a specific problem of this class, where a commodity is made available at several origins and demanded by several destinations. Time is discretized and transportation is performed by a single vehicle. A mathematical programming model is proposed together with several classes of valid inequalities. The models are solved with a branch-and-cut method. Computational tests are performed to show the effectiveness of the valid inequalities on instances generated from benchmark instances for the inventory routing problem. Results show that the branch-and-cut algorithm is able to solve to optimality 345 over 400 instances with up to 50 customers over 3 periods of time, and 142 over 240 instances with up to 30 customers and 6 periods. From a management perspective, results show that the average cost of a non integrated policy is more than 35% higher than the cost of an integrated policy."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
45 => Essec\Faculty\Model\Contribution {#2326
#_index: "academ_contributions"
#_id: "12149"
#_source: array:18 [
"id" => "12149"
"slug" => "the-set-orienteering-problem"
"yearMonth" => "2018-05"
"year" => "2018"
"title" => "The Set Orienteering Problem"
"description" => "ARCHETTI, C., CARRABS, F. et CERULLI, R. (2018). The Set Orienteering Problem. <i>European Journal of Operational Research</i>, 267(1), pp. 264-272."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Carrabs Francesco"
]
2 => array:1 [
"name" => "Cerulli Raffaele"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "Routing"
1 => "Orienteering problem"
2 => "Matheuristic"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2017.11.009"
"publicationInfo" => array:3 [
"pages" => "264-272"
"volume" => "267"
"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" => "In this paper, we study the Set Orienteering Problem which is a generalization of the Orienteering Problem where customers are grouped in clusters and a profit is associated with each cluster. The profit of a cluster is collected only if at least one customer from the cluster is visited. A single vehicle is available to collect the profit and the objective is to find the vehicle route that maximizes the profit collected and such that the route duration does not exceed a given threshold. We propose a mathematical formulation of the problem and a matheuristic algorithm. Computational tests are made on instances derived from benchmark instances for the Generalized Traveling Salesman Problem with up 1084 vertices. Results show that the matheuristic produces robust and high-quality solutions in a short computing time."
"en" => "In this paper, we study the Set Orienteering Problem which is a generalization of the Orienteering Problem where customers are grouped in clusters and a profit is associated with each cluster. The profit of a cluster is collected only if at least one customer from the cluster is visited. A single vehicle is available to collect the profit and the objective is to find the vehicle route that maximizes the profit collected and such that the route duration does not exceed a given threshold. We propose a mathematical formulation of the problem and a matheuristic algorithm. Computational tests are made on instances derived from benchmark instances for the Generalized Traveling Salesman Problem with up 1084 vertices. Results show that the matheuristic produces robust and high-quality solutions in a short computing time."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
46 => Essec\Faculty\Model\Contribution {#2327
#_index: "academ_contributions"
#_id: "12150"
#_source: array:18 [
"id" => "12150"
"slug" => "social-networks-and-health-status-in-the-elderly-the-anziani-in-rete-population-based-study"
"yearMonth" => "2017-12"
"year" => "2017"
"title" => "Social networks and health status in the elderly: the ‘ANZIANI IN-RETE’ population-based study"
"description" => "BIANCHETTI, L., SQUAZZONI, F., CASNICI, N., BIANCHINI, D., GARRAFA, E., ARCHETTI, C. ... MARENGONI, A. (2017). Social networks and health status in the elderly: the ‘ANZIANI IN-RETE’ population-based study. <i>Aging Clinical and Experimental Research</i>, 29(6), pp. 1173-1179."
"authors" => array:13 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchetti Luca"
]
2 => array:1 [
"name" => "Squazzoni Flaminio"
]
3 => array:1 [
"name" => "Casnici Niccolò"
]
4 => array:1 [
"name" => "Bianchini Devis"
]
5 => array:1 [
"name" => "Garrafa Emirena"
]
6 => array:1 [
"name" => "Romano Valentina"
]
7 => array:1 [
"name" => "Rozzini Luca"
]
8 => array:1 [
"name" => "Melchiori Michele"
]
9 => array:1 [
"name" => "Fiorentini Chiara"
]
10 => array:1 [
"name" => "Uberti Daniela"
]
11 => array:1 [
"name" => "Calza Stefano"
]
12 => array:1 [
"name" => "Marengoni Alessandra"
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Aging"
1 => "Chronic diseases"
2 => "Health status"
3 => "Network degree"
4 => "Social factors"
5 => "Social networks"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://link.springer.com/article/10.1007/s40520-017-0726-7"
"publicationInfo" => array:3 [
"pages" => "1173-1179"
"volume" => "29"
"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" => """
Background: Certain features of the social environment could maintain and even improve not only psychological well-being, but also health and cognition of the elderly.\n
\n
Aims: We tested the association between social network characteristics and the number of chronic diseases in the elderly.\n
\n
Methods: A randomized sample of the elderly population of Brescia, Italy, was evaluated (N = 200, age ≥65 years). We performed a comprehensive geriatric assessment, including information on socio-demographic variables (family, friendships, and acquaintance contacts). We measured each person's social network, i.e., degree, efficiency, and variety.\n
\n
Results: The sample included 118 women and 82 men, mean age 77.7 years. The mean number of chronic diseases was 3.5. A higher social network degree, i.e., more social connections, was associated with fewer diseases. We also found that having more contacts with people similar to each other or intense relationships with people who do not know each other were associated with fewer diseases.\n
\n
Conclusion: More healthy people tend to share certain characteristics of social networks. Our study indicates that it is important to look at diseases and health as complex phenomena, which requires integrating different levels of analysis.
"""
"en" => """
Background: Certain features of the social environment could maintain and even improve not only psychological well-being, but also health and cognition of the elderly.\n
\n
Aims: We tested the association between social network characteristics and the number of chronic diseases in the elderly.\n
\n
Methods: A randomized sample of the elderly population of Brescia, Italy, was evaluated (N = 200, age ≥65 years). We performed a comprehensive geriatric assessment, including information on socio-demographic variables (family, friendships, and acquaintance contacts). We measured each person's social network, i.e., degree, efficiency, and variety.\n
\n
Results: The sample included 118 women and 82 men, mean age 77.7 years. The mean number of chronic diseases was 3.5. A higher social network degree, i.e., more social connections, was associated with fewer diseases. We also found that having more contacts with people similar to each other or intense relationships with people who do not know each other were associated with fewer diseases.\n
\n
Conclusion: More healthy people tend to share certain characteristics of social networks. Our study indicates that it is important to look at diseases and health as complex phenomena, which requires integrating different levels of analysis.
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
47 => Essec\Faculty\Model\Contribution {#2328
#_index: "academ_contributions"
#_id: "12151"
#_source: array:18 [
"id" => "12151"
"slug" => "minimizing-the-logistic-ratio-in-the-inventory-routing-problem"
"yearMonth" => "2017-12"
"year" => "2017"
"title" => "Minimizing the logistic ratio in the inventory routing problem"
"description" => "ARCHETTI, C., DESAULNIERS, G. et SPERANZA, M.G. (2017). Minimizing the logistic ratio in the inventory routing problem. <i>EURO Journal on Transportation and Logistics</i>, 6(4), pp. 289-306."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Desaulniers Guy"
]
2 => array:1 [
"name" => "Speranza M. Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Planning Horizon"
1 => "Inventory Level"
2 => "Logistic Ratio"
3 => "Inventory Cost"
4 => "Vehicle Capacity"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://link.springer.com/article/10.1007/s13676-016-0097-9?shared-article-renderer"
"publicationInfo" => array:3 [
"pages" => "289-306"
"volume" => "6"
"number" => "4"
]
"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" => "Inventory routing problems (IRPs) aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that the customers do not incur a stock-out event. In an optimal solution of an IRP, the customers in general have no inventory at the end of the horizon. Some inventory may remain only if this does not increase the cost of the distance traveled. To avoid this ending drawback, we consider in this paper as objective function the so-called logistic ratio, which is the ratio of the total routing cost to the total quantity distributed. The logistic ratio gives rise to a new optimization problem whose mathematical programming formulation is non-linear. Using a classical method, we can solve exactly instances with up to 5 vehicles and 15 customers over 3 periods. The solutions are compared with those of a classical IRP, both from the worst-case point of view and computationally. The results show that on average the logistic ratio increases by 20.4 % in the classical IRP on instances with 3 periods and that the percentage decreases when the horizon length increases."
"en" => "Inventory routing problems (IRPs) aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that the customers do not incur a stock-out event. In an optimal solution of an IRP, the customers in general have no inventory at the end of the horizon. Some inventory may remain only if this does not increase the cost of the distance traveled. To avoid this ending drawback, we consider in this paper as objective function the so-called logistic ratio, which is the ratio of the total routing cost to the total quantity distributed. The logistic ratio gives rise to a new optimization problem whose mathematical programming formulation is non-linear. Using a classical method, we can solve exactly instances with up to 5 vehicles and 15 customers over 3 periods. The solutions are compared with those of a classical IRP, both from the worst-case point of view and computationally. The results show that on average the logistic ratio increases by 20.4 % in the classical IRP on instances with 3 periods and that the percentage decreases when the horizon length increases."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
48 => Essec\Faculty\Model\Contribution {#2329
#_index: "academ_contributions"
#_id: "12152"
#_source: array:18 [
"id" => "12152"
"slug" => "a-matheuristic-for-the-multivehicle-inventory-routing-problem"
"yearMonth" => "2017-08"
"year" => "2017"
"title" => "A Matheuristic for the Multivehicle Inventory Routing Problem"
"description" => "ARCHETTI, C., BOLAND, N. et SPERANZA, M.G. (2017). A Matheuristic for the Multivehicle Inventory Routing Problem. <i>INFORMS Journal on Computing</i>, 29(3), pp. 377-387."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Boland Natashia"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1287/ijoc.2016.0737"
"publicationInfo" => array:3 [
"pages" => "377-387"
"volume" => "29"
"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 consider the inventory routing problem, in which a supplier has to replenish a set of customers by means of a limited fleet of capacitated vehicles over a discrete time horizon. The goal is to minimize the total cost of the distribution that comprises the inventory cost at the supplier and at the customers and the routing cost. We present a matheuristic that combines a tabu search and mathematical programming formulations. When compared with two exact methods on 640 small instances, the matheuristic finds 192 (48%) optima over the 402 instances with known optima and improves 125 upper bounds. Tested on 240 large instances (with up to 200 customers) for which no optimal solutions are known, it improves the best solution for 220 (92%) of the 240 instances."
"en" => "We consider the inventory routing problem, in which a supplier has to replenish a set of customers by means of a limited fleet of capacitated vehicles over a discrete time horizon. The goal is to minimize the total cost of the distribution that comprises the inventory cost at the supplier and at the customers and the routing cost. We present a matheuristic that combines a tabu search and mathematical programming formulations. When compared with two exact methods on 640 small instances, the matheuristic finds 192 (48%) optima over the 402 instances with known optima and improves 125 upper bounds. Tested on 240 large instances (with up to 200 customers) for which no optimal solutions are known, it improves the best solution for 220 (92%) of the 240 instances."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
49 => Essec\Faculty\Model\Contribution {#2330
#_index: "academ_contributions"
#_id: "12153"
#_source: array:18 [
"id" => "12153"
"slug" => "clinical-laboratory-automation-a-case-study"
"yearMonth" => "2017-04"
"year" => "2017"
"title" => "Clinical laboratory automation: a case study"
"description" => "ARCHETTI, C., MONTANELLI, A., FINAZZI, D., CAIMI, L. et GARRAFA, E. (2017). Clinical laboratory automation: a case study. <i>Journal of Public Health Research</i>, 6(1)."
"authors" => array:5 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Montanelli Alessandro"
]
2 => array:1 [
"name" => "Finazzi Dario"
]
3 => array:1 [
"name" => "Caimi Luigi"
]
4 => array:1 [
"name" => "Garrafa Emirena"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "cost analysis"
1 => "direct and indirect costs"
2 => "equipment"
3 => "laboratory automation"
4 => "staff"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.4081/jphr.2017.881"
"publicationInfo" => array:3 [
"pages" => null
"volume" => "6"
"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" => """
Background: This paper presents a case study of an automated clinical laboratory in a large urban academic teaching hospital in the North of Italy, the Spedali Civili in Brescia, where four laboratories were merged in a unique laboratory through the introduction of laboratory automation.\n
Materials and methods: The analysis compares the preautomation situation and the new setting from a cost perspective, by considering direct and indirect costs. It also presents an analysis of the turnaround time (TAT). The study considers equipment, staff and indirect costs.\n
Results: The introduction of automation led to a slight increase in equipment costs which is highly compensated by a remarkable decrease in staff costs. Consequently, total costs decreased by 12.55%. The analysis of the TAT shows an improvement of nonemergency exams while emergency exams are still validated within the maximum time imposed by the hospital.\n
Conclusions: The strategy adopted by the management, which was based on re-using the available equipment and staff when merging the pre-existing laboratories, has reached its goal: introducing automation while minimizing the costs.
"""
"en" => """
Background: This paper presents a case study of an automated clinical laboratory in a large urban academic teaching hospital in the North of Italy, the Spedali Civili in Brescia, where four laboratories were merged in a unique laboratory through the introduction of laboratory automation.\n
Materials and methods: The analysis compares the preautomation situation and the new setting from a cost perspective, by considering direct and indirect costs. It also presents an analysis of the turnaround time (TAT). The study considers equipment, staff and indirect costs.\n
Results: The introduction of automation led to a slight increase in equipment costs which is highly compensated by a remarkable decrease in staff costs. Consequently, total costs decreased by 12.55%. The analysis of the TAT shows an improvement of nonemergency exams while emergency exams are still validated within the maximum time imposed by the hospital.\n
Conclusions: The strategy adopted by the management, which was based on re-using the available equipment and staff when merging the pre-existing laboratories, has reached its goal: introducing automation while minimizing the costs.
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
50 => Essec\Faculty\Model\Contribution {#2331
#_index: "academ_contributions"
#_id: "12154"
#_source: array:18 [
"id" => "12154"
"slug" => "the-probabilistic-orienteering-problem"
"yearMonth" => "2017-05"
"year" => "2017"
"title" => "The probabilistic orienteering problem"
"description" => "ANGELELLI, E., ARCHETTI, C., FILIPPI, C. et VINDIGNI, M. (2017). The probabilistic orienteering problem. <i>Computers & Operations Research</i>, 81, pp. 269-281."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Angelelli Enrico"
]
2 => array:1 [
"name" => "Filippi Carlo"
]
3 => array:1 [
"name" => "Vindigni Michele"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Stochastic routing"
1 => "Orienteering problem"
2 => "Probabilistic TSPL-shaped method"
3 => "Matheuristics"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2016.12.025"
"publicationInfo" => array:3 [
"pages" => "269-281"
"volume" => "81"
"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" => "A novel stochastic version of the orienteering problem is considered.The problem generalizes the probabilistic TSP.A deterministic equivalent MILP model is derived.A branch-and-cut procedure with special branching rules is developed.Matheuristic procedures are proved to be efficient and effective. The probabilistic orienteering problem (POP) is defined on a directed graph where a cost is associated with each arc and a prize is associated with each node. Moreover, each node will be available for visit only with a certain probability. A server starts from a fixed origin, has a given budget to visit a subset of nodes, and ends at a fixed destination. In a first stage, a node subset has to be selected and a corresponding a priori path has to be determined such that the server can visit all nodes in the subset and reach the destination without exceeding the budget. The list of available nodes in the subset is then revealed. In a second stage, the server follows the a priori path by skipping the absent nodes. The POP consists in determining a first-stage solution that maximizes the expected profit of the second-stage path, where the expected profit is the difference between the expected total prize and the expected total cost.We discuss the relevance of the problem and formulate it as a linear integer stochastic problem. We develop a branch-and-cut approach for the POP and several matheuristic methods, corresponding to different strategies to reduce the search space of the exact method. Extensive computational tests on instances with up to 100 nodes show the effectiveness of the exact method and the efficiency of the matheuristics in finding high quality solutions in a few minutes. Moreover, we provide an extended analysis on a subset of instances to show the value of explicitly modeling the stochastic information in the problem formulation."
"en" => "A novel stochastic version of the orienteering problem is considered.The problem generalizes the probabilistic TSP.A deterministic equivalent MILP model is derived.A branch-and-cut procedure with special branching rules is developed.Matheuristic procedures are proved to be efficient and effective. The probabilistic orienteering problem (POP) is defined on a directed graph where a cost is associated with each arc and a prize is associated with each node. Moreover, each node will be available for visit only with a certain probability. A server starts from a fixed origin, has a given budget to visit a subset of nodes, and ends at a fixed destination. In a first stage, a node subset has to be selected and a corresponding a priori path has to be determined such that the server can visit all nodes in the subset and reach the destination without exceeding the budget. The list of available nodes in the subset is then revealed. In a second stage, the server follows the a priori path by skipping the absent nodes. The POP consists in determining a first-stage solution that maximizes the expected profit of the second-stage path, where the expected profit is the difference between the expected total prize and the expected total cost.We discuss the relevance of the problem and formulate it as a linear integer stochastic problem. We develop a branch-and-cut approach for the POP and several matheuristic methods, corresponding to different strategies to reduce the search space of the exact method. Extensive computational tests on instances with up to 100 nodes show the effectiveness of the exact method and the efficiency of the matheuristics in finding high quality solutions in a few minutes. Moreover, we provide an extended analysis on a subset of instances to show the value of explicitly modeling the stochastic information in the problem formulation."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
51 => Essec\Faculty\Model\Contribution {#2332
#_index: "academ_contributions"
#_id: "12155"
#_source: array:18 [
"id" => "12155"
"slug" => "the-flexible-periodic-vehicle-routing-problem"
"yearMonth" => "2017-09"
"year" => "2017"
"title" => "The Flexible Periodic Vehicle Routing Problem"
"description" => "ARCHETTI, C., FERNÁNDEZ, E. et HUERTA-MUÑOZ, D.L. (2017). The Flexible Periodic Vehicle Routing Problem. <i>Computers & Operations Research</i>, 85, pp. 58-70."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Fernández Elena"
]
2 => array:1 [
"name" => "Huerta-Muñoz Diana L."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Periodic Vehicle Routing"
1 => "Inventory Routing"
2 => "Service frequency"
3 => "Flexibility"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2017.03.008"
"publicationInfo" => array:3 [
"pages" => "58-70"
"volume" => "85"
"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" => "This paper introduces the Flexible Periodic Vehicle Routing Problem (FPVRP) where a carrier has to establish a distribution plan to serve his customers over a planning horizon. Each customer has a total demand that must be served within the horizon and a limit on the maximum quantity that can be delivered at each visit. A fleet of homogeneous capacitated vehicles is available to perform the services and the objective is to minimize the total routing cost. The FPVRP can be seen as a generalization of the Periodic Vehicle Routing Problem (PVRP) which instead has fixed service frequencies and schedules and where the quantity delivered at each visit is fixed. Moreover, the FPVRP shares some common characteristics with the Inventory Routing Problem (IRP) where inventory levels are considered at each time period and, typically, an inventory cost is involved in the objective function. We present a worst-case analysis which shows the advantages of the FPVRP with respect to both PVRP and IRP. Moreover, we propose a mathematical formulation for the problem, together with some valid inequalities. Computational results show that adding flexibility improves meaningfully the routing costs in comparison with both PVRP and IRP."
"en" => "This paper introduces the Flexible Periodic Vehicle Routing Problem (FPVRP) where a carrier has to establish a distribution plan to serve his customers over a planning horizon. Each customer has a total demand that must be served within the horizon and a limit on the maximum quantity that can be delivered at each visit. A fleet of homogeneous capacitated vehicles is available to perform the services and the objective is to minimize the total routing cost. The FPVRP can be seen as a generalization of the Periodic Vehicle Routing Problem (PVRP) which instead has fixed service frequencies and schedules and where the quantity delivered at each visit is fixed. Moreover, the FPVRP shares some common characteristics with the Inventory Routing Problem (IRP) where inventory levels are considered at each time period and, typically, an inventory cost is involved in the objective function. We present a worst-case analysis which shows the advantages of the FPVRP with respect to both PVRP and IRP. Moreover, we propose a mathematical formulation for the problem, together with some valid inequalities. Computational results show that adding flexibility improves meaningfully the routing costs in comparison with both PVRP and IRP."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
52 => Essec\Faculty\Model\Contribution {#2333
#_index: "academ_contributions"
#_id: "12156"
#_source: array:18 [
"id" => "12156"
"slug" => "the-undirected-capacitated-general-routing-problem-with-profits"
"yearMonth" => "2017-03"
"year" => "2017"
"title" => "The Undirected Capacitated General Routing Problem with Profits"
"description" => "ARCHETTI, C., BERTAZZI, L., LAGANÀ, D. et VOCATURO, F. (2017). The Undirected Capacitated General Routing Problem with Profits. <i>European Journal of Operational Research</i>, 257(3), pp. 822-833."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bertazzi Luca"
]
2 => array:1 [
"name" => "Laganà Demetrio"
]
3 => array:1 [
"name" => "Vocaturo Francesca"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "General routing"
1 => "Profits"
2 => "Aggregate formulation"
3 => "Branch-and-cut"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2016.08.001"
"publicationInfo" => array:3 [
"pages" => "822-833"
"volume" => "257"
"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" => "In this paper we introduce and study the Undirected Capacitated General Routing Problem with Profits (UCGRPP). This problem is defined on an undirected graph where a subset of vertices and edges correspond to customers, which are associated with a given profit and demand. The profit of each customer can be collected at most once. A fleet of homogeneous capacitated vehicles is given to serve the customers. The objective is to find the vehicle routes that maximize the difference between the total collected profit and the traveling cost in such a way that the demand collected by each vehicle does not exceed the capacity and the total duration of each route is not greater than a maximum given time limit. We propose a mathematical formulation of the problem and introduce valid inequalities to strengthen the corresponding continuous relaxation. Moreover, we provide an aggregate formulation that allows us to introduce further inequalities. Then, we propose a two–phase exact algorithm for the solution of the UCGRPP. In the first phase, a branch-and-cut algorithm is used to solve the aggregate formulation and to identify a cut pool of aggregate valid inequalities to be used in the second phase, where a branch-and-cut algorithm is implemented to optimally solve the UCGRPP. Computational results on a large set of problem instances show that the use of the aggregate formulation is effective, making the two-phase exact algorithm able to optimally solve a large number of instances."
"en" => "In this paper we introduce and study the Undirected Capacitated General Routing Problem with Profits (UCGRPP). This problem is defined on an undirected graph where a subset of vertices and edges correspond to customers, which are associated with a given profit and demand. The profit of each customer can be collected at most once. A fleet of homogeneous capacitated vehicles is given to serve the customers. The objective is to find the vehicle routes that maximize the difference between the total collected profit and the traveling cost in such a way that the demand collected by each vehicle does not exceed the capacity and the total duration of each route is not greater than a maximum given time limit. We propose a mathematical formulation of the problem and introduce valid inequalities to strengthen the corresponding continuous relaxation. Moreover, we provide an aggregate formulation that allows us to introduce further inequalities. Then, we propose a two–phase exact algorithm for the solution of the UCGRPP. In the first phase, a branch-and-cut algorithm is used to solve the aggregate formulation and to identify a cut pool of aggregate valid inequalities to be used in the second phase, where a branch-and-cut algorithm is implemented to optimally solve the UCGRPP. Computational results on a large set of problem instances show that the use of the aggregate formulation is effective, making the two-phase exact algorithm able to optimally solve a large number of instances."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
53 => Essec\Faculty\Model\Contribution {#2334
#_index: "academ_contributions"
#_id: "12157"
#_source: array:18 [
"id" => "12157"
"slug" => "multicommodity-vs-single-commodity-routing"
"yearMonth" => "2016-05"
"year" => "2016"
"title" => "Multicommodity vs. Single-Commodity Routing"
"description" => "ARCHETTI, C., CAMPBELL, A.M. et SPERANZA, M.G. (2016). Multicommodity vs. Single-Commodity Routing. <i>Transportation Science</i>, 50(2), pp. 461-472."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Campbell Ann Melissa"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://doi.org/10.1287/trsc.2014.0528"
"publicationInfo" => array:3 [
"pages" => "461-472"
"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" => "In this paper we study a vehicle routing problem where customers request multiple commodities. We study the impact on transportation cost from using vehicles dedicated to a single commodity compared with using flexible vehicles capable of carrying any set of commodities. With vehicles that carry multiple commodities, we consider when the delivery to a customer can be made by more than one vehicle. If multiple vehicles can be used, we examine when deliveries of individual commodities may be split and when they may not be split. The latter problem has not previously been studied, and we present a mathematical programming model for it. We use worst case and computational analysis to compare these different models."
"en" => "In this paper we study a vehicle routing problem where customers request multiple commodities. We study the impact on transportation cost from using vehicles dedicated to a single commodity compared with using flexible vehicles capable of carrying any set of commodities. With vehicles that carry multiple commodities, we consider when the delivery to a customer can be made by more than one vehicle. If multiple vehicles can be used, we examine when deliveries of individual commodities may be split and when they may not be split. The latter problem has not previously been studied, and we present a mathematical programming model for it. We use worst case and computational analysis to compare these different models."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
54 => Essec\Faculty\Model\Contribution {#2335
#_index: "academ_contributions"
#_id: "12158"
#_source: array:18 [
"id" => "12158"
"slug" => "a-branch-and-price-algorithm-for-the-robust-graph-coloring-problem"
"yearMonth" => "2014-03"
"year" => "2014"
"title" => "A branch-and-price algorithm for the robust graph coloring problem"
"description" => "ARCHETTI, C., BIANCHESSI, N. et HERTZ, A. (2014). A branch-and-price algorithm for the robust graph coloring problem. <i>Discrete Applied Mathematics</i>, 165, pp. 49-59."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchessi Nicola"
]
2 => array:1 [
"name" => "Hertz Alain"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Graph coloring"
1 => "Robust solution"
2 => "Branch-and-price algorithm"
3 => "Tabu search"
]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://doi.org/10.1016/j.dam.2013.02.013"
"publicationInfo" => array:3 [
"pages" => "49-59"
"volume" => "165"
"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" => "Given a graph , an integer , and a cost associated with all pairs of non-adjacent vertices in , the robust graph coloring problem is to assign a color in to every vertex of so that no edge has both endpoints with the same color, and the total cost of the pairs of vertices having the same color is minimum. We propose a branch-and-price algorithm for the solution of this problem. The pricing problem consists in finding a stable set of minimum total weight, and we propose both an exact and a heuristic algorithm for its solution. Computational experiments are reported for randomly generated and benchmark graph coloring instances."
"en" => "Given a graph , an integer , and a cost associated with all pairs of non-adjacent vertices in , the robust graph coloring problem is to assign a color in to every vertex of so that no edge has both endpoints with the same color, and the total cost of the pairs of vertices having the same color is minimum. We propose a branch-and-price algorithm for the solution of this problem. The pricing problem consists in finding a stable set of minimum total weight, and we propose both an exact and a heuristic algorithm for its solution. Computational experiments are reported for randomly generated and benchmark graph coloring instances."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
55 => Essec\Faculty\Model\Contribution {#2336
#_index: "academ_contributions"
#_id: "12159"
#_source: array:18 [
"id" => "12159"
"slug" => "incomplete-service-and-split-deliveries-in-a-routing-problem-with-profits"
"yearMonth" => "2014-03"
"year" => "2014"
"title" => "Incomplete service and split deliveries in a routing problem with profits"
"description" => "ARCHETTI, C., BIANCHESSI, N., SPERANZA, M.G. et HERTZ, A. (2014). Incomplete service and split deliveries in a routing problem with profits. <i>Networks</i>, 63(2), pp. 135-145."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchessi Nicola"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
3 => array:1 [
"name" => "Hertz Alain"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "routing problems with profits"
1 => "worst‐case analysis"
2 => "branch‐and‐price algorithm -tabu search"
3 => "split delivery"
]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://doi.org/10.1002/net.21529"
"publicationInfo" => array:3 [
"pages" => "135-145"
"volume" => "63"
"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" => "In this article, we study a variant of the capacitated team orienteering problem, that is the problem where a fleet of vehicles, each with a constraint on the time available, is given to serve profitable customers with the objective of maximizing the collected profit. We study the variant where customers may be only partially served (incomplete service) and, if beneficial, also by more than one vehicle (split deliveries). We will analyze the maximum theoretical increase of the profit due to the incomplete service and to the split deliveries. We also computationally measure such increase on a set of instances, by means of an exact algorithm on small/medium size instances and of two heuristics on instances of larger size. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(2), 135–145 2014"
"en" => "In this article, we study a variant of the capacitated team orienteering problem, that is the problem where a fleet of vehicles, each with a constraint on the time available, is given to serve profitable customers with the objective of maximizing the collected profit. We study the variant where customers may be only partially served (incomplete service) and, if beneficial, also by more than one vehicle (split deliveries). We will analyze the maximum theoretical increase of the profit due to the incomplete service and to the split deliveries. We also computationally measure such increase on a set of instances, by means of an exact algorithm on small/medium size instances and of two heuristics on instances of larger size. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(2), 135–145 2014"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
56 => Essec\Faculty\Model\Contribution {#2337
#_index: "academ_contributions"
#_id: "12160"
#_source: array:18 [
"id" => "12160"
"slug" => "the-directed-profitable-location-rural-postman-problem"
"yearMonth" => "2014-08"
"year" => "2014"
"title" => "The directed profitable location Rural Postman Problem"
"description" => "ARBIB, C., SERVILIO, M., ARCHETTI, C. et SPERANZA, M.G. (2014). The directed profitable location Rural Postman Problem. <i>European Journal of Operational Research</i>, 236(3), pp. 811-819."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Arbib Claudio"
]
2 => array:1 [
"name" => "Servilio Mara"
]
3 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Freight transportation"
1 => "Rural Postman Problem"
2 => "Facility location"
3 => "Arc routing with profits"
4 => "Integer programming"
]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0377221713005997"
"publicationInfo" => array:3 [
"pages" => "811-819"
"volume" => "236"
"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" => "In this paper we introduce an extension of the well known Rural Postman Problem, which combines arc routing with profits and facility location. Profitable arcs must be selected, facilities located at both end-points of the selected arcs, and a tour identified so as to maximize the difference between the profit collected along the arcs and the cost of traversing the arcs and installing the facilities. We analyze properties of the problem, present a mathematical programming formulation and a branch-and-cut algorithm. In an extensive computational experience the algorithm could solve instances with up to 140 vertices and 190 arcs and up to 50 vertices and 203 arcs."
"en" => "In this paper we introduce an extension of the well known Rural Postman Problem, which combines arc routing with profits and facility location. Profitable arcs must be selected, facilities located at both end-points of the selected arcs, and a tour identified so as to maximize the difference between the profit collected along the arcs and the cost of traversing the arcs and installing the facilities. We analyze properties of the problem, present a mathematical programming formulation and a branch-and-cut algorithm. In an extensive computational experience the algorithm could solve instances with up to 140 vertices and 190 arcs and up to 50 vertices and 203 arcs."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
57 => Essec\Faculty\Model\Contribution {#2338
#_index: "academ_contributions"
#_id: "12161"
#_source: array:18 [
"id" => "12161"
"slug" => "polynomial-cases-of-the-economic-lot-sizing-problem-with-cost-discounts"
"yearMonth" => "2014-09"
"year" => "2014"
"title" => "Polynomial cases of the economic lot sizing problem with cost discounts"
"description" => "ARCHETTI, C., BERTAZZI, L. et SPERANZA, M.G. (2014). Polynomial cases of the economic lot sizing problem with cost discounts. <i>European Journal of Operational Research</i>, 237(2), pp. 519-527."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bertazzi Luca"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Economic lot sizing problem with cost discounts"
1 => "Piecewise linear -Modified all-unit discount"
2 => "Incremental discount"
3 => "Polynomial time algorithms"
]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://ideas.repec.org/a/eee/ejores/v237y2014i2p519-527.html"
"publicationInfo" => array:3 [
"pages" => "519-527"
"volume" => "237"
"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" => "In this paper we study the economic lot sizing problem with cost discounts. In the economic lot sizing problem a facility faces known demands over a discrete finite horizon. At each period, the ordering cost function and the holding cost function are given and they can be different from period to period. There are no constraints on the quantity ordered in each period and backlogging is not allowed. The objective is to decide when and how much to order so as to minimize the total ordering and holding costs over the finite horizon without any shortages. We study two different cost discount functions. The modified all-unit discount cost function alternates increasing and flat sections, starting with a flat section that indicates a minimum charge for small quantities. While in general the economic lot sizing problem with modified all-unit discount cost function is known to be NP-hard, we assume that the cost functions do not vary from period to period and identify a polynomial case. Then we study the incremental discount cost function which is an increasing piecewise linear function with no flat sections. The efficiency of the solution algorithms follows from properties of the optimal solution. We computationally test the polynomial algorithms against the use of CPLEX."
"en" => "In this paper we study the economic lot sizing problem with cost discounts. In the economic lot sizing problem a facility faces known demands over a discrete finite horizon. At each period, the ordering cost function and the holding cost function are given and they can be different from period to period. There are no constraints on the quantity ordered in each period and backlogging is not allowed. The objective is to decide when and how much to order so as to minimize the total ordering and holding costs over the finite horizon without any shortages. We study two different cost discount functions. The modified all-unit discount cost function alternates increasing and flat sections, starting with a flat section that indicates a minimum charge for small quantities. While in general the economic lot sizing problem with modified all-unit discount cost function is known to be NP-hard, we assume that the cost functions do not vary from period to period and identify a polynomial case. Then we study the incremental discount cost function which is an increasing piecewise linear function with no flat sections. The efficiency of the solution algorithms follows from properties of the optimal solution. We computationally test the polynomial algorithms against the use of CPLEX."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
58 => Essec\Faculty\Model\Contribution {#2339
#_index: "academ_contributions"
#_id: "12162"
#_source: array:18 [
"id" => "12162"
"slug" => "the-clustered-orienteering-problem"
"yearMonth" => "2014-10"
"year" => "2014"
"title" => "The Clustered Orienteering Problem"
"description" => "ANGELELLI, E., ARCHETTI, C. et VINDIGNI, M. (2014). The Clustered Orienteering Problem. <i>European Journal of Operational Research</i>, 238(2), pp. 404-414."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Angelelli E."
]
2 => array:1 [
"name" => "Vindigni M."
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "Orienteering Problem"
1 => "Branch-and-cut"
2 => "Tabu search"
]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2014.04.006"
"publicationInfo" => array:3 [
"pages" => "404-414"
"volume" => "238"
"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" => "In this paper we study a generalization of the Orienteering Problem (OP) which we call the Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling Salesman Problem, is a problem where a set of potential customers is given and a profit is associated with the service of each customer. A single vehicle is available to serve the customers. The objective is to find the vehicle route that maximizes the total collected profit in such a way that the duration of the route does not exceed a given threshold. In the COP, customers are grouped in clusters. A profit is associated with each cluster and is gained only if all customers belonging to the cluster are served. We propose two solution approaches for the COP: an exact and a heuristic one. The exact approach is a branch-and-cut while the heuristic approach is a tabu search. Computational results on a set of randomly generated instances are provided to show the efficiency and effectiveness of both approaches."
"en" => "In this paper we study a generalization of the Orienteering Problem (OP) which we call the Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling Salesman Problem, is a problem where a set of potential customers is given and a profit is associated with the service of each customer. A single vehicle is available to serve the customers. The objective is to find the vehicle route that maximizes the total collected profit in such a way that the duration of the route does not exceed a given threshold. In the COP, customers are grouped in clusters. A profit is associated with each cluster and is gained only if all customers belonging to the cluster are served. We propose two solution approaches for the COP: an exact and a heuristic one. The exact approach is a branch-and-cut while the heuristic approach is a tabu search. Computational results on a set of randomly generated instances are provided to show the efficiency and effectiveness of both approaches."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
59 => Essec\Faculty\Model\Contribution {#2340
#_index: "academ_contributions"
#_id: "12163"
#_source: array:18 [
"id" => "12163"
"slug" => "branch-and-cut-algorithms-for-the-split-delivery-vehicle-routing-problem"
"yearMonth" => "2014-11"
"year" => "2014"
"title" => "Branch-and-cut algorithms for the split delivery vehicle routing problem"
"description" => "ARCHETTI, C., BIANCHESSI, N. et SPERANZA, M.G. (2014). Branch-and-cut algorithms for the split delivery vehicle routing problem. <i>European Journal of Operational Research</i>, 238(3), pp. 685-698."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchessi Nicola"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:2 [
0 => "Split Delivery Vehicle Routing Problem"
1 => "Branch-and-cut"
]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2014.04.026"
"publicationInfo" => array:3 [
"pages" => "685-698"
"volume" => "238"
"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" => "In this paper we present two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum. Procedures to obtain feasible solutions to the SDVRP from a feasible solution to the relaxed formulations are presented. Computational results are presented for 4 classes of benchmark instances. The new approach is able to prove the optimality of 17 new instances. In particular, the branch-and-cut algorithm based on the first relaxed formulation is able to solve most of the instances with up to 50 customers and two instances with 75 and 100 customers."
"en" => "In this paper we present two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum. Procedures to obtain feasible solutions to the SDVRP from a feasible solution to the relaxed formulations are presented. Computational results are presented for 4 classes of benchmark instances. The new approach is able to prove the optimality of 17 new instances. In particular, the branch-and-cut algorithm based on the first relaxed formulation is able to solve most of the instances with up to 50 customers and two instances with 75 and 100 customers."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
60 => Essec\Faculty\Model\Contribution {#2341
#_index: "academ_contributions"
#_id: "12164"
#_source: array:18 [
"id" => "12164"
"slug" => "formulations-for-an-inventory-routing-problem"
"yearMonth" => "2014-05"
"year" => "2014"
"title" => "Formulations for an inventory routing problem"
"description" => "ARCHETTI, C., BIANCHESSI, N., IRNICH, S. et SPERANZA, M.G. (2014). Formulations for an inventory routing problem. <i>International Transactions in Operational Research</i>, 21(3), pp. 353-374."
"authors" => array:4 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bianchessi Nicola"
]
2 => array:1 [
"name" => "Irnich Stefan"
]
3 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "routing problems"
1 => "integer programming"
2 => "branch‐and‐cut algorithm"
3 => "supply chain management"
]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://doi.org/10.1111/itor.12076"
"publicationInfo" => array:3 [
"pages" => "353-374"
"volume" => "21"
"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" => "In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle‐indexed variables are superior to the more compact, aggregate formulations."
"en" => "In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle‐indexed variables are superior to the more compact, aggregate formulations."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
61 => Essec\Faculty\Model\Contribution {#2342
#_index: "academ_contributions"
#_id: "12165"
#_source: array:18 [
"id" => "12165"
"slug" => "the-team-orienteering-arc-routing-problem"
"yearMonth" => "2014-08"
"year" => "2014"
"title" => "The Team Orienteering Arc Routing Problem"
"description" => "ARCHETTI, C., SPERANZA, M.G., CORBERÁN, , SANCHIS, J.M. et PLANA, I. (2014). The Team Orienteering Arc Routing Problem. <i>Transportation Science</i>, 48(3), pp. 442-457."
"authors" => array:5 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Speranza Maria Grazia"
]
2 => array:1 [
"name" => "Corberán Ángel"
]
3 => array:1 [
"name" => "Sanchis José M."
]
4 => array:1 [
"name" => "Plana Isaac"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "team orienteering arc routing problem"
1 => "profits"
2 => "multivehicle- facets"
3 => "branch and cut"
]
"updatedAt" => "2021-07-13 14:32:01"
"publicationUrl" => "https://doi.org/10.1287/trsc.2013.0484"
"publicationInfo" => array:3 [
"pages" => "442-457"
"volume" => "48"
"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 team orienteering arc routing problem (TOARP) is the extension to the arc routing setting of the team orienteering problem. In the TOARP, in addition to a possible set of regular customers that have to be serviced, another set of potential customers is available. Each customer is associated with an arc of a directed graph. Each potential customer has a profit that is collected when it is serviced, that is, when the associated arc is traversed. A fleet of vehicles with a given maximum traveling time is available. The profit from a customer can be collected by one vehicle at most. The objective is to identify the customers that maximize the total profit collected while satisfying the given time limit for each vehicle.\n
\n
In this paper we propose a formulation for this problem and study a relaxation of its associated polyhedron. We present some families of valid and facet-inducing inequalities that we use in the implementation of a branch-and-cut algorithm for the resolution of the problem. Computational experiments are run on a large set of benchmark instances.
"""
"en" => """
The team orienteering arc routing problem (TOARP) is the extension to the arc routing setting of the team orienteering problem. In the TOARP, in addition to a possible set of regular customers that have to be serviced, another set of potential customers is available. Each customer is associated with an arc of a directed graph. Each potential customer has a profit that is collected when it is serviced, that is, when the associated arc is traversed. A fleet of vehicles with a given maximum traveling time is available. The profit from a customer can be collected by one vehicle at most. The objective is to identify the customers that maximize the total profit collected while satisfying the given time limit for each vehicle.\n
\n
In this paper we propose a formulation for this problem and study a relaxation of its associated polyhedron. We present some families of valid and facet-inducing inequalities that we use in the implementation of a branch-and-cut algorithm for the resolution of the problem. Computational experiments are run on a large set of benchmark instances.
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
62 => Essec\Faculty\Model\Contribution {#2343
#_index: "academ_contributions"
#_id: "12166"
#_source: array:18 [
"id" => "12166"
"slug" => "a-survey-on-matheuristics-for-routing-problems"
"yearMonth" => "2014-11"
"year" => "2014"
"title" => "A survey on matheuristics for routing problems"
"description" => "ARCHETTI, C. et SPERANZA, M.G. (2014). A survey on matheuristics for routing problems. <i>EURO Journal on Computational Optimization</i>, 2(4), pp. 223-246."
"authors" => array:2 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "Matheuristics -Mixed integer linear programming -Vehicle routing problems- Survey"
]
"updatedAt" => "2021-02-03 11:02:43"
"publicationUrl" => "https://doi.org/10.1007/s13675-014-0030-7"
"publicationInfo" => array:3 [
"pages" => "223-246"
"volume" => "2"
"number" => "4"
]
"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" => "In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of matheuristics: decomposition approaches, improvement heuristics and branch-and-price/column generation-based approaches. The contribution of this paper is to offer to researchers interested in routing problems a structured overview of the most successful ideas to combine heuristic schemes and mathematical programming models to obtain high quality solutions. Moreover, we analyze the state of the art and provide insights and hints for future research."
"en" => "In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of matheuristics: decomposition approaches, improvement heuristics and branch-and-price/column generation-based approaches. The contribution of this paper is to offer to researchers interested in routing problems a structured overview of the most successful ideas to combine heuristic schemes and mathematical programming models to obtain high quality solutions. Moreover, we analyze the state of the art and provide insights and hints for future research."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
63 => Essec\Faculty\Model\Contribution {#2344
#_index: "academ_contributions"
#_id: "12167"
#_source: array:18 [
"id" => "12167"
"slug" => "preface-special-issue-on-the-ninth-international-colloquium-on-graphs-and-optimization-go-ix-2014"
"yearMonth" => "2018-01"
"year" => "2018"
"title" => "Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014"
"description" => "ARCHETTI, C., BERTAZZI, L., MILANIČ, M., SCHINDL, D. et VARONE, S. (2018). Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. <i>Discrete Applied Mathematics</i>, 234, pp. 1-2."
"authors" => array:5 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Bertazzi Luca"
]
2 => array:1 [
"name" => "Milanič Martin"
]
3 => array:1 [
"name" => "Schindl David"
]
4 => array:1 [
"name" => "Varone Sacha"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.dam.2017.11.006"
"publicationInfo" => array:3 [
"pages" => "1-2"
"volume" => "234"
"number" => null
]
"type" => array:2 [
"fr" => "Préfaces/Introductions de revue"
"en" => "Prefaces of a journal"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This special issue gathers a selection of papers presented at GO IX, but was also open to contributions in the fields of research of the plenary speakers. All papers passed a careful refereeing process, which resulted in 19 papers, which can be roughly classified as 9 papers in graph theory, 5 in scheduling, and 5 in optimization. Several papers report results at the interplay of at least two of these three areas. The papers in the special issue report on investigations in a variety of topics."
"en" => "This special issue gathers a selection of papers presented at GO IX, but was also open to contributions in the fields of research of the plenary speakers. All papers passed a careful refereeing process, which resulted in 19 papers, which can be roughly classified as 9 papers in graph theory, 5 in scheduling, and 5 in optimization. Several papers report results at the interplay of at least two of these three areas. The papers in the special issue report on investigations in a variety of topics."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2023-12-02T04:22:10.000Z"
]
+lang: "en"
+"_type": "_doc"
+"_score": 4.6315904
+"parent": null
}
64 => Essec\Faculty\Model\Contribution {#2345
#_index: "academ_contributions"
#_id: "12168"
#_source: array:18 [
"id" => "12168"
"slug" => "special-issue-on-matheuristics"
"yearMonth" => "2014-11"
"year" => "2014"
"title" => "Special issue on: “matheuristics”"
"description" => "ARCHETTI, C., PISINGER, D. et SPERANZA, M.G. (2014). Special issue on: “matheuristics”. <i>EURO Journal on Computational Optimization</i>, 2(4), pp. 221-222."
"authors" => array:3 [
0 => array:3 [
"name" => "ARCHETTI Claudia"
"bid" => "B00773540"
"slug" => "archetti-claudia"
]
1 => array:1 [
"name" => "Pisinger David"
]
2 => array:1 [
"name" => "Speranza Maria Grazia"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => " 
