Gilbert Laporte

ORCID

Publication Activity (10 Years)

Years Active: 1984-2023
Publications (10 Years): 126

Top Venues

London School of Economics, UK (PHD)

Education History

London School of Economics, UK

PHD

Publications

Homayoun Shaabani, Arild Hoff, Lars Magnus Hvattum, Gilbert Laporte
A matheuristic for the multi-product maritime inventory routing problem. Comput. Oper. Res. 154 (2023)
Lu Zhen, Jiajing Gao, Zheyi Tan, Gilbert Laporte, Roberto Baldacci
Territorial design for customers with demand frequency. Eur. J. Oper. Res. 309 (1) (2023)
Maryam Haghi, Okan Arslan, Gilbert Laporte
A location-or-routing problem with partial and decaying coverage. Comput. Oper. Res. 149 (2023)
Çelen Naz Ötken, Baris Yildiz, Okan Arslan, Gilbert Laporte
Making opportunity sales in attended home delivery. Comput. Oper. Res. 160 (2023)
Lu Zhen, Jingwen Wu, Gilbert Laporte, Zheyi Tan
Heterogeneous instant delivery orders scheduling and routing problem. Comput. Oper. Res. 157 (2023)
Sanne Wøhlk, Gilbert Laporte
Transport of skips between recycling centers and treatment facilities. Comput. Oper. Res. 145 (2022)
Luigi Moccia, Duncan W. Allen, Gilbert Laporte, Andrea Spinosa
Mode boundaries of automated metro and semi-rapid rail in urban transit. Public Transp. 14 (3) (2022)
Maximilian Schiffer, Nils Boysen, Patrick S. Klein, Gilbert Laporte, Marco Pavone
Optimal Picking Policies in E-Commerce Warehouses. Manag. Sci. 68 (10) (2022)
Gilbert Laporte, Paolo Toth
A gap in scientific reporting. 4OR 20 (1) (2022)
David Canca, Gilbert Laporte
Solving real-size stochastic railway rapid transit network construction scheduling problems. Comput. Oper. Res. 138 (2022)
M. Hakan Akyüz, Ibrahim Muter, Günes Erdogan, Gilbert Laporte
Minimum cost delivery of multi-item orders in e-commerce logistics. Comput. Oper. Res. 138 (2022)
Aurélien Froger, Ola Jabali, Jorge E. Mendoza, Gilbert Laporte
The Electric Vehicle Routing Problem with Capacitated Charging Stations. Transp. Sci. 56 (2) (2022)
Oliver Thomasson, Maria Battarra, Günes Erdogan, Gilbert Laporte
Pallet location and job scheduling in a Twin-Robot system. Comput. Oper. Res. 147 (2022)
Liyang Xiao, Lu Zhen, Gilbert Laporte, Roberto Baldacci, Chenghao Wang
A column generation-based heuristic for a rehabilitation patient scheduling and routing problem. Comput. Oper. Res. 148 (2022)
Borzou Rostami, Masoud Chitsaz, Okan Arslan, Gilbert Laporte, Andrea Lodi
Single Allocation Hub Location with Heterogeneous Economies of Scale. Oper. Res. 70 (2) (2022)
Gilbert Laporte, Marie-Eve Rancourt, Jessica Rodríguez-Pereira, Selene Silvestri
Optimizing access to drinking water in remote areas. Application to Nepal. Comput. Oper. Res. 140 (2022)
Giuseppe Bruno, Manuel Cavola, Antonio Diglio, Gilbert Laporte, Carmela Piccolo
Reorganizing postal collection operations in urban areas as a result of declining mail volumes - A case study in Bologna. J. Oper. Res. Soc. 72 (7) (2021)
Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut
A scalable dynamic parking allocation framework. Comput. Oper. Res. 125 (2021)
Hao Yu, Xu Sun, Wei Deng Solvang, Gilbert Laporte
Solving a Real-World Urban Postal Service System Redesign Problem. Sci. Program. 2021 (2021)
Yauheni Kisialiou, Irina V. Gribkovskaia, Gilbert Laporte
Periodic supply vessel planning under demand and weather uncertainty. INFOR Inf. Syst. Oper. Res. 59 (3) (2021)
Maximilian Schiffer, Patrick S. Klein, Gilbert Laporte, Grit Walther
Integrated planning for electric commercial vehicle fleets: A case study for retail mid-haul logistics networks. Eur. J. Oper. Res. 291 (3) (2021)
Gilbert Laporte
Some contributions of Ailsa H. Land to the study of the traveling salesman problem. EURO J. Comput. Optim. 9 (2021)
Merve Keskin, Bülent Çatay, Gilbert Laporte
A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations. Comput. Oper. Res. 125 (2021)
Demetrio Laganà, Gilbert Laporte, Francesca Vocaturo
A dynamic multi-period general routing problem arising in postal service and parcel delivery systems. Comput. Oper. Res. 129 (2021)
Maria Battarra, Federico Fraboni, Oliver Thomasson, Günes Erdogan, Gilbert Laporte, Marco Formentini
Algorithms for the Calzedonia workload allocation problem. J. Oper. Res. Soc. 72 (9) (2021)
Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte
Inbound and outbound flow integration for cross-docking operations. Eur. J. Oper. Res. 294 (3) (2021)
Bruno Salezza Vieira, Glaydston Mattos Ribeiro, Laura Bahiense, Roberto Edward Cruz, André Bergsten Mendes, Gilbert Laporte
Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions. Eur. J. Oper. Res. 295 (3) (2021)
Çagri Koç, Gilbert Laporte, Ilknur Tükenmez
A review of vehicle routing with simultaneous pickup and delivery. Comput. Oper. Res. 122 (2020)
Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut
The parking allocation problem for connected vehicles. J. Heuristics 26 (3) (2020)
Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte
Crowd-shipping with time windows and transshipment nodes. Comput. Oper. Res. 113 (2020)
Hani Zbib, Gilbert Laporte
The commodity-split multi-compartment capacitated arc routing problem. Comput. Oper. Res. 122 (2020)
Luigi Moccia, Duncan W. Allen, Gilbert Laporte
A spatially disaggregated model for the technology selection and design of a transit line. Public Transp. 12 (3) (2020)
Thibaut Vidal, Gilbert Laporte, Piotr Matl
A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286 (2) (2020)
Okan Arslan, Ola Jabali, Gilbert Laporte
A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints. INFORMS J. Comput. 32 (1) (2020)
Marilène Cherkesly, Mercedes Landete, Gilbert Laporte
Median and covering location problems with interconnected facilities. Comput. Oper. Res. 107 (2019)
S. U. K. Rohmer, G. D. H. Claassen, Gilbert Laporte
A two-echelon inventory routing problem for perishable products. Comput. Oper. Res. 107 (2019)
Giusy Macrina, Gilbert Laporte, Francesca Guerriero, Luigi Di Puglia Pugliese
An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows. Eur. J. Oper. Res. 276 (3) (2019)
Lu Zhen, Shuaian Wang, Gilbert Laporte, Yi Hu
Integrated planning of ship deployment, service schedule and container routing. Comput. Oper. Res. 104 (2019)
Jessica Rodríguez-Pereira, Elena Fernández, Gilbert Laporte, Enrique Benavent, Antonio Martinez-Sykora
The Steiner Traveling Salesman Problem and its extensions. Eur. J. Oper. Res. 278 (2) (2019)
Aurélien Froger, Jorge E. Mendoza, Ola Jabali, Gilbert Laporte
Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions. Comput. Oper. Res. 104 (2019)
Slim Belhaiza, Rym M'Hallah, Ghassen Ben Brahim, Gilbert Laporte
Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows. J. Heuristics 25 (3) (2019)
Çagri Koç, Ola Jabali, Jorge E. Mendoza, Gilbert Laporte
The electric vehicle routing problem with shared charging stations. Int. Trans. Oper. Res. 26 (4) (2019)
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte
An Exact Algorithm for Multilevel Uncapacitated Facility Location. Transp. Sci. 53 (4) (2019)
Leandro C. Coelho, Gilbert Laporte, Arinei Lindbeck, Thibaut Vidal
Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle. CoRR (2019)
Thibaut Vidal, Gilbert Laporte, Piotr Matl
A concise guide to existing and emerging vehicle routing problem variants. CoRR (2019)
Merve Keskin, Gilbert Laporte, Bülent Çatay
Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations. Comput. Oper. Res. 107 (2019)
Sanne Wøhlk, Gilbert Laporte
A districting-based heuristic for the coordinated capacitated arc routing problem. Comput. Oper. Res. 111 (2019)
Lu Zhen, Miao Li, Gilbert Laporte, Wencheng Wang
A vehicle routing problem arising in unmanned aerial monitoring. Comput. Oper. Res. 105 (2019)
Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte
Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer. Comput. Oper. Res. 112 (2019)
Maximilian Schiffer, Michael Schneider, Grit Walther, Gilbert Laporte
Vehicle Routing and Location Routing with Intermediate Stops: A Review. Transp. Sci. 53 (2) (2019)
David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa
The railway rapid transit network construction scheduling problem. Comput. Ind. Eng. 138 (2019)
Elena Fernández, Gilbert Laporte, Jessica Rodríguez-Pereira
Exact Solution of Several Families of Location-Arc Routing Problems. Transp. Sci. 53 (5) (2019)
Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte
The green mixed fleet vehicle routing problem with partial battery recharging and time windows. Comput. Oper. Res. 101 (2019)
Kai Wang, Lu Zhen, Shuaian Wang, Gilbert Laporte
Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem. Transp. Sci. 52 (4) (2018)
Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov
Corridor-based metro network design with travel flow capture. Comput. Oper. Res. 89 (2018)
Çagri Koç, Ola Jabali, Gilbert Laporte
Long-haul vehicle routing and scheduling with idling options. J. Oper. Res. Soc. 69 (2) (2018)
Ángel Corberán, Günes Erdogan, Gilbert Laporte, Isaac Plana, José M. Sanchis
The Chinese Postman Problem with Load-Dependent Costs. Transp. Sci. 52 (2) (2018)
Oliver Thomasson, Maria Battarra, Günes Erdogan, Gilbert Laporte
Scheduling twin robots in a palletising problem. Int. J. Prod. Res. 56 (1-2) (2018)
Teobaldo L. Bulhões Júnior, Anand Subramanian, Günes Erdogan, Gilbert Laporte
The static bike relocation problem with multiple vehicles and visits. Eur. J. Oper. Res. 264 (2) (2018)
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte
Multi-level facility location problems. Eur. J. Oper. Res. 267 (3) (2018)
Yauheni Kisialiou, Irina Gribkovskaia Sr., Gilbert Laporte
The periodic supply vessel planning problem with flexible departure times and coupled vessels. Comput. Oper. Res. 94 (2018)
Elena Fernández, Gilbert Laporte, Jessica Rodríguez-Pereira
A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem. Transp. Sci. 52 (2) (2018)
Lei He, Xiaolu Liu, Gilbert Laporte, Yingwu Chen, Yingguo Chen
An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling. Comput. Oper. Res. 100 (2018)
Moncef Ilies Nasri, Tolga Bektas, Gilbert Laporte
Route and speed optimization for autonomous trucks. Comput. Oper. Res. 100 (2018)
Maximilian Schiffer, Michael Schneider, Gilbert Laporte
Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities. Eur. J. Oper. Res. 265 (2) (2018)
Vitor Nesello, Anand Subramanian, Maria Battarra, Gilbert Laporte
Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times. Eur. J. Oper. Res. 266 (2) (2018)
Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
Shared mobility systems: an updated survey. Ann. Oper. Res. 271 (1) (2018)
Çagri Koç, Gilbert Laporte
Vehicle routing with backhauls: Review and research perspectives. Comput. Oper. Res. 91 (2018)
Anna Franceschetti, Dorothée Honhon, Gilbert Laporte, Tom Van Woensel
A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem. Transp. Sci. 52 (4) (2018)
Sanne Wøhlk, Gilbert Laporte
A fast heuristic for large-scale capacitated arc routing problems. J. Oper. Res. Soc. 69 (12) (2018)
Okan Arslan, Ola Jabali, Gilbert Laporte
Exact Solution of the Evasive Flow Capturing Problem. Oper. Res. 66 (6) (2018)
Sanne Wøhlk, Gilbert Laporte
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs. Comput. Oper. Res. 87 (2017)
Selene Silvestri, Gilbert Laporte, Raffaele Cerulli
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. Comput. Oper. Res. 81 (2017)
Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte
Planning a selective delivery schedule through Adaptive Large Neighborhood Search. Comput. Ind. Eng. 112 (2017)
David A. Flores-Garza, M. Angélica Salazar-Aguilar, Sandra Ulrich Ngueveu, Gilbert Laporte
The multi-vehicle cumulative covering tour problem. Ann. Oper. Res. 258 (2) (2017)
Anna Franceschetti, Emrah Demir, Dorothée Honhon, Tom Van Woensel, Gilbert Laporte, Mark Stobbe
A metaheuristic for the time-dependent pollution-routing problem. Eur. J. Oper. Res. 259 (3) (2017)
Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte
The pickup and delivery problem with time windows and handling operations. Comput. Oper. Res. 77 (2017)
Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile. Comput. Oper. Res. 78 (2017)
Yousef Maknoon, Gilbert Laporte
Vehicle routing with cross-dock selection. Comput. Oper. Res. 77 (2017)
Dimitris C. Paraskevopoulos, Gilbert Laporte, Panagiotis P. Repoussis, Christos D. Tarantilis
Resource constrained routing and scheduling: Review and research prospects. Eur. J. Oper. Res. 263 (3) (2017)
Eirik Fernández Cuesta, Henrik Andersson, Kjetil Fagerholt, Gilbert Laporte
Vessel routing with pickups and deliveries: An application to the supply of offshore oil platforms. Comput. Oper. Res. 79 (2017)
Andreza Cristina Beezão, Jean-François Cordeau, Gilbert Laporte, Horacio Hideki Yanasse
Scheduling identical parallel machines with tooling constraints. Eur. J. Oper. Res. 257 (3) (2017)
Xiaolu Liu, Gilbert Laporte, Yingwu Chen, Renjie He
An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time. Comput. Oper. Res. 86 (2017)
Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte, André Langevin
A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints. Comput. Oper. Res. 78 (2017)
Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea
The railway line frequency and size setting problem. Public Transp. 9 (1-2) (2017)
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte
Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location. INFORMS J. Comput. 29 (4) (2017)
David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem. Comput. Oper. Res. 78 (2017)
Leandro C. Coelho, Jacques Renaud, Gilbert Laporte
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015. INFOR Inf. Syst. Oper. Res. 54 (2) (2016)
David Canca, Eva Barrena, Gilbert Laporte, Francisco A. Ortega
A short-turning policy for the management of demand disruptions in rapid transit systems. Ann. Oper. Res. 246 (1-2) (2016)
Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250 (3) (2016)
Oguz Solyali, Jean-François Cordeau, Gilbert Laporte
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty. Manag. Sci. 62 (4) (2016)
François V. Louveaux, Yasemin Arda, Yves Crama, Gilbert Laporte
Large neighborhood search for multi-trip vehicle routing. Eur. J. Oper. Res. 255 (2) (2016)
Günes Erdogan, Gilbert Laporte, Antonio M. Rodríguez-Chía
Exact and heuristic algorithms for the Hamiltonian p-median problem. Eur. J. Oper. Res. 253 (2) (2016)
Alper Ekrem Murat, Gilbert Laporte, Vedat Verter
A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand. Comput. Oper. Res. 71 (2016)
Karine Sinclair, Jean-François Cordeau, Gilbert Laporte
A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem. Comput. Oper. Res. 65 (2016)
Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte
Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249 (1) (2016)
Glaydston Mattos Ribeiro, Geraldo Regis Mauri, Saulo de Castro Beluco, Luiz Antonio Nogueira Lorena, Gilbert Laporte
Berth allocation in an ore terminal with demurrage, despatch and maintenance. Comput. Ind. Eng. 96 (2016)
Roel G. van Anholt, Leandro C. Coelho, Gilbert Laporte, Iris F. A. Vis
An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines. Transp. Sci. 50 (3) (2016)
Hongtao Lei, Rui Wang, Gilbert Laporte
Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm. Comput. Oper. Res. 67 (2016)
Raúl M. Falcón, Eva Barrena, David Canca, Gilbert Laporte
Counting and enumerating feasible rotating schedules by means of Gröbner bases. Math. Comput. Simul. 125 (2016)

Gilbert Laporte.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gilbert Laporte