FSEGS

Sfax, Tunisia
Sfax, Tunisia
SEARCH FILTERS
Time filter
Source Type

Jarboui B.,FSEGS | Derbel H.,FSEGS | Hanafi S.,University of Valenciennes and Hainaut‑Cambresis | Mladenovic N.,Brunel University | Mladenovic N.,Mathematical Institute
Computers and Operations Research | Year: 2013

In this paper we propose various neighborhood search heuristics (VNS) for solving the location routing problem with multiple capacitated depots and one uncapacitated vehicle per depot. The objective is to find depot locations and to design least cost routes for vehicles. We integrate a variable neighborhood descent as the local search in the general variable neighborhood heuristic framework to solve this problem. We propose five neighborhood structures which are either of routing or location type and use them in both shaking and local search steps. The proposed three VNS methods are tested on benchmark instances and successfully compared with other two state-of-the-art heuristics. © 2012 Elsevier Ltd. All rights reserved.


Halouani N.,University of Sfax | Hajlaoui S.,FSEGS | Chabchoub H.,FSEGS
Advances in Intelligent Systems and Computing | Year: 2014

In this paper, two new aggregation operators are proposed: 2-tuple choquet integral harmonic averaging (TCIHA) and 2-tuple ordered choquet integral harmonic averaging (TOCIHA), which can be used to aggregate preference information in the form of linguistic variables. Some desirable properties of these operators are studied. Finally, illustrative example is presented to demonstrate practicality and effectiveness of the developed operators. © Springer-Verlag Berlin Heidelberg 2014.


Jarboui B.,FSEGS | Eddaly M.,FSEGS | Siarry P.,University Paris Est Creteil
International Journal of Advanced Manufacturing Technology | Year: 2011

A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are representative of the previous works in the area. Then, we compare the results given by three proposed algorithms. For the makespan criterion as well as for the total flowtime, the computational results show that our algorithms are able to provide competitive results and new best upper bounds. © Springer-Verlag London Limited 2010.


Bouabda R.,FSEGS | Jarboui B.,FSEGS | Jarboui B.,Institute Suprieur Of Commerce Et Of Comptabilit Of Bizerte | Eddaly M.,FSEGS | Reba A.,FSEGS
Computers and Operations Research | Year: 2010

This paper addresses the permutation flowline manufacturing cell with sequence dependent family setup times problem with the objective to minimize the makespan criterion. We develop a cooperative approach including a genetic algorithm and a branch and bound procedure. The latter is probabilistically integrated in the genetic algorithm in order to enhance the current solution. Moreover, the application of the branch and bound algorithm is based upon the decomposition of the problem into subproblems. The performance of the proposed method is tested by numerical experiments on a large number of representative problems. © 2010 Elsevier Ltd. All rights reserved.


Derbel H.,FSEGS | Jarboui B.,FSEGS | Hanafi S.,University of Valenciennes and Hainaut‑Cambresis | Chabchoub H.,FSEGS
Expert Systems with Applications | Year: 2012

This paper deals with a location routing problem with multiple capacitated depots and one uncapacitated vehicle per depot. We seek for new methods to make location and routing decisions simultaneously and efficiently. For that purpose, we describe a genetic algorithm (GA) combined with an iterative local search (ILS). The main idea behind our hybridization is to improve the solutions generated by the GA using a ILS to intensify the search space. Numerical experiments show that our hybrid algorithm improves, for all instances, the best known solutions previously obtained by the tabu search heuristic. © 2011 Elsevier Ltd. All rights reserved.


Bouabda R.,FSEGS | Jarboui B.,Institute Superieur Of Commerce Et Of Comptabilite Of Bizerte | Rebai A.,FSEGS
2011 4th International Conference on Logistics, LOGISTIQUA'2011 | Year: 2011

This paper addresses the permutation flowline manufacturing cell with sequence dependent family setup times problem with the objective to minimize the makespan criterion. We propose a new way of hybridizing iterated local search. It consists in using Branch and Bound algorithm as the embedded local search algorithm inside an iterated local search algorithm. Moreover, the application of the branch and bound algorithm is based upon the decomposition of the problem into subproblems. The performance of the proposed method is tested by numerical experiments on a large number of representative problems. © 2011 IEEE.


Mohamed Ali B.,FSEGN | Younes B.,FSEGS
Journal of Theoretical and Applied Information Technology | Year: 2013

ERP systems play an important supportive role in most sectors of the economy. This study was developed to answer the question related to the impact of ERP systems on user performance in Tunisian companies. This article proposes a model combining the Task Technology Fit (TTF), the Technology Acceptance Model (TAM) and Delone & McLean model to evaluate the user performance of ERP system. The model was tested using survey data collected from 269 users of the ERP system. The results of structural equation analyzes supported the proposed model and highlighted the important role of perceived ease of use and perceived usefulness in mediating effects between TTF, system quality and information quality and performance users. The results show that TTF, system quality and information quality directly influences the user performance of ERP and indirectly through perceived usefulness and perceived ease of use of ERP. © 2005 - 2013 JATIT & LLS. All rights reserved.


Derbel H.,FSEGS | Derbel B.,Lille University of Science and Technology
GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation | Year: 2012

We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by exploring different paths of the tree in a heuristic way. We show that allowing the search to 'backtrack' to a previously visited solution and resuming the iterative variable neighborhood descent by 'pruning' the already explored neighborhood branches leads to the design of effective and efficient search heuristics. We describe this idea by discussing its basic design components within a generic algorithmic scheme and we propose some simple and intuitive strategies to guide the search when traversing the neighborhood tree. We conduct a throughout experimental analysis of this approach by considering two different problem domains, namely, the Total Weighted Tardiness Problem (SMTWTP), and the more sophisticated Location Routing Problem (LRP). We show that independently of the considered domain, the approach is highly competitive. In particular, we show that using different branching and backtracking strategies when exploring the neighborhood tree allows us to achieve different trade-offs in terms of solution quality and computing cost. © 2012 ACM.


Chaabouni F.,FSEGS | Dhiaf M.M.,FSEGS
2011 4th International Conference on Logistics, LOGISTIQUA'2011 | Year: 2011

Outsourcing has become an increasingly popular option for many organisations. In order to clarify the motivation for logistics outsourcing, this paper analyses the perceived advantages and limitations. This article presents an empirical research on thirty Textile-Clothing companies operating in Tunisia. It was carried out to compare between the enterprises which outsource production and distribution functions in terms of benefits and decision-making for choosing third-party logistics. We develop and validate a survey instrument used to collect data for this study. Results based on the analysis of data indicate that most of these users are satisfied with the services providers. © 2011 IEEE.


Erromdhani R.,FSEGS | Eddaly M.,FSEGS | Rebai A.,FSEGS
Journal of Intelligent Manufacturing | Year: 2012

In this paper we address to the planning problem in the agroalimentary domain. In such industry, several specific constraints should be taken into account for planning task such as the constraints of interdependencies between the products and variable production modes. Furthermore, we present the relationship between two large fields as the production hierarchical planning and the flexibility. Especially, we show that the flexibility planning should be made a priori and then integrated in the hierarchical planning process. Indeed, we have established a mathematical model according to different production levels. While taking into account real capacities of the shop and the interdependencies between the products, the results of our formulation are satisfactory in terms of quality of solution and time requirements. It's shown that our model is able to reach all optimal solutions for all treated models and for all system levels. © Springer Science+Business Media, LLC 2010.

Loading FSEGS collaborators
Loading FSEGS collaborators