A tabu search heuristic for the multi-depot vehicle routing problem J Renaud, G Laporte, FF Boctor Computers & Operations Research 23 (3), 229-235, 1996 | 584 | 1996 |
A Jinear formulation of the machine-part cell formation problem FF Boctor The International Journal of Production Research 29 (2), 343-356, 1991 | 508 | 1991 |
A sweep-based algorithm for the fleet size and mix vehicle routing problem J Renaud, FF Boctor European Journal of Operational Research 140 (3), 618-628, 2002 | 292 | 2002 |
Resource-constrained project scheduling by simulated annealing FF Boctor International Journal of Production Research 34 (8), 2335-2351, 1996 | 278 | 1996 |
An improved petal heuristic for the vehicle routeing problem J Renaud, FF Boctor, G Laporte Journal of the operational Research Society 47 (2), 329-336, 1996 | 265 | 1996 |
Heuristics for scheduling projects with resource restrictions and several resource-duration modes FF Boctor The international journal of production research 31 (11), 2547-2558, 1993 | 261 | 1993 |
A heuristic for the pickup and delivery traveling salesman problem J Renaud, FF Boctor, J Ouenniche Computers & Operations Research 27 (9), 905-916, 2000 | 209 | 2000 |
A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes FF Boctor European Journal of Operational Research 90 (2), 349-361, 1996 | 207 | 1996 |
An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case RL Kadri, FF Boctor European Journal of Operational Research 265 (2), 454-462, 2018 | 202 | 2018 |
The petrol station replenishment problem with time windows F Cornillier, G Laporte, FF Boctor, J Renaud Computers & Operations Research 36 (3), 919-935, 2009 | 186 | 2009 |
A heuristic for the multi-period petrol station replenishment problem F Cornillier, FF Boctor, G Laporte, J Renaud European Journal of Operational Research 191 (2), 295-305, 2008 | 183 | 2008 |
A fast composite heuristic for the symmetric traveling salesman problem J Renaud, FF Boctor, G Laporte INFORMS Journal on computing 8 (2), 134-143, 1996 | 153 | 1996 |
Heuristics for the multi-depot petrol station replenishment problem with time windows F Cornillier, F Boctor, J Renaud European Journal of Operational Research 220 (2), 361-369, 2012 | 148 | 2012 |
An efficient composite heuristic for the symmetric generalized traveling salesman problem J Renaud, FF Boctor European Journal of Operational Research 108 (3), 571-584, 1998 | 145 | 1998 |
An exact algorithm for the petrol station replenishment problem F Cornillier, FF Boctor, G Laporte, J Renaud Journal of the Operational Research Society 59, 607-615, 2008 | 134 | 2008 |
Solving a vehicle-routing problem arising in soft-drink distribution J Privé, J Renaud, F Boctor, G Laporte Journal of the Operational Research Society 57 (9), 1045-1052, 2006 | 134 | 2006 |
Perturbation heuristics for the pickup and delivery traveling salesman problem J Renaud, FF Boctor, G Laporte Computers & Operations Research 29 (9), 1129-1141, 2002 | 129 | 2002 |
A heuristic for the routing and carrier selection problem MC Bolduc, J Renaud, F Boctor European Journal of Operational Research 183 (2), 926-932, 2007 | 112 | 2007 |
A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers MC Bolduc, J Renaud, F Boctor, G Laporte Journal of the Operational Research Society 59, 776-787, 2008 | 111 | 2008 |
A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars MC Bolduc, G Laporte, J Renaud, FF Boctor European Journal of Operational Research 202 (1), 122-130, 2010 | 100 | 2010 |