Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacques Renaud
Person information
- affiliation: Interuniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT), Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j44]Eliseu Junio Araújo, Maryam Darvish
, Jacques Renaud:
The road train optimization problem with load assignment. Comput. Oper. Res. 153: 106184 (2023)- [j43]Guilherme Oliveira Chagas, Leandro C. Coelho, Maryam Darvish, Jacques Renaud:
Modeling and solving the waste valorization production and distribution scheduling problem. Eur. J. Oper. Res. 306(1): 400-417 (2023) - [j42]Hamza Heni, S. Arona Diop, Jacques Renaud, Leandro C. Coelho:
Measuring fuel consumption in vehicle routing: new estimation models using supervised learning. Int. J. Prod. Res. 61(1): 114-130 (2023) - [j41]Rabie Jaballah, Rodrigo Ramalho, Jacques Renaud, Leandro C. Coelho:
The impact of time aggregation and travel time models on time-dependent routing solutions. INFOR Inf. Syst. Oper. Res. 61(4): 490-508 (2023) - 2022
- [j40]Allyson Silva, Leandro C. Coelho, Maryam Darvish, Jacques Renaud:
A cutting plane method and a parallel algorithm for packing rectangles in a circular container. Eur. J. Oper. Res. 303(1): 114-128 (2022) - 2021
- [j39]Rabie Jaballah, Marjolein Veenstra, Leandro C. Coelho, Jacques Renaud:
The time-dependent shortest path and vehicle routing problem. INFOR Inf. Syst. Oper. Res. 59(4): 592-622 (2021) - [j38]Ana María Anaya-Arenas, Caroline Prodhon, Jacques Renaud, Angel B. Ruiz:
An iterated local search for the biomedical sample transportation problem with multiple and interdependent pickups. J. Oper. Res. Soc. 72(2): 367-382 (2021) - 2019
- [j37]Hamza Heni, Leandro C. Coelho, Jacques Renaud:
Determining time-dependent minimum cost paths under several objectives. Comput. Oper. Res. 105: 102-117 (2019) - [j36]Khaled Belhassine, Jacques Renaud, Leandro C. Coelho, Jean Philippe Gagliardi:
Analyse spatiotemporelle des tournées de livraison d'une entreprise de livraison à domicile. Rev. Int. Géomatique 29(2): 207- (2019) - 2018
- [j35]Reza Atefi, Majid Salari, Leandro C. Coelho, Jacques Renaud:
The open vehicle routing problem with decoupling points. Eur. J. Oper. Res. 265(1): 316-327 (2018) - [j34]Kátia Y. Nakamura, Leandro C. Coelho, Jacques Renaud, Mariá C. V. Nascimento:
The Traveling Backpacker Problem: A computational comparison of two formulations. J. Oper. Res. Soc. 69(1): 108-114 (2018) - [j33]Thomas Chabot, Leandro C. Coelho, Jacques Renaud, Jean-François Côté:
Mathematical model, heuristics and exact method for order picking in narrow aisles. J. Oper. Res. Soc. 69(8): 1242-1253 (2018) - [j32]Rahma Lahyani, Leandro C. Coelho, Jacques Renaud:
Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem. OR Spectr. 40(1): 125-157 (2018) - 2017
- [j31]Thomas Chabot, Rahma Lahyani, Leandro C. Coelho, Jacques Renaud:
Order picking problems under weight, fragility and category constraints. Int. J. Prod. Res. 55(21): 6361-6379 (2017) - 2016
- [j30]Zahra Naji Azimi, Majid Salari, Jacques Renaud, Angel B. Ruiz:
A practical vehicle routing problem with desynchronized arrivals to depot. Eur. J. Oper. Res. 255(1): 58-67 (2016) - [j29]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): 79-96 (2016) - [j28]Leandro C. Coelho, Jean Philippe Gagliardi, Jacques Renaud, Angel B. Ruiz:
Solving the vehicle routing problem with lunch break arising in the furniture delivery industry. J. Oper. Res. Soc. 67(5): 743-751 (2016) - 2014
- [j27]Ana María Anaya-Arenas, Jacques Renaud, Angel B. Ruiz:
Relief distribution networks: a systematic review. Ann. Oper. Res. 223(1): 53-79 (2014) - [j26]Rachida Abounacer, Monia Rekik, Jacques Renaud:
An exact solution approach for multi-objective location-transportation problem for disaster response. Comput. Oper. Res. 41: 83-93 (2014) - [j25]Olivier Pignac-Robitaille, Sébastien Simard, Angel B. Ruiz, Jacques Renaud:
Planification des tournées dans le domaine de la messagerie rapide. INFOR Inf. Syst. Oper. Res. 52(1): 20-27 (2014) - [j24]Jean Philippe Gagliardi, Jacques Renaud, Angel B. Ruiz:
A simulation modeling framework for multiple-aisle automated storage and retrieval systems. J. Intell. Manuf. 25(1): 193-207 (2014) - 2012
- [j23]Fabien Cornillier, Fayez F. Boctor, Jacques Renaud:
Heuristics for the multi-depot petrol station replenishment problem with time windows. Eur. J. Oper. Res. 220(2): 361-369 (2012) - [j22]Zahra Naji Azimi, Jacques Renaud, Angel B. Ruiz, Majid Salari:
A covering tour approach to the location of satellite distribution centers to supply humanitarian aid. Eur. J. Oper. Res. 222(3): 596-605 (2012) - 2011
- [j21]N. Anken, Jean Philippe Gagliardi, Jacques Renaud, Angel B. Ruiz:
Space allocation and aisle positioning for an industrial pick-to-belt system. J. Oper. Res. Soc. 62(1): 38-49 (2011) - 2010
- [j20]Marie-Claude Bolduc, Gilbert Laporte, Jacques Renaud, Fayez F. Boctor:
A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars. Eur. J. Oper. Res. 202(1): 122-130 (2010) - 2009
- [j19]Fabien Cornillier, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud:
The petrol station replenishment problem with time windows. Comput. Oper. Res. 36(3): 919-935 (2009) - [j18]Fayez F. Boctor, Jacques Renaud, Angel B. Ruiz, Simon Tremblay:
Optimal and heuristic solution methods for a multiprocessor machine scheduling problem. Comput. Oper. Res. 36(10): 2822-2828 (2009) - 2008
- [j17]Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
A heuristic for the multi-period petrol station replenishment problem. Eur. J. Oper. Res. 191(2): 295-305 (2008) - [j16]Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
An exact algorithm for the petrol station replenishment problem. J. Oper. Res. Soc. 59(5): 607-615 (2008) - [j15]Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J. Oper. Res. Soc. 59(6): 776-787 (2008) - [j14]Jacques Renaud, Angel B. Ruiz:
Improving product location and order picking activities in a distribution centre. J. Oper. Res. Soc. 59(12): 1603-1613 (2008) - 2007
- [j13]Marc-André Carle, Jacques Renaud, Angel B. Ruiz:
Fast and efficient methods for industrial floor assembly. Comput. Oper. Res. 34(4): 1051-1060 (2007) - [j12]Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor:
A heuristic for the routing and carrier selection problem. Eur. J. Oper. Res. 183(2): 926-932 (2007) - 2006
- [j11]Marie-Claude Bolduc, Jacques Renaud, Benoît Montreuil:
Synchronized routing of seasonal products through a production/distribution network. Central Eur. J. Oper. Res. 14(2): 209-228 (2006) - [j10]J. Privé, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Solving a vehicle-routing problem arising in soft-drink distribution. J. Oper. Res. Soc. 57(9): 1045-1052 (2006) - 2004
- [j9]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Efficient heuristics for Median Cycle Problems. J. Oper. Res. Soc. 55(2): 179-186 (2004) - 2003
- [j8]Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
Heuristics for the traveling purchaser problem. Comput. Oper. Res. 30(4): 491-504 (2003) - 2002
- [j7]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Perturbation heuristics for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 29(9): 1129-1141 (2002) - [j6]Jacques Renaud, Fayez F. Boctor:
A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 140(3): 618-628 (2002) - 2000
- [j5]Fayez F. Boctor, Jacques Renaud:
The column-circular, subsets-selection problem: complexity and solutions. Comput. Oper. Res. 27(4): 383-398 (2000) - [j4]Jacques Renaud, Fayez F. Boctor, Jamal Ouenniche:
A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 27(9): 905-916 (2000) - 1998
- [j3]Jacques Renaud, Fayez F. Boctor:
An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur. J. Oper. Res. 108(3): 571-584 (1998) - 1996
- [j2]Jacques Renaud, Gilbert Laporte, Fayez F. Boctor:
A tabu search heuristic for the multi-depot vehicle routing problem. Comput. Oper. Res. 23(3): 229-235 (1996) - [j1]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem. INFORMS J. Comput. 8(2): 134-143 (1996)
Conference and Workshop Papers
- 2022
- [c2]Khaled Belhassine, Jacques Renaud, Leandro C. Coelho, Vincent Turgeon:
Signal priority for improving fluidity and decreasing fuel consumption. SUMO 2022: 159-169 - 2007
- [c1]Jean Philippe Gagliardi, Jacques Renaud, Angel B. Ruiz:
A simulation model to improve warehouse operations. WSC 2007: 2012-2018
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-17 02:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
