Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Armand Baboli is active.

Publication


Featured researches published by Armand Baboli.


Computers & Operations Research | 2012

Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing

Reza Kia; Armand Baboli; Nikbakhsh Javadian; Reza Tavakkoli-Moghaddam; Mohammad Kazemi; Javad Khorrami

This paper presents a novel mixed-integer non-linear programming model for the layout design of a dynamic cellular manufacturing system (DCMS). In a dynamic environment, the product mix and part demands are varying during a multi-period planning horizon. As a result, the best cell configuration for one period may not be efficient for successive periods, and thus it necessitates reconfigurations. Three major and interrelated decisions are involved in the design of a CMS; namely cell formation (CF), group layout (GL) and group scheduling (GS). A novel aspect of this model is concurrently making the CF and GL decisions in a dynamic environment. The proposed model integrating the CF and GL decisions can be used by researchers and practitioners to design GL in practical and dynamic cell formation problems. Another compromising aspect of this model is the utilization of multi-rows layout to locate machines in the cells configured with flexible shapes. Such a DCMS model with an extensive coverage of important manufacturing features has not been proposed before and incorporates several design features including alternate process routings, operation sequence, processing time, production volume of parts, purchasing machine, duplicate machines, machine capacity, lot splitting, intra-cell layout, inter-cell layout, multi-rows layout of equal area facilities and flexible reconfiguration. The objective of the integrated model is to minimize the total costs of intra and inter-cell material handling, machine relocation, purchasing new machines, machine overhead and machine processing. Linearization procedures are used to transform the presented non-linear programming model into a linearized formulation. Two numerical examples taken from the literature are solved by the Lingo software using a branch-and-bound method to illustrate the performance of this model. An efficient simulated annealing (SA) algorithm with elaborately designed solution representation and neighborhood generation is extended to solve the proposed model because of its NP-hardness. It is then tested using several problems with different sizes and settings to verify the computational efficiency of the developed algorithm in comparison with the Lingo software. The obtained results show that the proposed SA is able to find the near-optimal solutions in computational time, approximately 100 times less than Lingo. Also, the computational results show that the proposed model to some extent overcomes common disadvantages in the existing dynamic cell formation models that have not yet considered layout problems.


Mathematical Problems in Engineering | 2011

A Multiobjective Stochastic Production-Distribution Planning Problem in an Uncertain Environment Considering Risk and Workers Productivity

S.M.J. Mirzapour Al-e-hashem; Armand Baboli; Seyed Jafar Sadjadi; Mir-Bahador Aryanezhad

A multi-objective two stage stochastic programming model is proposed to deal with a multi-period multi-product multi-site production-distribution planning problem for a midterm planning horizon. The presented model involves majority of supply chain cost parameters such as transportation cost, inventory holding cost, shortage cost, production cost. Moreover some respects as lead time, outsourcing, employment, dismissal, workers productivity and training are considered. Due to the uncertain nature of the supply chain, it is assumed that cost parameters and demand fluctuations are random variables and follow from a pre-defined probability distribution. To develop a robust stochastic model, an additional objective functions is added to the traditional production-distribution-planning problem. So, our multi-objective model includes (i) the minimization of the expected total cost of supply chain, (ii) the minimization of the variance of the total cost of supply chain and (iii) the maximization of the workers productivity through training courses that could be held during the planning horizon. Then, the proposed model is solved applying a hybrid algorithm that is a combination of Monte Carlo sampling method, modified 𝜀-constraint method and L-shaped method. Finally, a numerical example is solved to demonstrate the validity of the model as well as the efficiency of the hybrid algorithm.


2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) | 2014

A bi-objective inventory routing problem by considering customer satisfaction level in context of perishable product

Mohammad Rahimi; Armand Baboli; Yacine Rekik

In this paper, we study a joint inventory and routing problem (IRP) for the food supply chain and we investigate the impact of customer satisfaction level under the optimization of the total expected cost. We propose a new bi-objective mathematical model by taking into account multi capacitated vehicles for perishable products from one supplier to many customers by considering total traveling time. The first objective in our optimization minimizes the different inventory and distribution costs (holding cost, shortage cost, ordering cost, fixed, variable transportation cost and recycling cost) while the second objective considers the customer satisfaction level, which is measured based on delays of vehicles. We consider perishable items and we also manage in this framework their shelf life (expiration date). The proposed framework is modelled as a mixed-integer linear program and is solved by using the software GAMS.


Archive | 2017

Inventory Routing Problem for Perishable Products by Considering Customer Satisfaction and Green Criteria

Mohammad Rahimi; Armand Baboli; Yacine Rekik

This paper presents a new model for Inventory Routing Problem (IRP) considering simultaneously economic criteria, customer satisfaction level and environmental aspect for perishable products with expiration date. For this consideration, a multi-objective mathematical model has been developed. The first objective focuses on traditional inventory and distribution costs as well as recycling cost of perished products. The second objective concerns in customer satisfaction by minimization of three criteria, such as the number of delays (deliver after time windows), the quantity of backordered, and the frequency of backorders. The third objective considers Greenhouse Gas (GHG) emission, produced by different IRP activities. The proposed model is also enabled to investigate the possibility of using diesel and electrical vehicles in urban transportation. In order to cope with complexity of proposed model, Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is tuned and applied. Finally, sensitivity analysis is performed to investigate the effects of variation of customer satisfaction and green aspects in economic side.


industrial engineering and engineering management | 2014

A new bi-objective mathematical model for sustainable dynamic cellular manufacturing systems

Farzad Niakan; Armand Baboli; Thierry Moyaux; Valérie Botta-Genoulaz

This study addresses dynamic cell configuration and labor assignment by making a trade-off between economic, social and environmental criteria which is called as sustainability configuration. In order to improve the study about energy loss, a new bi-objective mathematical model is presented. The first objective of model minimizes cost criteria and the second one energy loss which is represented by the efficiency of each machine. We develop a Non-dominated Sorting Genetic Algorithm (NSGA-II) in order to solve our model. The applicability of our approach is illustrated by two test problems.


annual conference on computers | 2009

A method to evaluate downstream and upstream information sharing using the genetic algorithm

Mansour Rached; Zied Bahroun; Armand Baboli; Jean-Pierre Campagne; Belhassen Zouari

This paper deals with four scenarios of sharing upstream and downstream information simultaneously in supply chains. Replenishment leadtime is the upstream information studied in this work and demand information is the downstream one. We propose a system cost formulation for two-echelon (a depot and several retailers) and multi-products supply chain. We focused our study on a centralized system case. In our formulation, we consider holding, ordering, penalty and transportation costs. Then, we use a Genetic Algorithm in order to approximate the optimal echelon inventory position at depot which minimizes the system cost. Our approach is illustrated by some numerical experiments.


annual conference on computers | 2009

A method for the determination of safety stock levels in order to study the effect of replenishment leadtime information sharing

Ali Mehrabi; Armand Baboli; Jean-Pierre Campagne

Information sharing provides opportunities to reduce the safety stocks held to face uncertainty. In this context, we study the effect of sharing the information on replenishment leadtime on safety stock levels in a two echelon supply chain. We assume that the demand at the retailer is deterministic while the replenishment leadtime at the warehouse is variable with a uniform distribution. Two replenishment polices are presented, the first one for the case without information sharing and the second one with information sharing. A mathematical proof identifies the optimal safety stock level in each case. Next, the value of leadtime information sharing is estimated by comparing safety stock costs in these cases. The results of the mathematical proof as well as the numerical experimentations of a downstream pharmaceutical supply chain both show a significant reduction of total system costs thanks to leadtime information sharing.


international conference on service operations and logistics, and informatics | 2015

Inventory routing problem for perishable products by considering social issue

Mohammad Rahimi; Armand Baboli; Yacine Rekik

Inventory Routing Problem (IRP) for perishable products is one of the complex subjects in IRPs. Moreover, considering other criteria and constraints, such as respecting time window, managing the amount of expired products, fuel consumption and environment and social criteria bring this problem more complex. This paper presents a new model considering economic and social aspects in IRPs. We study the effect of speed of vehicle in distribution of perishable products in IRPs. This consideration allows to reduce delivery time, impacting several economic criteria, but increase driver injury (risk of accident for driver), considerate in this model as social issues. In order to find a tradeoff between these issues, a new bi-objective mathematical model has been proposed. First objective focuses on traditional cost of inventory and distribution as well as age and price strategy, backorder cost and discount. Second objective function concerns in minimization of driver injury (social issue), calculated by considering the speed of vehicle in different existing paths between retailers. In fact, quicker path allows to decrease some costs but increase accident risk. It is noteworthy that other economic and social criteria can also add to proposed model. Finally, sensitivity analysis are performed to investigate the importance of each objective function as well as the effect of variation of inventory holding cost against profit and driver injury.


international conference on advances in production management systems | 2014

A Multi-objective Mathematical Model Considering Economic and Social Criteria in Dynamic Cell Formation

Farzad Niakan; Armand Baboli; Thierry Moyaux; Valérie Botta-Genoulaz

This paper addresses a Dynamic Cellular Manufacturing Systems (DCMS) problem considering both economic and social criteria, that is, the problem deals with the minimization of the total costs and maximization of social issues. We develop a bi-objective mathematical model of this problem in order to capture the trade-off between these two objectives. The strategic decisions considered in the model define the configuration of cells and part-families in each period. In order to solve our model, we design a new Non-dominated Sorting Genetic Algorithm (NSGA-II) as a meta-heuristic method. Our approach is illustrated on two samples of problems randomly generated.


IFAC Proceedings Volumes | 2013

A new up-to level inventory model for deteriorating products with non-linear holding cost

Z. Sazvar; Yacine Rekik; M.R. Akbari Jokar; Armand Baboli; S.M.J. Mirzapour Al-E-Hashem

Abstract Inventory management of deteriorating items faces major challenges by uncertain demand, uncertain lead time, perishability, and high customer service level requirements. So, this issue is extremely important in many corporations today. The periodic up-to level policy for deteriorating products under stochastic demand and stochastic lead time is not paid enough attention up to now. In this paper we propose a new approach to study inventory up-to level policy of deteriorating products under normal distributed demand and lead time by considering service level requirements. To model deterioration process, a non-linear increasing holding cost function is considered. After developing the mathematical model, a solving procedure is proposed to determine the global optimum value of decision variables. Finally, a sensitivity analyses is done to demonstrate the applicability and validity of the proposed model.

Collaboration


Dive into the Armand Baboli's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Ali Mehrabi

Institut national des sciences Appliquées de Lyon

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge