International Journal of Industrial Engineering Computations

Journal Information
ISSN / EISSN : 1923-2926 / 1923-2934
Published by: Growing Science (10.5267)
Total articles ≅ 506
Current Coverage
SCOPUS
DOAJ
SCIE
Archived in
SHERPA/ROMEO
Filter:

Latest articles in this journal

Luis Miguel Escobar-Falcón, David Álvarez-Martínez, John Wilmer-Escobar, Mauricio Granada-Echeverri
international journal of industrial engineering computations pp 191-204; https://doi.org/10.5267/j.ijiec.2020.11.003

Abstract:
The vehicle routing problem combined with loading of goods, considering the reduction of fuel consumption, aims at finding the set of routes that will serve the demands of the customers, arguing that the fuel consumption is directly related to the weight of the load in the paths that compose the routes. This study integrates the Fuel Consumption Heterogeneous Vehicle Routing Problem with Two-Dimensional Loading Constraints (2L-FHFVRP). To reduce fuel consumption taking the associated environmental impact into account is a classical VRP variant that has gained increasing attention in the last decade. The objective of this problem is to design the delivery routes to satisfy the customers’ demands with the lowest possible fuel consumption, which depends on the distances of the paths, the assigned vehicles, the loading/unloading pattern and the load weight. In the vehicle routing problem literature, the approximate algorithms have had great success, especially the evolutionary ones, which appear in previous works with quite a sophisticated structure, obtaining excellent results, but that are difficult to implement and adapt to other variants such as the one proposed here. In this study, we present a specialized genetic algorithm to solve the design of routes, keeping its main characteristic: the easy implementation. By contrast, the loading of goods restriction is validated by means of a GRASP algorithm, which has been widely employed for solving packing problems. With a view of confirming the performance of the proposed methodology, we provide a computational study that uses all the available benchmark instances, allowing to illustrate the savings achieved in fuel consumption. In addition, the methodology suggested can be adapted to the version of solely minimizing the total distance traveled for serving the customers (without the fuel consumption) and it is compared to the best works presented in the literature. The computational results show that the methodology manages to be adequately adapted to this version and it is capable of finding improved solutions for some benchmark instances. As for future work, we propose to adjust the methodology to consider the three-dimensional loading problem so that it adapts to more real-life conditions of the industry.
Grzegorz Filcek, Jerzy Józefczyk, Mirosław Ławrynowicz
international journal of industrial engineering computations pp 159-176; https://doi.org/10.5267/j.ijiec.2020.12.002

Abstract:
A new case of joint location and scheduling (ScheLoc) problem is considered. It deals with selecting a non-fixed number of locations for identical parallel executors (machines) from a given set of available sites. Simultaneously, a schedule for a set of tasks is sought. For every task, it comprises an executor carrying-out the task and the moment of time when the performance of the task is started. The locations for executors and the schedule are evaluated by two criteria: the sum of task completion times and investment costs incurred when locations for executors are selected and launched. It is justified that the joint optimization problem is strongly NP-hard. In consequence, a heuristic algorithm Alg_BC is proposed, which uses the general scheme of NSGA II provided for the multi-criteria optimization. The performance of Alg_BC is evaluated for small instances by exact solutions determined by the Matlab solver. The sensitivity analysis for bigger instances is also provided, which among others, allows examining the influence of both component criteria on results generated by the evaluated algorithm. A case study dealing with the evacuation of citizen groups from danger zones is provided as an example of the investigated bi-criteria ScheLoc problem. The usefulness of Alg_BC is confirmed as well.
Singa Wang Chiu, Victoria Chiu, Ming-Hon Hwang, Yuan-Shyi Peter Chiu
international journal of industrial engineering computations pp 143-158; https://doi.org/10.5267/j.ijiec.2021.1.001

Abstract:
Production planners today must simultaneously face with the time and quality demands of various goods externally and meet limited capacity internally. This study presents a two-stage delayed- differentiation multiproduct model that considers the outsourcing options for common parts, overtime strategy for end products, and quality reassurance to assist in making fabrication runtime decisions that are cost-effective. Stage one produces all necessary common intermediate components for end products. To reduce stage one’s utilization/uptime, this study adopts a partial outsourcing option. Stage two uses an overtime strategy to fabricate end products that further shorten the uptime. The production processes in both phases are assumed to be imperfect. This study employs the reworking/scrapping of random faulty items to reassure product quality. The researchers build a model to depict the proposed problem’s characteristics and used the mathematical modeling, analysis, and optimization approach to determine the best rotation cycle length that minimizes the system’s expenses. Further, in this study, the researchers provide sensitivity analyses and a numerical illustration, which validate the result’s applicability and exhibit its capability. This result contributes to practical multiproduct-fabrication by (1) deriving the optimal manufacturing policy for a delayed-differentiation multiproduct system with dual uptime reduction policies and quality reassurance; and (2) offering a decisional model that allows production planners to explore the collective/separate effect of a quality-ensured and dual uptime reduction strategy on a problem’s operating policy and crucial system performance indicators, which assists in cost-effective decision-making.
Sandeep U. Mane, M. R. Narsingrao
international journal of industrial engineering computations pp 49-62; https://doi.org/10.5267/j.ijiec.2020.10.001

Abstract:
The Jaya algorithm is a recently developed novel population-based algorithm. The proposed work presents the modifications in the existing many-objective Jaya (MaOJaya) algorithm by integrating the chaotic sequence to improve the performance to optimize many-objective benchmark optimization problems. The MaOJaya algorithm has exploitation more dominating, due to which it traps in local optima. The proposed work aims to reduce these limitations by modifying the solution update equation of the MaOJaya algorithm. The purpose of the modification is to balance the exploration and exploitation, improve the divergence and avoid premature convergence. The well-known chaotic sequence - a logistic map integrated into the solution update equation. This modification keeps the MaOJaya algorithm simple as well as, preserves its parameterless feature. The other component of the existing MaOJaya algorithm, such as non-dominated sorting, reference vector and tournament selection scheme of NSGA-II is preserved. The decomposition approach used in the proposed approach simplifies the complex many-objective optimization problems. The performance of the proposed chaotic based many-objective Jaya (C-MaOJaya) algorithm is tested on DTLZ benchmark functions for three to ten objectives. The IGD and Hypervolume performance metrics evaluate the performance of the proposed C-MaOJaya algorithm. The statistical tests are used to compare the performance of the proposed C-MaOJaya algorithm with the MaOJaya algorithm and other algorithms from the literature. The C-MaOJaya algorithm improved the balance between exploration and exploitation and avoids premature convergence significantly. The comparison shows that the proposed C-MaOJaya algorithm is a promising approach to solve many-objective optimization problems.
Mohammadreza Nasiri Boroujeni, Yaser Samimi, Emad Roghanian
international journal of industrial engineering computations pp 37-48; https://doi.org/10.5267/j.ijiec.2020.10.002

Abstract:
Quality profiles representing the quality of a process or product as the functional relationship between one or more dependent variables and one or more explanatory variables are nowadays widely recognized in statistical process control (SPC) applications by both researchers and practitioners. On the other hand, in many real-world cases, evaluation of process or product characteristics is carried out with ambiguity or conducted using linguistic values. The theory of fuzzy sets provides an appropriate approach to deal with uncertainty due to ambiguity in human subjective evaluations or vagueness in linguistic variables. The purpose of this study is to introduce two novel methods based on fuzzy regression modeling for monitoring fuzzy linear profiles in phase II of SPC. To accomplish this, fuzzified Hoteling’s T2 statistic and fuzzy hypothesis testing are used. Moreover, a simulation study is used to compare the performance of the proposed methods compared with previous methods, based on the average run length (ARL) criterion in order to assess the detectability of charts with regard to the step shifts in profile parameters. Finally, the results of a real-world example in the tile and ceramic industry are presented.
Gabriela Chavarro, Matthaus Fresen, Esneyder Rafael González, David Barrera Ferro, Héctor López-Ospina
international journal of industrial engineering computations pp 131-142; https://doi.org/10.5267/j.ijiec.2020.7.001

Abstract:
In this paper, we consider a two-echelon supply chain in which one warehouse provides a single product to N retailers, using integer-ratio policies. Deterministic version of the problem has been widely studied. However, this assumption can lead to inaccurate and ineffective decisions. In this research, we tackle the stochastic version of two-echelon inventory system by designing an extension of a well-known heuristic. This research considers customer demands as following a normal density function. A set of 240 random instances was generated and used in evaluating both the deterministic and stochastic solution approaches. Due to the nature of the objective function, evaluation was carried out via Monte Carlo simulation. For variable demand settings, computational experiments shows that: i) the use of average demand to define the inventory policy implies an underestimation of the total cost and ii) the newly proposed method offers cost savings.
Imma Ribas, Ramon Companys
international journal of industrial engineering computations, Volume 12, pp 321-328; https://doi.org/10.5267/j.ijiec.2021.1.004

Abstract:
This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and with sequence-dependent setup times in order to minimize the maximum completion time of jobs. The blocking constraint normally leads to an increase in the maximum completion time of jobs due to the blockage of machines, which can increase even more so when setup times are considerable. Hence, the heuristic to solve this problem must take into account these specificities in order to minimize the timeout of machines. Because the procedures designed to solve the parallel flow shop scheduling problem must deal not only with the sequencing of jobs but also with their allocation to the flow shops, 36 heuristics have been tested in this paper, of which 35 combine sequencing rules with allocation methods while the last one takes a different approach that is more related to the nature of this problem. The computational evaluation of the implemented heuristics showed good performance of the heuristic designed especially for the problem (RCP0) when the setup times are considerable. Furthermore, the evaluation has also allowed us to propose a combined heuristic that leads to good solutions in a short CPU time.
Ümit Yıldırım, Yusuf Kuvvetli
international journal of industrial engineering computations, Volume 12, pp 441-456; https://doi.org/10.5267/j.ijiec.2021.4.002

Abstract:
The vehicle routing problem is widespread in terms of optimization, which is known as being NP-Hard. In this study, the vehicle routing problem with capacity constraints is solved using cost- and time-efficient metaheuristic methods: an invasive weed optimization algorithm, genetic algorithm, savings algorithm, and hybridized variants. These algorithms are tested using known problem sets in the literature. Twenty-four instances evaluate the performance of algorithms from P and five instances from the CMT data set group. The invasive weed algorithm and its hybrid variant with savings and genetic algorithms are used to determine the best methodology regarding time and cost values. The proposed hybrid approach has found optimal P group problem instances with a 2% difference from the best-known solution on average. Similarly, the CMT group problem is solved with about a 10% difference from the best-known solution on average. That the proposed hybrid solutions have a standard deviation of less than 2% on average from BKS indicates that these approaches are consistent.
Yuan-Shyi Peter Chiu, Tiffany Chiu, Fan-Yun Pai, Hua Yao Wu
international journal of industrial engineering computations, Volume 12, pp 427-440; https://doi.org/10.5267/j.ijiec.2021.5.001

Abstract:
Transnational producers facing the present-day competitive global supply-chain environments need to pursue the most appropriate manufacturing scheme, quality screening task, and stock shipping plan to satisfy customer’s timely multi-item requirements under minimum overall product fabrication-delivery expenses. This study develops a producer-retailer incorporated multi-item two-stage economic production quantity- (EPQ-) based system with delayed differentiation, expedited-rate for common parts, multiple deliveries plan, and random scrap. It aims to assist current manufacturing firms in achieving the aforementioned operating goals. Mathematical methods help us build an analytical model to explicitly portray the studied problem’s features and derive its overall system expenses. Hessian matrix equations and optimization approaches help us prove convexity and derive the cost-minimized fabrication- delivery decision. This study gives a simulated example to illustrate the research outcome’s applicability and the proposed model’s capabilities numerically. Consequently, diverse crucial information becomes obtainable to the manufacturers to facilitate various operating decision makings as follows: (i) the cost-minimized fabrication-delivery policy; (ii) the behavior of system’s overall expenses and operating policy regarding mean scrap rate, and different relationships between common part’s values and completion-rate; (iii) the system’s detailed cost components; (iv) the system’s overall expenses, utilization, and common part’s uptime concerning different common part’s expedited rates; and (v) the collective effects of critical system features on the overall expenses, uptime, and optimal cycle length, etc.
Siwaporn Suksee, Sombat Sindhuchao
international journal of industrial engineering computations, Volume 12, pp 305-320; https://doi.org/10.5267/j.ijiec.2021.2.001

Abstract:
This research proposes a heuristic to solve the problem of the location selection of incinerators and the vehicle routing of infectious waste collection for hospitals in the Northeast of Thailand. The developed heuristic is called the Greedy Randomized Adaptive Large Neighborhood Search Procedure (GRALNSP)and applies the principles of the Greedy Randomized Adaptive Search Procedure (GRASP) and Adaptive Large Neighborhood Search (ALNS) in the local search. The results from GRALNSP are compared with those from the exact method processed by the A Mathematical Programming Language (AMPL) program. For small-sized problems, experiments showed that both methods provided no different results with the global optimal solution, but GRALNSP required less computational time. When the problems were larger-scale and more complicated, AMPL could not find the optimal solution within the limited period of computational time while GRALNSP provided better results with much less computational time. In solving the case study with GRALNSP, the result shows that the suitable locations for opening infectious waste incinerators are the locations of Pathum Ratwongsa district, Amnat Charoen province and Nam Phong district, Khonkaen province. An incinerator with a burning capacity of 600 kilogram/hour is used at both locations. The monthly total distances for infectious waste collection are 24,055.24 and 38,401.88 kilometers, respectively, and the lowest total cost is 6,268,970.40 baht per month.
Back to Top Top