taicir loukil - Profile on Academia.edu (original) (raw)
Papers by taicir loukil
A configuration model for recovery product flows orientation in open loop network
ABSTRACT The configuration of the reverse logistics network (RLN) is an important task in the det... more ABSTRACT The configuration of the reverse logistics network (RLN) is an important task in the determination of processing recovered products. In fact, products orientation in open loop network can influence the economic interest of decision maker. In open loop configuration, returned products are reintegrated in the supply chain with multiple recovery strategy to reuse the products or materials. The decision of valorization alternative becomes more and more complex due to the diversity of orientation, the state of returned products etc. In this paper, we develop a linear programming model to determine the product flow orientation with minimum economic value. A numerical study provides an optimal solution and detects the impact of parameters such as capacity of facility, volume and variety of type returned product on network configuration.
A general variable neighbourhood search for the commodity constrained split delivery vehicle routing problem
International Journal of Logistics Systems and Management, 2023
IFIP advances in information and communication technology, 2021
published version of the paper. Such differences, if any, are usually due to reformatting during ... more published version of the paper. Such differences, if any, are usually due to reformatting during preparation for publication or minor corrections made by the author(s) during final proofreading of the publication manuscript.
A Green Supply Chain Design with Product Life Cycle Considerations
Supply chain forum, 2013
Due to rising consciousness in recent decades about environmental protection, many issues related... more Due to rising consciousness in recent decades about environmental protection, many issues related to green supply chain management have been discussed by businesses and governments at all levels. Different from traditional supply chain management, green supply chain management concerns itself with environmental impacts and material utilization issues, which make the selection of the supply chain actors a more complicated decision than usual. However, the procedure of selecting the supply chain actors is strongly guided by the product life cycle. This article emphasizes the importance of taking into account the product life cycle in a green supply chain design and suggests a way to do so.
Expert Systems With Applications, Apr 1, 2021
This is a PDF file of an article that has undergone enhancements after acceptance, such as the ad... more This is a PDF file of an article that has undergone enhancements after acceptance, such as the addition of a cover page and metadata, and formatting for readability, but it is not yet the definitive version of record. This version will undergo additional copyediting, typesetting and review before it is published in its final form, but we are providing this version to give early visibility of the article. Please note that, during the production process, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.
Dhouib-Matrix-TP1 Method to solve Fuzzy Transportation Problem Involving Heptagonal Fuzzy Numbers
Remanufacturing planning with imprecise quality inputs through the goal programming and the satisfaction functions
International journal of multicriteria decision making, 2012
ABSTRACT The aim of this paper is to develop a Goal Programming (GP) formulation within an imprec... more ABSTRACT The aim of this paper is to develop a Goal Programming (GP) formulation within an imprecise goals and inputs quality of product returns where the concept of satisfaction function will be utilized to introduce explicitly the manger's preferences into the remanufacturing aggregate planning model. In order to verify our proposed model, a numerical example is described to generate the best satisfying aggregate plan.
Non-dominated Sorting Genetic Algorithm-II to solve bi-objective multi-mode resource-constrained project scheduling problem
In general, the multi-mode resource-constrained project scheduling problem (MRCPSP) is considered... more In general, the multi-mode resource-constrained project scheduling problem (MRCPSP) is considered as mono-objective problem which aims at finishing the project as soon as possible under resource constraints. Nevertheless, the MRCPSP is multi-objective by nature and the omission of this aspect in its resolution may biases the reality; so we think extend the study of this problem to the bi-objective case. In our knowledge, we are the first to deal with the minimization of both makespan and non-renewable resource cost. The resolution of this Bi-objective MR-CPSP (BMRCPSP) gives more alternatives to the decision maker. In this work, we adapt the Non-dominated Sorting Genetic Algorithm-II technique (NSGA-II) to the BMRCPSP. Results obtained based on expensive experimentations, prove that the NSGA-II algorithm succeeds in solving a bi-objective combinatorial problem.
Multiple criteria decision making, 2009
Most popular Evolutionary Algorithms for single multi-objective optimisation are motivated by the... more Most popular Evolutionary Algorithms for single multi-objective optimisation are motivated by the reduction of the computation time and the resolution larger problems. A promising alternative is to create new distributed schemes that improve the behaviour of the search process of such algorithms. In the multi-objective optimisation problems, more exploration of the search space is required to obtain the whole or the best approximation of the Pareto front. Almost all proposed Parallel Multi-Objective Evolutionary Algorithms (PMOEAs) are based on the specialisation concept which means dividing the objective and/or the search space then assigning each part to a processor. One processor called the organiser or the coordinator is usually charged to direct the whole algorithm. In this paper, we present a new parallel scheme of multi-objective evolutionary algorithms which is based on a clustering technique. This new parallel algorithm is implemented and compared to three PMOEAs which are cone-separation [1], Divided Range Multi-Objective Genetic Algorithm (DRMOGA) [8] and a Parallel Strength Pareto Evolutionary Algorithm (PSPEA) based on the island model without migration.
Control and Cybernetics, 2000
A bstract: Most of multiple criteria scheduling problems are NP-hard, so that exact procedures ca... more A bstract: Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve small problems and with two criteria. The complexity and the diversity of multiple criteria scheduling problems resulted in many alternative approaches to solve them. Exact and approximate procedures proposed in the literature are mainly dedicated to the problem to be solved and their performance depends on the problem data, on the criteria optimized, and are generally difficult to implement. We propose in this paper a Tabu Search approach to multiple criteria scheduling problems. The proposed procedure is a general flexible method, able to solve hard multiple criteria scheduling problems, easy to implement, and providing a set of potential efficient schedules. The criteria are any combination chosen from (Cmax, Tmax ,I, Nr and F).
A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem
Springer eBooks, 2015
ABSTRACT In this paper, a rail-road π-hub allocation problem is considered. A set of π-containers... more ABSTRACT In this paper, a rail-road π-hub allocation problem is considered. A set of π-containers must be transferred from wagons to outgoing π-trucks using the rail-road π-sorters. A simulated annealing metaheuristic is proposed and compared to an existing heuristic. The main performance objective is to minimize the distance covered by each container to arrive at dock destination. Different scenarios are constructed and tested to compare both methods.
Operational Research, Dec 9, 2014
We consider the permutation flowshop scheduling problem with the objective of minimizing total ta... more We consider the permutation flowshop scheduling problem with the objective of minimizing total tardiness. Presented are several properties that are used to calculate lower bounds on total tardiness of jobs for a given partial sequence and to identify sequences dominated by others. We develop a branch and bound algorithm using these bounds and a dominance rule. Results of computational experiments on randomly generated problems are reported.
Multicriteria evaluation of pharmaceutical logistics performance: Case of Sahloul teaching hospital center pharmacy, Sousse
2022 14th International Colloquium of Logistics and Supply Chain Management (LOGISTIQUA), May 25, 2022
Exact Resolution for Healthcare Facility Location Problem: A Case Study of the Specific Pharmacy of Tunisia
Springer eBooks, 2022
HAL (Le Centre pour la Communication Scientifique Directe), 2008
La conception constitue une des étapes la plus importante dans le cycle de vie d'un atelier de pr... more La conception constitue une des étapes la plus importante dans le cycle de vie d'un atelier de production. Un des problèmes à soulever est le dimensionnement des ressources. Un sur ou un sous dimensionnement provoquera des sur-coûts supplémentaires. Il conditionnera aussi l'ordonnancement pendant la phase d'exploitation. Nous proposons dans ce papier une approche d'optimisation du dimensionnement d'un atelier de production basé sur les ordonnancements des scénarios de production prévisionnels. Nous nous intéressons à une organisation de flow shop hybride à plusieurs étages. En effet, nous proposons un programme linéaire permettant de minimiser conjointement le C max et le nombre de machines dans chaque étage pour un ensemble de jobs types de l'activité prévisionnelle. Un poids est attribué à chacun des objectifs. Au vu des résultats obtenus, cette approche peut fournir des solutions exactes pour des problèmes de petites tailles. Dans le cas où le poids attribué à chaque objectif est le même nous obtenons des solutions dites de « compromis ». Ces solutions de compromis ont permis de minimiser les coûts totaux.
Green VRP applied to Home Health Care problem
IFAC-PapersOnLine, 2022
HAL (Le Centre pour la Communication Scientifique Directe), 2008
Permutation flowshop problem with time lags scheduling by logic-based Benders decomposition
In this paper, we consider the problem of scheduling n jobs in an m-machine permutation flowshop ... more In this paper, we consider the problem of scheduling n jobs in an m-machine permutation flowshop with time lags between consecutive operations of each job. The processing order of jobs is the same for each machine. The time lag is defined as the waiting time between consecutive operations. We use logic-based Benders decomposition to minimize the total number of tardy jobs with long time horizon defined on the last machine. We combine Mixed Integer Linear programming (MILP) to allocate jobs to time intervals of the time horizon and scheduled using Constraint Programming (CP). Then, computational results are reported.
A road rail PI hub allocation problem: Heuristic in static and dynamic case
In this paper a new road-rail terminal design called road-rail PI hub is adapted to the usual cha... more In this paper a new road-rail terminal design called road-rail PI hub is adapted to the usual challenges of the intermodal transport which are time and cost. This research aims to find the “best” allocation of containers in a rail-road PI hub where a set of containers must be transferred from railcars to outgoing trucks using the sorters. The main goal is to minimize the used number of trucks. To achieve this, heuristic approach in static and dynamic case is proposed. Then results are compared to the upper bound and the FIFO method. The experimental results show that the proposed heuristic gives better results compared to the solution generated by FIFO;
A multi-phase approach for supply chain design with product life cycle considerations
A supply chain is an alliance of independent business processes, such as supplier, manufacturing,... more A supply chain is an alliance of independent business processes, such as supplier, manufacturing, and distribution processes that perform the critical functions in the order fulfillment process. Effective design and management of supply chains assists in production and delivery of a variety of products at low cost, high quality, and short lead times. However, the discussions in marketing and logistic literature universally conclude that it would be desirable to determine the life cycles of the products in the firm, as they have a great impact on appropriate supply chain design. This paper presents a multi-phase mathematical programming approach for effective supply chain design with product life cycle considerations. More specifically, the methodology develops and applies a combination of multi-criteria decision making models, based on aggregation concepts, and linear and integer programming methods. Model application and insights are detailed through numerical illustrations.
A configuration model for recovery product flows orientation in open loop network
ABSTRACT The configuration of the reverse logistics network (RLN) is an important task in the det... more ABSTRACT The configuration of the reverse logistics network (RLN) is an important task in the determination of processing recovered products. In fact, products orientation in open loop network can influence the economic interest of decision maker. In open loop configuration, returned products are reintegrated in the supply chain with multiple recovery strategy to reuse the products or materials. The decision of valorization alternative becomes more and more complex due to the diversity of orientation, the state of returned products etc. In this paper, we develop a linear programming model to determine the product flow orientation with minimum economic value. A numerical study provides an optimal solution and detects the impact of parameters such as capacity of facility, volume and variety of type returned product on network configuration.
A general variable neighbourhood search for the commodity constrained split delivery vehicle routing problem
International Journal of Logistics Systems and Management, 2023
IFIP advances in information and communication technology, 2021
published version of the paper. Such differences, if any, are usually due to reformatting during ... more published version of the paper. Such differences, if any, are usually due to reformatting during preparation for publication or minor corrections made by the author(s) during final proofreading of the publication manuscript.
A Green Supply Chain Design with Product Life Cycle Considerations
Supply chain forum, 2013
Due to rising consciousness in recent decades about environmental protection, many issues related... more Due to rising consciousness in recent decades about environmental protection, many issues related to green supply chain management have been discussed by businesses and governments at all levels. Different from traditional supply chain management, green supply chain management concerns itself with environmental impacts and material utilization issues, which make the selection of the supply chain actors a more complicated decision than usual. However, the procedure of selecting the supply chain actors is strongly guided by the product life cycle. This article emphasizes the importance of taking into account the product life cycle in a green supply chain design and suggests a way to do so.
Expert Systems With Applications, Apr 1, 2021
This is a PDF file of an article that has undergone enhancements after acceptance, such as the ad... more This is a PDF file of an article that has undergone enhancements after acceptance, such as the addition of a cover page and metadata, and formatting for readability, but it is not yet the definitive version of record. This version will undergo additional copyediting, typesetting and review before it is published in its final form, but we are providing this version to give early visibility of the article. Please note that, during the production process, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.
Dhouib-Matrix-TP1 Method to solve Fuzzy Transportation Problem Involving Heptagonal Fuzzy Numbers
Remanufacturing planning with imprecise quality inputs through the goal programming and the satisfaction functions
International journal of multicriteria decision making, 2012
ABSTRACT The aim of this paper is to develop a Goal Programming (GP) formulation within an imprec... more ABSTRACT The aim of this paper is to develop a Goal Programming (GP) formulation within an imprecise goals and inputs quality of product returns where the concept of satisfaction function will be utilized to introduce explicitly the manger's preferences into the remanufacturing aggregate planning model. In order to verify our proposed model, a numerical example is described to generate the best satisfying aggregate plan.
Non-dominated Sorting Genetic Algorithm-II to solve bi-objective multi-mode resource-constrained project scheduling problem
In general, the multi-mode resource-constrained project scheduling problem (MRCPSP) is considered... more In general, the multi-mode resource-constrained project scheduling problem (MRCPSP) is considered as mono-objective problem which aims at finishing the project as soon as possible under resource constraints. Nevertheless, the MRCPSP is multi-objective by nature and the omission of this aspect in its resolution may biases the reality; so we think extend the study of this problem to the bi-objective case. In our knowledge, we are the first to deal with the minimization of both makespan and non-renewable resource cost. The resolution of this Bi-objective MR-CPSP (BMRCPSP) gives more alternatives to the decision maker. In this work, we adapt the Non-dominated Sorting Genetic Algorithm-II technique (NSGA-II) to the BMRCPSP. Results obtained based on expensive experimentations, prove that the NSGA-II algorithm succeeds in solving a bi-objective combinatorial problem.
Multiple criteria decision making, 2009
Most popular Evolutionary Algorithms for single multi-objective optimisation are motivated by the... more Most popular Evolutionary Algorithms for single multi-objective optimisation are motivated by the reduction of the computation time and the resolution larger problems. A promising alternative is to create new distributed schemes that improve the behaviour of the search process of such algorithms. In the multi-objective optimisation problems, more exploration of the search space is required to obtain the whole or the best approximation of the Pareto front. Almost all proposed Parallel Multi-Objective Evolutionary Algorithms (PMOEAs) are based on the specialisation concept which means dividing the objective and/or the search space then assigning each part to a processor. One processor called the organiser or the coordinator is usually charged to direct the whole algorithm. In this paper, we present a new parallel scheme of multi-objective evolutionary algorithms which is based on a clustering technique. This new parallel algorithm is implemented and compared to three PMOEAs which are cone-separation [1], Divided Range Multi-Objective Genetic Algorithm (DRMOGA) [8] and a Parallel Strength Pareto Evolutionary Algorithm (PSPEA) based on the island model without migration.
Control and Cybernetics, 2000
A bstract: Most of multiple criteria scheduling problems are NP-hard, so that exact procedures ca... more A bstract: Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve small problems and with two criteria. The complexity and the diversity of multiple criteria scheduling problems resulted in many alternative approaches to solve them. Exact and approximate procedures proposed in the literature are mainly dedicated to the problem to be solved and their performance depends on the problem data, on the criteria optimized, and are generally difficult to implement. We propose in this paper a Tabu Search approach to multiple criteria scheduling problems. The proposed procedure is a general flexible method, able to solve hard multiple criteria scheduling problems, easy to implement, and providing a set of potential efficient schedules. The criteria are any combination chosen from (Cmax, Tmax ,I, Nr and F).
A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem
Springer eBooks, 2015
ABSTRACT In this paper, a rail-road π-hub allocation problem is considered. A set of π-containers... more ABSTRACT In this paper, a rail-road π-hub allocation problem is considered. A set of π-containers must be transferred from wagons to outgoing π-trucks using the rail-road π-sorters. A simulated annealing metaheuristic is proposed and compared to an existing heuristic. The main performance objective is to minimize the distance covered by each container to arrive at dock destination. Different scenarios are constructed and tested to compare both methods.
Operational Research, Dec 9, 2014
We consider the permutation flowshop scheduling problem with the objective of minimizing total ta... more We consider the permutation flowshop scheduling problem with the objective of minimizing total tardiness. Presented are several properties that are used to calculate lower bounds on total tardiness of jobs for a given partial sequence and to identify sequences dominated by others. We develop a branch and bound algorithm using these bounds and a dominance rule. Results of computational experiments on randomly generated problems are reported.
Multicriteria evaluation of pharmaceutical logistics performance: Case of Sahloul teaching hospital center pharmacy, Sousse
2022 14th International Colloquium of Logistics and Supply Chain Management (LOGISTIQUA), May 25, 2022
Exact Resolution for Healthcare Facility Location Problem: A Case Study of the Specific Pharmacy of Tunisia
Springer eBooks, 2022
HAL (Le Centre pour la Communication Scientifique Directe), 2008
La conception constitue une des étapes la plus importante dans le cycle de vie d'un atelier de pr... more La conception constitue une des étapes la plus importante dans le cycle de vie d'un atelier de production. Un des problèmes à soulever est le dimensionnement des ressources. Un sur ou un sous dimensionnement provoquera des sur-coûts supplémentaires. Il conditionnera aussi l'ordonnancement pendant la phase d'exploitation. Nous proposons dans ce papier une approche d'optimisation du dimensionnement d'un atelier de production basé sur les ordonnancements des scénarios de production prévisionnels. Nous nous intéressons à une organisation de flow shop hybride à plusieurs étages. En effet, nous proposons un programme linéaire permettant de minimiser conjointement le C max et le nombre de machines dans chaque étage pour un ensemble de jobs types de l'activité prévisionnelle. Un poids est attribué à chacun des objectifs. Au vu des résultats obtenus, cette approche peut fournir des solutions exactes pour des problèmes de petites tailles. Dans le cas où le poids attribué à chaque objectif est le même nous obtenons des solutions dites de « compromis ». Ces solutions de compromis ont permis de minimiser les coûts totaux.
Green VRP applied to Home Health Care problem
IFAC-PapersOnLine, 2022
HAL (Le Centre pour la Communication Scientifique Directe), 2008
Permutation flowshop problem with time lags scheduling by logic-based Benders decomposition
In this paper, we consider the problem of scheduling n jobs in an m-machine permutation flowshop ... more In this paper, we consider the problem of scheduling n jobs in an m-machine permutation flowshop with time lags between consecutive operations of each job. The processing order of jobs is the same for each machine. The time lag is defined as the waiting time between consecutive operations. We use logic-based Benders decomposition to minimize the total number of tardy jobs with long time horizon defined on the last machine. We combine Mixed Integer Linear programming (MILP) to allocate jobs to time intervals of the time horizon and scheduled using Constraint Programming (CP). Then, computational results are reported.
A road rail PI hub allocation problem: Heuristic in static and dynamic case
In this paper a new road-rail terminal design called road-rail PI hub is adapted to the usual cha... more In this paper a new road-rail terminal design called road-rail PI hub is adapted to the usual challenges of the intermodal transport which are time and cost. This research aims to find the “best” allocation of containers in a rail-road PI hub where a set of containers must be transferred from railcars to outgoing trucks using the sorters. The main goal is to minimize the used number of trucks. To achieve this, heuristic approach in static and dynamic case is proposed. Then results are compared to the upper bound and the FIFO method. The experimental results show that the proposed heuristic gives better results compared to the solution generated by FIFO;
A multi-phase approach for supply chain design with product life cycle considerations
A supply chain is an alliance of independent business processes, such as supplier, manufacturing,... more A supply chain is an alliance of independent business processes, such as supplier, manufacturing, and distribution processes that perform the critical functions in the order fulfillment process. Effective design and management of supply chains assists in production and delivery of a variety of products at low cost, high quality, and short lead times. However, the discussions in marketing and logistic literature universally conclude that it would be desirable to determine the life cycles of the products in the firm, as they have a great impact on appropriate supply chain design. This paper presents a multi-phase mathematical programming approach for effective supply chain design with product life cycle considerations. More specifically, the methodology develops and applies a combination of multi-criteria decision making models, based on aggregation concepts, and linear and integer programming methods. Model application and insights are detailed through numerical illustrations.