International Journal of Industrial Engineering & Production Research

  The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic method to solve the problem in sequence dependent case. Furthermore, a genetic algorithm has been developed which applies this constructive heuristic to generate initial population. These two proposed solution methods are compared on randomly generated problems. Computational results show a clear superiority of our proposed GA for majority of the test problems.

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the optimization property of tabu search and the local search capability of k-means algorithm together. The contribution of proposed algorithm is to produce tabu space for escaping from the trap of local optima and finding better solutions effectively. The Tabu-KM algorithm is tested on several simulated and standard datasets and its performance is compared with k-means, simulated annealing, tabu search, genetic algorithm, and ant colony optimization algorithms. The experimental results on simulated and standard test problems denote the robustness and efficiency of the algorithm and confirm that the proposed method is a suitable choice for solving data clustering problems.

  This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic algorithms are designed for the problem based on Tabu search mechanism. Extensive numerical experiments were conducted to observe and compare the behavior of the algorithms in solving the problem..

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapted genetic algorithm based on bypass consideration to solve the problem. The basic parameters of this meta-heuristic are briefly discussed in this paper. Also a computational experiment is conducted to evaluate the performance of the implemented methods. The implemented algorithm can be used to solve large scale flow shop scheduling problem with bypass effectively .

  In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are reflected. Defining visibility function based on both current and future disruptions is one of our contributions in ACO which aims to recover current disruptions in a way that cause less consequent disruptions. Using a real data set, the computational results indicate that the ACO can be successfully used to solve the airline recovery problem .

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optimal solutions in a reasonable run time. The algorithm utilizes from a local search heuristic for improving the chance of obtaining more number of global Pareto-optimal solutions. The solution method uses from a perturbed global criterion function for guiding the search direction of the hybrid algorithm. Computational experiences show that the hybrid algorithm has superior performance in contrast to previous studies .

  Managing products’ end-of-life and recovery of used products is gaining significant importance during last years. Therefore, managing the reverse flow of products can be an important potential for winning consumers in future competitive markets. In this context, establishing reverse logistics networks is becoming a main problem in reverse supply chains. Genetic Algorithm (GA) is utilized to solve the proposed NP-hard problem and find the best possible design for different facilities. In order to test the applicability of proposed GA, we suppose a tire reverse logistic case and solve the problem. The results show that the least cost will be achieved by using the free space of distribution centers and integrating collection and inspection centers within them. In addition, we suggest using hybrid algorithm in future allocation problems to obtain best solutions .

  The unprecedented growth of competition in the banking technology has raised the importance of retaining current customers and acquires new customers so that is important analyzing Customer behavior, which is base on bank databases. Analyzing bank databases for analyzing customer behavior is difficult since bank databases are multi-dimensional, comprised of monthly account records and daily transaction records. Few works have focused on analyzing of bank databases from the viewpoint of customer behavioral analyze. This study presents a new two-stage frame-work of customer behavior analysis that integrated a K-means algorithm and Apriori association rule inducer. The K-means algorithm was used to identify groups of customers based on recency, frequency, monetary behavioral scoring predicators it also divides customers into three major profitable groups of customers. Apriori association rule inducer was used to characterize the groups of customers by creating customer profiles. Identifying customers by a customer behavior analysis model is helpful characteristics of customer and facilitates marketing strategy development .

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, two hybrid efficient and effective metaheuristic algorithms are developed. The simulated annealing and ant colony optimization algorithms are combined with the local search methods. To evaluate the proposed algorithms, the standard problems with different sizes are used. The algorithms parameters are tuned by design of experiments approach and the most appropriate values for the parameters are adjusted. The performance of the proposed algorithms is analyzed by quality of solution and CPU time measures. The results show high efficiency and effectiveness of the proposed algorithms .

  This paper aimed at estimation of the per capita consumption of electricity in residential sector based on economic indicators in Iran. The Genetic Algorithm Electricity Demand Model (GAEDM) was developed based on the past data using the genetic algorithm approach (GAA). The economic indicators used during the model development include: gross domestic product (GDP) in terms of per capita and real price of electricity and natural gas in residential sector. Three forms of GAEDM were developed to estimate the electricity demand. The developed models were validated with actual data, and the best estimated model was selected on base of evaluation criteria. The results showed that the exponential form had more precision to estimate the electricity demand than two other models. Finally, the future estimation of electricity demand was projected between 2009 and 2025 by three forms of the equations linear, quadratic and exponential under different scenarios .