Rachid Ouafi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Rachid Ouafi has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Wahiba Ramdane Cherif-Khettaf
LORIA, UMR 7503, Lorraine University
3 shared publicationsAbdelaziz Benantar
2 shared publicationsHayet Chentli
2 shared publicationsJaouad Boukachour
2 shared publications- Jaouad Boukachour
IUT, Le Havre Normandy University, 76610 Le Havre, France
2 shared publications A. Giannakos
1 shared publication
Latest Publications
- 31 May 2019
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 58 (1) , 17-37
An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
This paper discusses the petrol-station replenishment problem with adjustable demands (PSRP-AD). This problem originates from a practical application of fuel delivery, where the main objective is to satisfy all petrol-station demands at a minimal cost. However, the problem includes tanks with adjustable loads while respecting the agreement made between the company and the customers. This agreement allows the company to reduce the delivery up to a given threshold less than the ordered demand. For the PSRP-AD, we first describe the problem and provide the mathematical modelling that distinguishes between the loading and routing phases, followed by an improved tabu search to solve it. Within the framework of the tabu search, we embed the Kolmogorov–Smirnov statistic in the classical moves in order to speed up the search process. The results show that our solution is competitive on the benchmark instances and outperforms the current delivery method used by the company with a significant improvement.
- 31 May 2019
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 58 (1) , 17-37
An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
This paper discusses the petrol-station replenishment problem with adjustable demands (PSRP-AD). This problem originates from a practical application of fuel delivery, where the main objective is to satisfy all petrol-station demands at a minimal cost. However, the problem includes tanks with adjustable loads while respecting the agreement made between the company and the customers. This agreement allows the company to reduce the delivery up to a given threshold less than the ordered demand. For the PSRP-AD, we first describe the problem and provide the mathematical modelling that distinguishes between the loading and routing phases, followed by an improved tabu search to solve it. Within the framework of the tabu search, we embed the Kolmogorov–Smirnov statistic in the classical moves in order to speed up the search process. The results show that our solution is competitive on the benchmark instances and outperforms the current delivery method used by the company with a significant improvement.
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Logistics Systems and Management
- Vol. 32 (3/4) , 346
A combined vehicle loading and routing problem: a case study of fuel logistics
Inderscience Publishers: publishers of distinguished academic, scientific and professional journals.
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Logistics Systems and Management
- Vol. 32 (3/4) , 346
A combined vehicle loading and routing problem: a case study of fuel logistics
Inderscience Publishers: publishers of distinguished academic, scientific and professional journals.
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Logistics Systems and Management
- Vol. 32 (3/4) , 346
A combined vehicle loading and routing problem: a case study of fuel logistics
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Logistics Systems and Management
- Vol. 32 (3/4) , 346
A combined vehicle loading and routing problem: a case study of fuel logistics
- 1 October 2018
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 52 (4-5) , 1295-1328
A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
The Vehicle Routing Problem with Simultaneous Pickups and Deliveries (VRPSPD) is a variant of the Vehicle Routing Problem. In this variant, an unlimited fleet of capacitated vehicles is used to satisfy both pickup and delivery demands of each customer simultaneously. In many practical situations, such a fleet is costly. The present study extends the VRPSPD by assuming a fixed number of vehicles when the constraint of visiting all customers is relaxed. More specifically, profits are assigned to the customers with the goal of maximizing the difference between collected profits and routing costs. This variant is named Profitable Tour Problem with Simultaneous Pickup and Delivery services (PTPSPD). We present a mathematical model run with the CPLEX solver. We also present an extension of the Adaptive Large Neighborhood Search heuristic (ALNS) called selective ALNS (sALNS). sALNS uses a new operator selection that executes two phases alternately: the random and the score-dependent phases. An appropriate update of scores is employed. Furthermore, sALNS explores missed regions of the search space by evaluating solutions after the destruction step. Finally, we give tuned insertion and removal operators that handle the constraints of the PTPSPD, as well as a new update of temperature, that helps avoiding local optima, in the Simulated Annealing embedded in sALNS. sALNS is evaluated on 117 new instances with 50–199 customers. A comparison is made between the components of sALNS, the classical ALNS and a recent ALNS heuristic from the literature. sALNS is also evaluated on some VRPSPD instances from the literature. The computational results show that our heuristic provides good quality solutions in reasonable computing time.
- 1 October 2018
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 52 (4-5) , 1295-1328
A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
The Vehicle Routing Problem with Simultaneous Pickups and Deliveries (VRPSPD) is a variant of the Vehicle Routing Problem. In this variant, an unlimited fleet of capacitated vehicles is used to satisfy both pickup and delivery demands of each customer simultaneously. In many practical situations, such a fleet is costly. The present study extends the VRPSPD by assuming a fixed number of vehicles when the constraint of visiting all customers is relaxed. More specifically, profits are assigned to the customers with the goal of maximizing the difference between collected profits and routing costs. This variant is named Profitable Tour Problem with Simultaneous Pickup and Delivery services (PTPSPD). We present a mathematical model run with the CPLEX solver. We also present an extension of the Adaptive Large Neighborhood Search heuristic (ALNS) called selective ALNS (sALNS). sALNS uses a new operator selection that executes two phases alternately: the random and the score-dependent phases. An appropriate update of scores is employed. Furthermore, sALNS explores missed regions of the search space by evaluating solutions after the destruction step. Finally, we give tuned insertion and removal operators that handle the constraints of the PTPSPD, as well as a new update of temperature, that helps avoiding local optima, in the Simulated Annealing embedded in sALNS. sALNS is evaluated on 117 new instances with 50–199 customers. A comparison is made between the components of sALNS, the classical ALNS and a recent ALNS heuristic from the literature. sALNS is also evaluated on some VRPSPD instances from the literature. The computational results show that our heuristic provides good quality solutions in reasonable computing time.
- Open Access
- 1 January 2018
- Published by INSTICC
- p. 115-123
Behaviour of a Hybrid ILS Heuristic on the Capacitated Profitable Tour Problem
- 1 January 2018
- Published by INSTICC
- p. 115-123
Open AccessBehaviour of a Hybrid ILS Heuristic on the Capacitated Profitable Tour Problem
- 1 September 2017
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 111, 50-55
An approximation algorithm for the k -fixed depots problem
- 1 September 2017
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 111, 50-55
An approximation algorithm for the k -fixed depots problem
- Open Access
- 11 April 2016
- Published by Springer Nature in Logistics Research
- Vol. 9 (1) , 1-18
A petrol station replenishment problem: new variant and formulation
- 11 April 2016
- Published by Springer Nature in Logistics Research
- Vol. 9 (1) , 1-18
Open AccessA petrol station replenishment problem: new variant and formulation
- 19 September 2012
- Published by Springer Nature
- p. 351-359
An Approximation Algorithm for the Three Depots Hamiltonian Path Problem
- 19 September 2012
- Published by Springer Nature
- p. 351-359
An Approximation Algorithm for the Three Depots Hamiltonian Path Problem
- 29 February 2012
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 62 (1) , 177-189
A parallel algorithm for constrained two-staged two-dimensional cutting problems
- 29 February 2012
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 62 (1) , 177-189
A parallel algorithm for constrained two-staged two-dimensional cutting problems