JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL
Year:2012 | Volume:8 | Issue:8|Papers Count:10

This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should be serviced earlier than others. This problem is modeled using vehicle routing and scheduling problem where trains representing the customers are supposed to be serviced in pre-specified hard/soft fuzzy time windows.A two-phase approach is used which, in the first phase, the multi-depot locomotive assignment is converted to a set of single depot problems, and after that, each single depot problem is solved heuristically by a hybrid genetic algorithm. In the genetic algorithm, various heuristics and efficient operators are used in the evolutionary search. The suggested algorithm is applied to solve the medium sized numerical example to check capabilities of the model and algorithm. Moreover, some of the results are compared with those solutions produced by branch-and-bound technique to determine validity and quality of the model. Results show that suggested approach is rather effective in respect of quality and time.

Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assembled at each terminal. RBP is an NP-hard combinatorial optimization problem with billions of decision variables. To solve the real-life RBP, developing a metaheuristic algorithm is necessary. In this paper, for the first time, a new genetic algorithm-based solution method, which is a population-based algorithm, is proposed to solve the RBP. To evaluate the efficiency and the quality of solutions of the proposed algorithm, several simulated test problems are used. The quality and computational time of the generated solutions for the test problems with the proposed genetic algorithm are compared with the solutions of the CPLEX software. The results show high efficiency and effectiveness of the proposed algorithm.

In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activities. In the mentioned approach, an ant algorithm determines the execution mode of each activity so that resource leveling index and project time become optimum. In the model, some visibility functions (defined in accordance with problem characteristics) are utilized, and the best, which return the best result, is selected for the model.

A major competitive advantage of production and service systems is establishing a proper maintenance policy. Therefore, maintenance managers should make maintenance decisions that best fit their systems. Multi-criterion decision-making methods can take into account a number of aspects associated with the competitiveness factors of a system. This paper presents a multi-criterion decision-aided maintenance model with three criteria that have more influence on decision making: reliability, maintenance cost, and maintenance downtime. The Bayesian approach has been applied to confront maintenance failure data shortage. Therefore, the model seeks to make the best compromise between these three criteria and establish replacement intervals using Preference Ranking Organization Method for Enrichment Evaluation (PROMETHEE II), integrating the Bayesian approach with regard to the preference of the decision maker to the problem. Finally, using a numerical application, the model has been illustrated, and for a visual realization and an illustrative sensitivity analysis, PROMETHEE GAIA (the visual interactive module) has been used. Use of PROMETHEE II and PROMETHEE GAIA has been made with Decision Lab software. A sensitivity analysis has been made to verify the robustness of certain parameters of the model.

Supply chain is an accepted way of remaining in the competition in today's rapidly changing market. This paper presents a coordinated seller-buyer supply chain model in two stages, which is called Joint Economic Lot Sizing (JELS) in literature. The delivery activities in the supply chain consist of a single raw material. We assume that the delivery lead time is stochastic and follows an exponential distribution. Also, the shortage during the lead time is permitted and completely back-ordered for the buyer. With these assumptions, the annual cost function of JELS is minimized. At the end, a numerical example is presented to show that the integrated approach considerably improves the costs in comparison with the independent decisions by seller and buyer.

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optimization as meta-heuristic methods for the QAP. This research is dedicated to compare the relative percentage deviation of these solution qualities from the best known solution which is introduced in QAPLIB. Furthermore, a tuning method is applied for meta-heuristic parameters. Results indicate that TS is the best in 31% of QAPs, and the IFLS method, which is in the literature, is the best in 58 % of QAPs; these two methods are the same in 11% of test problems. Also, TS has a better computational time among heuristic and meta-heuristic methods.

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm called sweep algorithm (SW) +ant colony system (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW, and at the second stage, the ACS and 3-opt local search are used for improving the solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach.

In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision makers are respectively defined by determining individual optimal solutions of each of the level decision makers. A possible relaxation of the higher level decision is considered for avoiding decision deadlock due to the conflicting nature of objective functions. Then, fuzzy goal programming approach is used for achieving the highest degree of each of the membership goal by minimizing negative deviational variables. We also provide sensitivity analysis with variation of tolerance values on decision vectors to show how the solution is sensitive to the change of tolerance values with the help of a numerical example.

Unlike commonly used methods, in this paper, we have introduced a new approach for designing fuzzy controllers. In this approach, we have simultaneously optimized both objective functions of a supply chain over a two-dimensional space. Then, we have obtained a spectrum of optimized points, each of which represents a set of optimal parameters which can be chosen by the manager according to the importance of objective functions. Our used supply chain model is a member of inventory and order-based production control system family, a generalization of the periodic review which is termed ‘Order-Up-To policy’. An auto rule maker, based on non-dominated sorting genetic algorithm-II, has been applied to the experimental initial fuzzy rules. According to performance measurement, our results indicate the efficiency of the proposed approach.

The smooth running of small and medium-sized manufacturing enterprises (SMEs) presents a significant challenge irrespective of the technological and human resources they may have at their disposal. SMEs continuously encounter daily internal and external undesirable events and unwanted setbacks to their operations that detract from their business performance. These are referred to as ‘disturbances’ in our research study. Among the disturbances, some are likely to create risks to the enterprises in terms of loss of production, manufacturing capability, human resource, market share, and, of course, economic losses. These are finally referred to as ‘risk determinant’ on the basis of their correlation with some risk indicators, which are linked to operational, occupational, and economic risks. To deal with these risk determinants effectively, SMEs need a systematic method of approach to identify and treat their potential effects along with an appropriate set of tools. However, initially, a strategic approach is required to identify typical risk determinants and their linkage with potential business risks. In this connection, we conducted this study to explore the answer to the research question: what are the typical risk determinants encountered by SMEs? We carried out an empirical investigation with a multi-method research approach (a combination of a questionnaire-based mail survey involving 212 SMEs and five in-depth case studies) in New Zealand. This paper presents a set of typical internal and external risk determinants, which need special attention to be dealt with to minimize operational risks of an SME.