Sana Frifita

Sana Frifita

Auto-generated profile, based on publicly available information

Sana Frifita

Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems, Faculty of Economics and Management of Sfax, University of Sfax, Sfax, Tunisia

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 October 2018 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
SFSana Frifita
Sana Frifita
Malek MasmoudiMalek Masmoudi
Malek Masmoudi

30 April 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
SFSana Frifita
Sana Frifita
HAHasan Murat Afsar
Hasan Murat Afsar
FHFaicel Hnaien
Faicel Hnaien

13 February 2017 in Management Decision
Verified
Journal Article
Closed access
JEJalel Euchi
Jalel Euchi
SFSana Frifita
Sana Frifita
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.

19 February 2020 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
SFSana Frifita
Sana Frifita
IMInes Mathlouthi
Ines Mathlouthi
Malek MasmoudiMalek Masmoudi
Malek Masmoudi
ADAbdelaziz Dammak
Abdelaziz Dammak