This paper provides a review on recent works in the field of competitive facility location models based on the following seven components: 1) Variables, 2) Competition type, 3) Solution space, 4) Customer behavior, 5) Demand type, 6) Number of new facilities and 7) Relocation and redesign possibility. First, the components are introduced and then based on these components; different studies are compared with each other via a proposed taxonomy and finally a review on work of each paper is provided.
A simple yet powerful optimization algorithm is proposed in this paper for solving the constrained and unconstrained optimization problems. This algorithm is based on the concept that the solution obtained for a given problem should move towards the best solution and should avoid the worst solution. This algorithm requires only the common control parameters and does not require any algorithm-specific control parameters. The performance of the proposed algorithm is investigated by implementing it on 24 constrained benchmark functions having different characteristics given in Congress on Evolutionary Computation (CEC 2006) and the performance is compared with that of other well-known optimization algorithms. The results have proved the better effectiveness of the proposed algorithm. Furthermore, the statistical analysis of the experimental work has been carried out by conducting the Friedman’s rank test and Holm-Sidak test. The proposed algorithm is found to secure first rank for the ‘best’ and ‘mean’ solutions in the Friedman’s rank test for all the 24 constrained benchmark problems. In addition to solving the constrained benchmark problems, the algorithm is also investigated on 30 unconstrained benchmark problems taken from the literature and the performance of the algorithm is found better.
This paper presents a multiobjective ant colony algorithm for the Multi-Depot Vehicle Routing Problem with Backhauls (MDVRPB) where three objectives of traveled distance, traveling times and total consumption of energy are minimized. An ant colony algorithm is proposed to solve the MDVRPB. The solution scheme allows one to find a set of ordered solutions in Pareto fronts by considering the concept of dominance. The effectiveness of the proposed approach is examined by considering a set of instances adapted from the literature. The computational results show high quality results within short computing times.
Successful flow-shop scheduling outlines a more rapid and efficient process of order fulfilment in warehouse activities. Indeed the way and the speed of order processing and, in particular, the operations concerning materials handling between the upper stocking area and a lower forward picking one must be optimized. The two activities, drops and pickings, have considerable impact on important performance parameters for Supply Chain wholesaler companies. In this paper, a new flow shop scheduling algorithm is formulated in order to process a greater number of orders by replacing the FIFO logic for the drops activities of a wholesaler company on a daily basis. The System Dynamics modelling and simulation have been used to simulate the actual scenario and the output solutions. Finally, a t-Student test validates the modelled algorithm, granting that it can be used for all wholesalers based on drop and picking activities.
In most of the published articles dealing with optimal order quantity model under permissible delay in payments, it is assumed that the supplier only put forwards fully permissible delay in payments if retailer ordered a bulky sufficient quantity otherwise permissible delay in payments would not be permitted. Practically, in competitive market environments and recession phases of business, every supplier wants to attract more retailers by the help of providing good facilities for trading. Necessity of order quantity may put a negative pressure on supplier’s demand. So, within the economic order quantity (EOQ) framework the main purpose of this paper is to broaden this extreme case by introducing a new credit policy, Flexible Trade Credit Policy (FTCP), for supplier which can help him provide more free space of trading to retailers. This policy, after adopting by suppliers, not only provides attractive trading environments for retailers but also enhances the demand of supplier due to the large number of new retailers. Here in, under this policy, an inventory system is investigated as a cost minimization problem to establish the retailer’s optimal inventory cycle time and optimal order quantity. Three theorems are established to describe and to lighten optimal replenishment policies for the retailer. Finally, numerical examples are considered to illustrate all these theorems and managerial insights are given based on considered numerical examples.
Cell load variation is considered a significant shortcoming in scheduling of cellular manufacturing systems. In this article, a new method is proposed for scheduling dynamic cellular manufacturing systems in the presence of bottleneck and parallel machines. The aim of this method is to control cell load variation during the process of determining the best trading off values between in-house manufacturing and outsourcing. A genetic algorithm (GA) is developed because of the high potential of trapping in the local optima, and results are compared with the results of LINGO® 12.0 software. The Taguchi method (an L_9 orthogonal optimization) is used to estimate parameters of GA in order to solve experiments derived from literature. An in-depth analysis is conducted on the results in consideration of various factors, and control charts are used on machine-load variation. Our findings indicate that the dynamic condition of product demands affects the routing of product parts and may induce machine-load variations that yield to cell-load diversity. An increase in product uncertainty level causes the loading level of each cell to vary, which in turn results in the development of “complex dummy sub-cells”. The effect of the complex sub-cells is measured using another mathematical index. The results showed that the proposed GA can provide solutions with limited cell-load variations.
Nickel based super alloys are excellent for several applications and mainly in structural components submitted to high temperatures owing to their high strength to weight ratio, good corrosion resistance and metallurgical stability such as in cases of jet engine and gas turbine components. The current work presents the experimental investigations of the cutting parameters effects (cutting speed, depth of cut and feed rate) on the surface roughness, cutting force components, productivity and power consumption during dry conditions in straight turning using coated carbide tool. The mathematical models for output parameters have been developed using Box-Behnken design with 15 runs and Box-Cox transformation was used for improving normality. The results of the analysis have shown that the surface finish was statistically sensitive to the feed rate and cutting speed with the contribution of 43.58% and 23.85% respectively, while depth of cut had the greatest effect on the evolution of cutting force components with the contribution of 79.87% for feed force, 66.92% for radial force and 66.26% for tangential force. Multi-objective optimization procedure allowed minimizing roughness Ra, cutting forces and power consumption and maximizing material removal rate using desirability approach.
This paper presents an experimental study on rough cut, trim cut using distilled water as a dielectric fluid and Al & Si metal powders in dielectric fluid for WEDM of Nimonic-90. First, the influence of discharge energy (DE) in rough cut is evaluated for machining rate (MR) and surface roughness (SR) and compared with trim cut without any metal powder additives in dielectric fluid. The effect of Al and Si metal powders (varying concentration of 1g/L, 2g/L and 3g/L) in dielectric fluid is studied separately and comparison is also made for MR, SR, recast layer and micro hardness of machined Nimonic-90. From the results it is observed that using trim cut, a fine and uniform surface texture is obtained irrespective of the high discharge energy of rough cut. Al and Si powders additives show a significant reduction in MR for trim cutting operation whereas a remarkable modification is obtained in surface textures after trim cut using metals powder mixed dielectric. SR improves with a concentration of 1g/L and shows a little increase with high concentration of both metals powder. Using metals powder in dielectric fluid, the recast layer becomes smooth and denser and thus, micro hardness increases.
Job selection and scheduling are among the most important decisions for production planning in today’s manufacturing systems. However, the studies that take into account both problems together are scarce. Given that such problems are strongly NP-hard, this paper presents an approach based on two heuristic algorithms for simultaneous job selection and scheduling. The objective is to select a subset of jobs and schedule them in such a way that the total net profit is maximized. The cost components considered include jobs & apos; processing costs and weighted earliness/tardiness penalties. Two heuristic algorithms; namely scatter search (SS) and simulated annealing (SA), were employed to solve the problem for single machine environments. The algorithms were applied to several examples of different sizes with sequence-dependent setup times. Computational results were compared in terms of quality of solutions and convergence speed. Both algorithms were found to be efficient in solving the problem. While SS could provide solutions with slightly higher quality for large size problems, SA could achieve solutions in a more reasonable computational time.
This paper addresses the scheduling problem in a Permutation Flow Shop (PFS) environment, which is associated with many types of industries such as chemical, petrochemical, automobile manufacturing, metallurgical, textile, etc. Thus, this work intends to solve a PFS scheduling problem in order to minimize the total weighted tardiness, since it is an important sequencing criterion not only for on time delivery jobs but also for customer satisfaction. To solve the problem, GRASP (Greedy Randomized Adaptive Search Procedure) metaheuristic is proposed as a solution, which has shown competitive results compared with other combinatorial problems. In addition, two utility functions called Weighted Modified Due Date (WMDD) and Apparent Tardiness Cost (ATC) are proposed to develop GRASP. These are based on dynamic dispatching rules and also known for solving the problem of total weighted tardiness for single machine scheduling problem. Next, an experimental design was carried out for comparing the GRASP performance with both utility functions and against the WEDD dispatching rule results. The results indicate that GRASP-WMDD could improve the total weighted tardiness in 47.8% compared with WEDD results. Finally, the GRASP-WMDD performance for the PFS total tardiness problem was evaluated, obtaining a relative deviation index of 13.89% and ranking the method over 26 heuristics and metaheuristics.