Jacques Renaud

Orcid: 0000-0003-3876-5378

Affiliations:
  • Interuniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT), Canada


According to our database1, Jacques Renaud authored at least 48 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Manual and robotic storage and picking systems: a literature review.
INFOR Inf. Syst. Oper. Res., August, 2024

A parallel variable neighborhood search for α-neighbor facility location problems.
Comput. Oper. Res., 2024

2023
The impact of time aggregation and travel time models on time-dependent routing solutions.
INFOR Inf. Syst. Oper. Res., November, 2023

The road train optimization problem with load assignment.
Comput. Oper. Res., May, 2023

Measuring fuel consumption in vehicle routing: new estimation models using supervised learning.
Int. J. Prod. Res., 2023

Modeling and solving the waste valorization production and distribution scheduling problem.
Eur. J. Oper. Res., 2023

2022
A cutting plane method and a parallel algorithm for packing rectangles in a circular container.
Eur. J. Oper. Res., 2022

Signal priority for improving fluidity and decreasing fuel consumption.
Proceedings of the SUMO User Conference 2022, Virtual Event, May 9-11, 2022, 2022

2021
An iterated local search for the biomedical sample transportation problem with multiple and interdependent pickups.
J. Oper. Res. Soc., 2021

The time-dependent shortest path and vehicle routing problem.
INFOR Inf. Syst. Oper. Res., 2021

2019
Analyse spatiotemporelle des tournées de livraison d'une entreprise de livraison à domicile.
Rev. Int. Géomatique, 2019

Determining time-dependent minimum cost paths under several objectives.
Comput. Oper. Res., 2019

2018
Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem.
OR Spectr., 2018

The Traveling Backpacker Problem: A computational comparison of two formulations.
J. Oper. Res. Soc., 2018

Mathematical model, heuristics and exact method for order picking in narrow aisles.
J. Oper. Res. Soc., 2018

The open vehicle routing problem with decoupling points.
Eur. J. Oper. Res., 2018

2017
Order picking problems under weight, fragility and category constraints.
Int. J. Prod. Res., 2017

2016
Solving the vehicle routing problem with lunch break arising in the furniture delivery industry.
J. Oper. Res. Soc., 2016

Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015.
INFOR Inf. Syst. Oper. Res., 2016

A practical vehicle routing problem with desynchronized arrivals to depot.
Eur. J. Oper. Res., 2016

2014
A simulation modeling framework for multiple-aisle automated storage and retrieval systems.
J. Intell. Manuf., 2014

Planification des tournées dans le domaine de la messagerie rapide.
INFOR Inf. Syst. Oper. Res., 2014

An exact solution approach for multi-objective location-transportation problem for disaster response.
Comput. Oper. Res., 2014

Relief distribution networks: a systematic review.
Ann. Oper. Res., 2014

2012
Heuristics for the multi-depot petrol station replenishment problem with time windows.
Eur. J. Oper. Res., 2012

A covering tour approach to the location of satellite distribution centers to supply humanitarian aid.
Eur. J. Oper. Res., 2012

2011
Space allocation and aisle positioning for an industrial pick-to-belt system.
J. Oper. Res. Soc., 2011

2010
A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars.
Eur. J. Oper. Res., 2010

2009
The petrol station replenishment problem with time windows.
Comput. Oper. Res., 2009

Optimal and heuristic solution methods for a multiprocessor machine scheduling problem.
Comput. Oper. Res., 2009

2008
Improving product location and order picking activities in a distribution centre.
J. Oper. Res. Soc., 2008

An exact algorithm for the petrol station replenishment problem.
J. Oper. Res. Soc., 2008

A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers.
J. Oper. Res. Soc., 2008

A heuristic for the multi-period petrol station replenishment problem.
Eur. J. Oper. Res., 2008

2007
A heuristic for the routing and carrier selection problem.
Eur. J. Oper. Res., 2007

Fast and efficient methods for industrial floor assembly.
Comput. Oper. Res., 2007

A simulation model to improve warehouse operations.
Proceedings of the Winter Simulation Conference, 2007

2006
Solving a vehicle-routing problem arising in soft-drink distribution.
J. Oper. Res. Soc., 2006

Synchronized routing of seasonal products through a production/distribution network.
Central Eur. J. Oper. Res., 2006

2004
Efficient heuristics for Median Cycle Problems.
J. Oper. Res. Soc., 2004

2003
Heuristics for the traveling purchaser problem.
Comput. Oper. Res., 2003

2002
A sweep-based algorithm for the fleet size and mix vehicle routing problem.
Eur. J. Oper. Res., 2002

Perturbation heuristics for the pickup and delivery traveling salesman problem.
Comput. Oper. Res., 2002

2000
A heuristic for the pickup and delivery traveling salesman problem.
Comput. Oper. Res., 2000

The column-circular, subsets-selection problem: complexity and solutions.
Comput. Oper. Res., 2000

1998
An efficient composite heuristic for the symmetric generalized traveling salesman problem.
Eur. J. Oper. Res., 1998

1996
A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem.
INFORMS J. Comput., 1996

A tabu search heuristic for the multi-depot vehicle routing problem.
Comput. Oper. Res., 1996


  Loading...