Sana Frifita
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
Sana Frifita has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Malek Masmoudi
University of Sharjah
2 shared publications - Abdelaziz Dammak
Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems, Faculty of Economics and Management of Sfax, University of Sfax, Sfax, Tunisia
1 shared publication Faicel Hnaien
1 shared publicationHasan Murat Afsar
1 shared publication- Ines Mathlouthi
Department of Computer Science and Operations Research, University of Montreal, Quebec, Canada
1 shared publication - Jalel Euchi
Sfax University
1 shared publication
Latest Publications
- 30 April 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 202
A robust optimization approach for disassembly assembly routing problem under uncertain yields
- 30 April 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 202
A robust optimization approach for disassembly assembly routing problem under uncertain yields
- 19 February 2020
- Published by Springer Nature in Optimization Letters
- Vol. 14 (8) , 2285-2299
Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem
- 19 February 2020
- Published by Springer Nature in Optimization Letters
- Vol. 14 (8) , 2285-2299
Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem
- 15 October 2018
- Published by Wiley in International Transactions in Operational Research
- Vol. 27 (1) , 291-313
VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
The need for optimization in the Home Care Service is becoming more and more legitimate in the face of the increase of demand and cost all over the world. Recently, many researchers in the Operation Research community have been attracted by this issue, which presents interesting aspects related to the vehicle routing problems. In this paper, we consider a new variant called the vehicle routing problem with time windows, temporal dependencies (synchronization, precedence, and disjunction), multi‐structures, and multispecialties problem (VRPTW‐TD‐2MS). This new variant is an extension of the vehicle routing problems with time windows and synchronization constraints (VRPTW‐S) that is well‐studied in literature. We present a Mixed Integer Programming method, and propose three Variable Neighborhood Search approaches. Extensive experiments show the effectiveness and efficiency of the General Variable Neighborhood Search with Ejection Chains‐based local search for solving VRPTW‐TD‐2MS and VRPTW‐S.
- 15 October 2018
- Published by Wiley in International Transactions in Operational Research
- Vol. 27 (1) , 291-313
VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
The need for optimization in the Home Care Service is becoming more and more legitimate in the face of the increase of demand and cost all over the world. Recently, many researchers in the Operation Research community have been attracted by this issue, which presents interesting aspects related to the vehicle routing problems. In this paper, we consider a new variant called the vehicle routing problem with time windows, temporal dependencies (synchronization, precedence, and disjunction), multi‐structures, and multispecialties problem (VRPTW‐TD‐2MS). This new variant is an extension of the vehicle routing problems with time windows and synchronization constraints (VRPTW‐S) that is well‐studied in literature. We present a Mixed Integer Programming method, and propose three Variable Neighborhood Search approaches. Extensive experiments show the effectiveness and efficiency of the General Variable Neighborhood Search with Ejection Chains‐based local search for solving VRPTW‐TD‐2MS and VRPTW‐S.
- 13 February 2017
- Published by Emerald Publishing in Management Decision
- Vol. 55 (1) , 136-155
Hybrid metaheuristic to solve the “one-to-many-to-one” problem
Purpose: The purpose of this paper is to present a specific variant of vehicle routing problem with simultaneous full pickup and delivery problem (VRPSFPD) known as one-to-many-to-one (1-M-1) problem with several vehicles, where every customer can receive and send goods simultaneously, which has added the notion of the totality for the pickup goods. Currently, hybrid metaheuristics have become more popular because they offer the best solutions to several combinatorial optimization problems. Therefore, due to the complexity of 1-M-1 a hybrid genetic algorithm with variable neighborhood descent (HGAVND) local search is proposed. To improve the solution provided by the HGAVND the authors suggest applying a structure OR-Opt. To test the performance of the algorithm the authors have used a set of benchmarks from the literature and apply the HGAVND algorithm to solve the real case of distribution of soft drink in Tunisia. The experimental results indicate that the algorithm can outperform all other algorithms proposed in literature with regard to solution quality and processing time. Moreover, the authors improve the best known solution of the majority of benchmark instances taken from the literature. Design/methodology/approach: Due to the complexity of 1-M-1 a HGAVND local search is proposed. Originality/value: First, in the presence of full pickup constraints, the problem becomes more complex, this implies that the choice of a good metaheuristic can provide good results. Second, the best contribution consists in a specific variant of VRPSFPD problem as 1-M-1 which the paper present the first application of metaheuristics to solve the specific 1-M-1 and to apply it in real case of distribution of soft drink.
- 13 February 2017
- Published by Emerald Publishing in Management Decision
- Vol. 55 (1) , 136-155
Hybrid metaheuristic to solve the “one-to-many-to-one” problem
Purpose: The purpose of this paper is to present a specific variant of vehicle routing problem with simultaneous full pickup and delivery problem (VRPSFPD) known as one-to-many-to-one (1-M-1) problem with several vehicles, where every customer can receive and send goods simultaneously, which has added the notion of the totality for the pickup goods. Currently, hybrid metaheuristics have become more popular because they offer the best solutions to several combinatorial optimization problems. Therefore, due to the complexity of 1-M-1 a hybrid genetic algorithm with variable neighborhood descent (HGAVND) local search is proposed. To improve the solution provided by the HGAVND the authors suggest applying a structure OR-Opt. To test the performance of the algorithm the authors have used a set of benchmarks from the literature and apply the HGAVND algorithm to solve the real case of distribution of soft drink in Tunisia. The experimental results indicate that the algorithm can outperform all other algorithms proposed in literature with regard to solution quality and processing time. Moreover, the authors improve the best known solution of the majority of benchmark instances taken from the literature. Design/methodology/approach: Due to the complexity of 1-M-1 a HGAVND local search is proposed. Originality/value: First, in the presence of full pickup constraints, the problem becomes more complex, this implies that the choice of a good metaheuristic can provide good results. Second, the best contribution consists in a specific variant of VRPSFPD problem as 1-M-1 which the paper present the first application of metaheuristics to solve the specific 1-M-1 and to apply it in real case of distribution of soft drink.