Skip to main content

Vertical transportation systems embedded on shuffled frog leaping algorithm for manufacturing optimisation problems in industries

Abstract

Response surface methods via the first or second order models are important in manufacturing processes. This study, however, proposes different structured mechanisms of the vertical transportation systems or VTS embedded on a shuffled frog leaping-based approach. There are three VTS scenarios, a motion reaching a normal operating velocity, and both reaching and not reaching transitional motion. These variants were performed to simultaneously inspect multiple responses affected by machining parameters in multi-pass turning processes. The numerical results of two machining optimisation problems demonstrated the high performance measures of the proposed methods, when compared to other optimisation algorithms for an actual deep cut design.

Background

As a result of continuous changes in business environment and uncertainty of demand and production processes, manufacturing industries are having to develop and evolve rapidly. Therefore, in the future, the production system should be flexible and able to respond to factor alterations quickly. The system should create high quality products, support small production volumes and meet all needs of customer specifications. Modern production systems consist of high-performance technology and equipment, which increase production capacity. However, at the same time, the system operations become more sophisticated and complex. Manufacturing processes involve inputs from various departments including management, production, finance, marketing, and engineering etc. Hence, the created production system should be able to allow relevant departments to influence the manufacturing operations conveniently and effectively. The production system should consist of the following three components of inputs including manpower, raw materials, machines, energy, money and information; processes including preparation of materials, assembly of all components into various shapes as well as packaging for distribution and outputs including products or outputs in the form of goods or services. Turning is a basic process that is commonly used in various industries. The operation involves rotating the work-piece while moving a cutting tool linearly toward the work-piece to improve the work-piece. Turning can cut or decrease the size of a work-piece by removing external surface with a cutting tool positioned vertically to its rotating axis. Types of turning methods include facing, straight turning, thread turning, boring, necking and parting. Lathe machines can be classified as manually controlled or automatically controlled.

Recently, some meta-heuristic methods can provide better solutions for various manufacturing optimisation problems. The objectives of multi-pass turning and single-pass operation optimisations are significantly different. Multi-pass turning operations finally finish the surface to achieve the desired condition. The single-pass operation intends to gain the highest possible material removal rate (MRR) under various machining performance measures. The minimum cost, maximum MRRs, longer tool life, a lower cutting force, and better surface roughness are affected by the actual combination of cutting parameters. Both objectives of minimising total production cost and minimising machining time are considered quite often in related mathematical models in literatures. There are various cutting constraints considered in machining operations. In turning operations, either single or multiple passes are used for a cutting process. For economic reasons, multiple pass turning is preferable over the single pass turning in almost industries. Machining models consist of some parameters such as machining time, metal removal rate, tool waste and tool life. Several researchers have investigated the optimisation of cutting parameters in turning operations with a variety of models. The machining parameters have been determined by various methods. They consist of conventional modes of deterministic, probabilistic or dynamic programming method (Ermer and Patel 1974). However, these traditional optimisation methods may not be robust due to various complications of multiple constraints and passes. Their solutions are not ideal for solving machining optimisation problems because they tend to obtain a local optimal solution. Thus, meta-heuristic algorithms and their hybridisations have developed for solving machining problems due to their power in searching for a global optimum.

The meta-heuristic optimisation algorithms proved that they seem to be better than the traditional methods in many applications. Several interesting researches based on machining optimisation problems have been reported in the past, many claiming improved algorithms performance. Yildiz and Ozturk (2006) developed the Taguchi method to determine the proper levels of controllable design variables. Two multi-pass turning problems were optimised by the genetic algorithm (GA) to get the new settings of design variables. The results found by the hybrid robust genetic algorithm (HRGA) were better than those of scatter search, GA and simulated annealing and hooke–jeeves pattern search (SA/HJPS) for turning operations. From some recent empirical and theoretical reports on collective behaviors based on a topological interaction, the GA can be applied to the swarm dynamics (Shang and Bouffanais 2014). Wang (2007) studied an ant colony optimisation method for determining the machining parameters in a multi-pass turning operation model. The ant colony method was better than other optimisation techniques developed by other researchers. Their conclusion showed that the optimal solution as found by Vijayakumar et al. (2003) was not valid. Vijayakumar and Kumudinidevi (2007) proposed a new optimisation technique based on the ant colony algorithm for solving multi-pass turning optimisation problems. Yıldız (Zarei et al. 2009) developed a hybrid method by combining an immune algorithm with a hill climbing local search algorithm for solving optimisation problem. The hybrid algorithm combined the exploration speed of the immune algorithm with the powerful ability to avoid being trapped in local minima of the hill climbing. The results demonstrated the proposed hybrid method significantly outperformed, when compared to other techniques in terms of solution quality and convergence rates. Two similar studies by Chen and Chen (2010) and Onwubolu and Kumalo (2001) compared the effectiveness of the GA with several solution algorithms in solving machining operating problems. By using the problem of Chen and Tsai (1996), they concluded that the GA was significantly better than a simulated annealing. Yildiz (Yildiz 2013d) conducted a study to compare three meta-heuristic algorithms of an artificial bee colony (ABC), a particle swarm optimisation (PSO), and a simulated annealing (SA) for optimising parameters on multi-pass milling processes.

Yildiz (2012) showed the superiority of the hybrid approach over many other techniques. They consisted of an artificial bee colony algorithm, a differential evolution algorithm, a hybrid particle swarm optimisation algorithm, a hybrid artificial immune-hill climbing algorithm, a hybrid Taguchi-harmony search algorithm, a hybrid robust genetic algorithm, a scatter search algorithm, a genetic algorithm and an improved simulated annealing algorithm. The performance was measured via a convergence speed or the required number of function evaluations. The hybrid of the differential evolution algorithm with a receptor editing property of an immune system (DERE) was more effective for optimising machining parameters, when compared to other approaches. This evidence has been claimed to be representative of the state-of-the-art in evolutionary optimisation literatures in machining optimisations. Yusup et al. (2012) used a GA to optimise process parameters on the largest machining operations of a multi-pass turning. In terms of machining performance, surface roughness was mostly studied with meta-heuristic algorithms. Hybrid evolutionary optimisation algorithms could solve the problem with a fast convergence and robustness for finding the global minimum at the same design points. Dep and Datta (2011) used an evolutionary multi-objective optimisation (EMO) with a suitable local search procedure to optimise the machining parameters in turning operations. These parameters were cutting speed, feed and depth of cut. The study concluded the EMO solutions were computationally faster than the original EMO results. Belloufi et al. (2012) proposed a new hybrid algorithm with genetic and sequential quadratic programming procedures for a resolution of cutting conditions. The resolution of a multi-pass turning optimisation case was to minimise the production cost under a set of machining constraints. The proposed hybrid algorithm was better than other techniques carried out by different researchers.

In a study by Rao and Kalyankar (2013) compared a teaching learning-based optimisation algorithm with various previously attempted algorithms such as a simulated annealing, a genetic algorithm, an ant colony algorithm, and a particle swarm optimisation. The teaching–learning-based optimisation algorithm was effective, when compared to other algorithms. Lu et al. (2013) presented a new approach to optimise the cutting pass sequences and machining parameters in turning operations with practical constraints. A hybrid solver was a hybrid of a genetic algorithm and a sequential quadratic programming technique. Belloufi et al. (2014) used a firefly algorithm (FA) and a hybrid of a genetic algorithm and a sequential quadratic programming (GA-SQP) for the machining parameters in a multi-pass turning operation model. Mellal and Williams (Mellal and Williams 2015) developed and compared the cuckoo optimisation algorithm (COA) with a wide range of optimisation algorithms. The COA required a lower number of function evaluations, improved the convergence rate, and showed its ability to handle different constraint forms. Chauhan et al. (2015) used Totally Disturbed Particle Swarm Optimisation (TDPSO) to optimise machining conditions during multi-pass turning operations with various constraints. They concluded that the TDPSO was efficient for dealing with cutting parameters optimisation in multi-pass turning operations. However, the complexity of machine parameter optimisation for economic machining problems still existed.

Recently, there have been a few researches reporting results of the application of the shuffled frog leaping algorithm (SFLA) to multi-objective manufacturing optimisation problems in industries. The original SFLA is easy to apply and has performed well on various engineering problems. Revisions are still possible to further explore its potential framework. In this new paper, variants of hybrid meta-heuristics algorithms based on the SFLA are introduced for determining the manufacturing optimisation problems. In order to improve the SFLA performance on complex optimisation problems, we apply various evolutionary elements, which are involved vertical transportation systems (VTS). Instead of applying the worst frog by its normal procedures as exemplars, mechanisms from a motion reaching a normal operating velocity, and both reaching and not reaching transitional motion can potentially be used as the exemplars to guide the frog with the better leaping direction. To further improve the search ability of the SFLA, variants of the frog leaping step size from the VTS are adjusted by performing the designed experiments. Effectiveness of all variants is shown by comparing the performance of a family of turning processes as reported in the literatures. The two machining problems deal with the design of single and multi-pass turning processes. The rest of the paper is organised as follows: next section discusses the “Vertical transportation system”. “Machining problems” section illustrates the details and mathematical models of the single and multi-pass processes. “Computational results and analyses” section explains “Shuffled frog leaping algorithm”. “Computational results and analyses” section provides the results and discussions including the related research of harmony and shuffled frog leaping algorithms on fundamental machining problems. Then, a summary, conclusions and further work are outlined in “Conclusion and future work” section.

Vertical transportation systems

For high buildings, an elevator or lift is highly important to efficiently move people or goods between floors of a building. During elevator operation there are various influential parameters such as constant acceleration, transitional acceleration, constant velocity, transitional deceleration, constant deceleration, and leveling. By law, at least one firefighting elevator with the capacity to stop at every floor is required in all buildings. Also the continuous moving period of a firefighting elevator between the lowest and the top floor must not exceed 1 min (Klote 1993). The appropriate movement of an elevator has pattern and order after using the maximum high speed as shown in Fig. 1. This pattern can be used to calculate traveling time. The move starts by a constant acceleration. Then, when the transitional acceleration is reduced toward zero, the elevator moves with a constant speed and zero acceleration. Next, another transitional move happens, when the acceleration is increased from zero to the last constant step until the elevator stops. Lastly, the floor of the elevator adjusts to the building floor, which is called leveling. From the pattern and order of an elevator, there are some important design parameters. v 1 is the velocity at the start of the transitional acceleration state. It is normally equal to 60 % of the maximum velocity v max , which compromises motion control and energy consumption for expected running time of an elevator. Based on elevator group control system, this level also improves traffic efficiency, reduces the chance of a long waiting time and the average time from when a passenger arrives at the hall until when the passenger boards an assigned car, and eases passenger frustration, especially during the morning up peak. It is simultaneously achieved via various criteria of performance, earth conscious, technology, intelligence and flexibility (Strakosch and Caporale 2010). Note that t 1 is constant acceleration time, t 2 is time to constant velocity, t 3 is time at the end of constant velocity to start transitional acceleration, t 4 is time to start of constant acceleration going down, t 5 is time to finish of constant acceleration, when velocity equals zero, and t h is time to leveling. An analysis of time and distance according to the movement of the elevator has three scenarios as follows. The first scenario is a motion reaching a normal operating velocity. The second and third cases are of motion reaching and not reaching transitional accelerations, respectively.

Fig. 1
figure 1

Pattern and order of an elevator movement

A calculation for the first scenario starts, when an elevator is stationary or speed is zero. The elevator then moves to increase speed with a constant acceleration (a) until reaching v 1 at t 1 in Fig. 1. The time spent (t 1) to this stage can be determined by the following equation (Eq. 1). This vertical move travels a distance of s 1 as shown in Eq. 2.

$$t_{1} = \frac{{v_{1} }}{a}$$
(1)
$$s_{1} = \frac{{v_{1}^{2} }}{2a}$$
(2)

For the transitional acceleration, the time spent (t 2 − t 1) is approximated by Eq. 3. The speed in this transitional period increases while the acceleration decreases to zero. A more accurate formula to calculate t 2 may be unnecessary because the transitional deceleration period is very short, when compared to the whole movement of an elevator. During this period, the lift moves a distance (s 2 − s 1) as shown in Eq. 4. For one trip, the time spent before adjusting to the last floor is approximated by Eq. 5 and s t is the distance for one trip. The total time spent (t T ) including a leveling adjustment period (t h ) is shown in Eq. 6. This adjustment time is normally 0.5 s.

$$t_{2} = \frac{{\left( {V_{max}^{2} - V_{1}^{2} } \right)}}{{2v_{1} a}} + t_{1}$$
(3)
$$S_{2} = \left( {\frac{1}{3a}} \right)\left( {\frac{{V_{max}^{3} }}{{V_{1} }} - V_{1}^{2} } \right) + S_{1}$$
(4)
$$t_{5} = 2t_{2} + \left( {\frac{{S_{T} - 2S_{2} }}{{V_{max} }}} \right)$$
(5)
$$t_{T} = t_{5} + t_{h}$$
(6)

In the following scenario shown in Fig. 2a, the elevator movement does not reach an ending point of transitional acceleration. The acceleration is not reduced to zero so there is no constant speed period. A calculation of t 1 and S 1 with a constant acceleration will be the same as the first case. The next period is a transitional acceleration period in which its speed does not reach a constant speed. The calculation follows Eq. 7. For an analysis of formula accuracy, the value of V 2 at t 2 in the second case should be similar to the first case. The period until the end of the transitional acceleration (t 2) is shown in Eq. 8. The total time (t T ) spent in one trip is as follows in Eq. 9.

Fig. 2
figure 2

An elevator movement not reaching an ending point of transitional acceleration (a) and a motion not reaching a transitional acceleration (b)

$$V_{2} = \left[ {V_{1}^{3} + 3aV_{1} \left( {\frac{{S_{T} }}{2} - S_{1} } \right)} \right]^{1/3}$$
(7)
$$t_{2} = \frac{{\left( {V_{2}^{2} - V_{1}^{2} } \right)}}{{2aV_{1} }} + t_{1}$$
(8)
$$t_{T} = 2t_{2} + t_{h}$$
(9)

In a scenario of a motion not reaching a transitional acceleration as shown in Fig. 2b, the elevator does not move at a constant velocity resulting in bumping as deceleration starts. In a high building, this motion should not be allowed in a high speed elevator. For travel between adjacent floors and stop, the calculation of travelling time for one trip is as Eq. 10.

$$t_{T} = 2\sqrt {\frac{{S_{T} }}{a} + t_{h} }$$
(10)

These three variants are embedded on a shuffled frog leaping algorithm (SFLA). The basic SFLA was originally introduced by Eusuff and Lansey (2003) for a pipe network expansion optimisation. The SFLA separated a population into several memeplexes and then improved each memeplex in an evolutionary process. Various modifications have been proposed by different researchers to overcome the weaknesses of basic SFLA. Zhu and Zhang (2014) improved the original SFLA by allowing all frogs to take part in a memetic evolution and adding the self-variation behavior to the frog. It aimed to determine component pick-and-place sequences of a gantry multi-head component surface mounting machine. Earlier Elbeltagi et al. (2007) developed a new search via an acceleration parameter into the formulation of the original SFLA to create a modified form of the algorithm for two benchmark test problems including two discrete optimisation project management problems. Zhang et al. (2012) modified the basic SFLA by adding the basic ideas of an artificial fish (AF) algorithm for a cognitive radio system (CRS). They found the hybrid method provided better global convergence and less possibility to get trapped in local optimum. Roy (2011) introduced a hybrid solution method involving modified shuffled frog leaping algorithm (MSFLA) with a genetic algorithm (GA). It aimed at solving an economic load dispatch problem of generating units with valve point effects. Jadidoleslam and Ebrahimi (2015) developed a modified shuffled frog leaping algorithm (MSFLA) to solve a reliability-constrained generation expansion planning (GEP) problem. The new frog leaping rule of MSFLA was associated with a new strategy for frog distribution into memeplexes. The benefits of an integer encoding, a mapping procedure and a penalty factor approach were implemented to increase the efficiency of the proposed method, which aimed to improve the local exploration and performance of SFLA. Bhattacharjee and Sarmah (2014) modified a discrete shuffled frog leaping algorithm (MDSFL) to solve knapsack problems. The proposed algorithm included two important operations of the local search of the particle swarm optimisation technique and the competitiveness mixing of information of the shuffled complex evolution technique.

Yammani (2011) focused on an optimisation of weighting factors to balance the cost and the loss factors. An aim was to help build up desired objectives with a maximum potential benefit by the SFLA. Niknam et al. (2011) proposed an efficient multi-objective modified shuffled frog leaping algorithm (MMSFLA) for solving the multi-objective distribution feeder reconfiguration (MDFR) problem. Sharma et al. (2015) introduced a modified version of a shuffled frog leaping algorithm. A geometric centroid mutation was used to enhance the convergence rate. The proposal was implemented on five benchmark and car side impact problems. Simulated results illustrated the efficacy of the proposal in terms of convergence speed and mean value. Luo and Chen (2014) proposed a novel hybrid shuffled frog leaping algorithm (HSFLA) for a vehicle routing problem with time windows (VRPTW) with two strategies of a modified improvement procedure and a new memeplex construction. This approach was estimated and compared with other state-of-the-art heuristics using Solomon and Cordeau VRPTW test sets and showed the proposed algorithm was very effective for handling VRPTW. Kumar and Kumar (2014) proposed a shuffled frog leaping algorithm for an optimal market bidding strategy problem. The proposed method enhanced the short comings of selecting operators and premature convergence of a genetic algorithm (GA) and a particle swarm optimisation methods. Li et al. (2012) proposed a hybrid shuffled frog leaping algorithm (HSFLA) with a designed crossover operator for solving the multi-objective flexible job shop scheduling problem. Guo et al. (2015) proposed an improved shuffled frog leaping algorithm (SFLA) for the combinatorial optimisation problem of an assembly sequence planning (ASP). Under a remote handling maintenance in radioactive environment the improved SFLA was compared with the SFLA, genetic algorithm, particle swarm optimisation, and adaptive mutation particle swarm optimisation in terms of efficiency and capability of locating the best global assembly sequence. From experimental results the proposed algorithm exhibited an outstanding performance in solving the ASP problem. The application of the proposed algorithm also increased the level of the ASP in a radioactive environment.

The SFLA starts its sequential procedures by creating virtual frogs, which represent solutions or chromosomes for the GA. An optimisation process begins to determine the fittest virtual frog or solution. Then each of m memeplexes improves an optimised value of the frog with the smallest value. Each memeplex consists of n frogs. Therefore, the total population of frogs (P) in the memeplexes is equal to m multiplied by n (P = m * n). For an allocation method, the solution (frog) having the best fitness is arranged according to descending fitness. This best solution is assigned to the first memeplex. At the same time, the solution having second best fitness (frog 2) is assigned to the second memeplex. This is repeated until the mth frog or solution with the worst fitness is allocated into the mth memeplex or last memeplex. The m + 1 frog is then assigned to the first memeplex and so on, until all the frogs are allocated. In each memeplex, the best and worst fitness solutions are determined and set as X b and X w , respectively. The solution having the best fitness in the global groups is defined as X g .

In an attempt to improve the worst fitness frog, total number of iterations of an evolution is determined. After these iterations, if the optimised value of the frog is still unimproved to reach the best frog (X g ), the worst frog is eliminated and replaced by a new frog. The calculations of the frog leaping step size of the ith frog or D i , changing in the ith frog position based on the best (X b ) and worst (X w ) frogs, and the new position of the worst frog (X w ), within the ranges of −D MIN and \(D_{MAX}\), are as follows in Eqs. 11 and 12, where Rand() is a random number in the range of [0, 1].

$$D_{i} = Rand() \times \left( {X_{b} - X_{w} } \right)$$
(11)
$$X_{w} = Current\,Position\,of\, X_{w} + D_{i}$$
(12)

In summary, there are eight SFLA optimisation procedures. For the first step, the parameters of the number of iterations in a memeplex and population of frogs are defined. The second is to generate an initial population of frogs using a randomisation. Steps 3 and 4 are to calculate the fitness value of each frog and arrange the frogs according to their descending fitness values. The fifth step, is an allocation of frogs into sub-groups or memeplexes based on the fourth step. The frog having the best fitness is assigned to the first memeplex. At the same time, the solution having the second best fitness is assigned to the second memeplex. This process is repeated until an allocation of all frogs is completed. Step 6 is to improve the frog with the worst fitness in each memeplex and test their fitness again. If the optimised value of the frog is still unimproved, the frog will be eliminated. A selection of the frog with the best fitness in each memeplex is done in the seventh step. A comparison is also made to determine the frog having best fitness in the population of the first iteration. Finally, the process is repeated according to the prescribed number of iterations. In the evolutionary process of the frog group, poor frogs affected by good frogs convert to be more robust to obtain more food. From a frog leaping rule (Step 6) an improvement process assists the algorithm search for better solutions. In fine-tuning of optimised solution vectors, the SFLA procedures can be useful in adjusting a convergence rate to an optimum. Therefore, new improvement processes of fine-tuning are of interest. The SFLA uses a selected position of the worst solution to be an improvement choice by randomly selecting an interval from the best to the worst solutions.

In the SFLA, all improvement generators of the worst solution cannot be changed during new generations. The weakness of the SFLA occurs, when it is at the high number of iterations. In some cases, it is impossible to provide a larger interval between the best and the worst solutions or to overcome getting stuck at the local optimum. Thus this brings the difficulty in finding the better value for the current worst solution. The range of the global best and best solutions may also decrease algorithm performances. This significantly increases the needed iterations without any improvement. To enhance algorithm performances, three variants from a vertical transportation system are merged to develop sequential procedures. A vertical transportation system is the movement to the required position with or against gravity acceleration by using machine power under required conditions. Nowadays, an elevator is necessary for every multilevel building. In the current highly competitive market, elevator designs in terms of speed, capacity requirements, safety, and reliability are key components for a construction company to increase its efficiency. Most elevator producers have software to memorise the frequency of usage. With this software, the elevator will be able to identify the building levels with the high frequency usage in each period during the day. When compared to meta-heuristic methods, the parking level is the best value in each time period. From this analogy, three cases of an analysis of time and distance according to the movement of an elevator are focused and integrated to a shuffle frog leaping algorithm.

Hybrid SFLA with type 1 motion (HSFLA1)

For either a type 1 motion or a motion not reaching a transitional acceleration, S 1 in Eq. 13 is the movement during a constant acceleration, which can be applied to an evolutionary process of the frog group. A new position based on this motion type of the worst solution or is given by Eq. 14 and the range of the global best (X g ) and the best solutions (X b ) is the constant velocity of an elevator movement (Fig. 3).

Fig. 3
figure 3

HSFLA1 and HSFLA2 flow chart

$$S_{1} = \frac{{V_{1}^{2} }}{2a}$$
(13)
$$New\,position\,X_{w} = Current\,position\,X_{w} + Rand() \times S_{1}$$
(14)

Hybrid SFLA with type 2 motion (HSFLA2)

A type 2 motion or a motion reaching a transitional acceleration is the movement in which an elevator does not reach an ending point of the transitional acceleration. A velocity V 2 and corresponding distance can be represented by Eqs. 15 and 16, respectively. A new position of the worst solution or X w is given by Eq. 17, where X g is the global best solution and X b is best solution at the current position (Fig. 3).

$$V_{2} = \left[ {V_{1}^{3} + 3aV_{1} \left( {\frac{{S_{T} }}{2} - S_{1} } \right)} \right]^{1/3}$$
(15)
$$S_{2} = \left( {\frac{1}{3a}} \right)\left( {\frac{{V_{max}^{3} }}{{V_{1} }} - V_{1}^{2} } \right) + S_{1}$$
(16)
$$New\,position\,X_{w} = Current\,position\,X_{w} + Rand() \times \left( {S_{2} + \left( {X_{b} - X_{g} } \right)} \right)$$
(17)

Hybrid SFLA with type 3 motion (HSFLA3)

A type 3 motion occurs, when there is a circumstance having more than one command to an elevator. An actual elevator will have many types of motion. The simulation of this movement will create the probability of selection either short or long run called Probability of Choosing Floor (PCF). PCF is a simulated probability for selecting a movement type of elevator. A PCF value is between a minimum probability (PCF min ) of 0.45 and a maximum probability (PCF max ) of 0.60. Probability P1 is a random number between 0 and 1. If PCF values less than P1, short run movement will be applied. If PCF values more than P1, new position will be generated by long run movement. Leveling is an adjusting position process for protecting offset of elevator and floor. A leveling process will be applied to the last step of each actual movement of the elevator. Under the maximal iteration (MaxIte), a PCF at the current iteration (CurIte) can be calculated from Eq. 18. The short run movement and the new position of X w will be calculated via Eqs. 19 and 20, respectively. The long run movement will be calculated via Eqs. 21 and 22. The new position of X w can be calculated in Eq. 23, where \(Rand \left( { - 1, 1} \right)\) is a continuous uniform random variable over (−1, 1). The flow chart of the HSFLA3 is shown in Fig. 4.

Fig. 4
figure 4

HSFLA3 flow chart

$$PCF = PCF_{min} + \frac{{\left( {PCF_{max} - PCF_{min} } \right) \times CurIte}}{MaxIte}$$
(18)
$$S_{1} = \frac{{V_{1}^{2} }}{2a}$$
(19)
$$New\,position\,X_{w} = Current\,position\,X_{w} + Rand\left( { - 1,1} \right) \times \left( {S_{1} } \right) + Leveling$$
(20)
$$S_{1} = \frac{{V_{1}^{2} }}{2a}$$
(21)
$$S_{2} = \left( {\frac{1}{3a}} \right)\left( {\frac{{V_{max}^{3} }}{{V_{1} }} - V_{1}^{2} } \right) + S_{1}$$
(22)
$$New\,position\,X_{w} = Current\,position\,X_{w} + Rand\left( { - 1,1} \right) \times \left( {S_{2} + \left( {X_{b} - X_{g} } \right)} \right) + Leveling$$
(23)

Machining problems

Multi-pass turning model: A

This original model was developed by Chen and Tsai. A main objective of this multi-pass turning model is to minimise a unit production cost (C U ). C U is the total cost of cutting \(\left( {C_{M} } \right)\), machine idle (C I ), tool replacement (C R ) and tool (C T ). The production rate is basically measured from the entire time required for producing products (T p ). It is a function of the metal removal rate (MRR) and the tool life (T) as shown in Eq. 24. Parameters of \(T_{s} , T_{c} , T_{i}\) and V are the tool set-up time, the tool change time, the time the tool is not cutting and the volume of the removed metal, respectively. In some operations, the parameters are set constants and T p is a function of MRR and T. The MRR can be expressed by an analytical derivation as the product of the cutting speed, feeding and cutting depth (Eq. 25). The tool life \(\left( T \right)\) is measured as the average time between the tool changes for tool sharpening. The relationship between the tool life and the parameters is defined by Taylor’s Formula (Eq. 26). All parameters of \(K_{T} , \alpha_{1} , \alpha_{2}\,and\,\alpha_{3}\) are always positive. The operation cost can be expressed as the cost per product (C p ). In the cost of the operation, two values connected with the cutting parameters (TT P ) are significant as shown in Eq. 27. Parameters of \(C_{t} , C_{I}\,and\,C_{o}\) are the tool cost, the labor cost and the overhead cost, respectively. In some operations, \(C_{t} , C_{I}\,and\,C_{o}\) are independent of the cutting parameters. For the cutting quality, the most important criterion for the assessment of the surface quality is roughness calculated according to Eq. 28. A specific tool-work piece combination provides the following parameters of \(x_{1} , x_{2} , x_{3}\,and\,k.\) (Fig. 5).

Fig. 5
figure 5

Multi-pass turning model: A

$$T_{p} = T_{s} + V\frac{{\left( {1 + T_{c} /T} \right)}}{MRR} + T_{i}$$
(24)
$$MRR = 1000vfa$$
(25)
$$T = K_{T} /\left( {v^{{\alpha_{1} }} f^{{\alpha_{2} }} a^{{\alpha_{3} }} } \right)$$
(26)
$$C_{P} = T_{P} \left( {\frac{{C_{t} }}{T} + C_{I} + C_{O} } \right)$$
(27)
$$R_{a} = kv^{{x_{1} }} f^{{x_{2} }} a^{{x_{3} }}$$
(28)

One of technical specifications and organisational considerations interest is a permissible range of minimum (min) and maximum (max) of cutting conditions for the cutting speed (v), feed rate (f) and depth of cut (a). Due to the limitations on the machine and cutting tool and to the safety of machining, cutting parameters are limited with bottom and top permissible limits as shown in Eq. 29 There are also some implied limitations issuing from the tool characteristics and the machine capacity. For the selected tool, the tool maker identifies the limitations of the cutting conditions. The limitation on the machine is the cutting power and the cutting force (Table 1). Similarly, the machining characteristics of the work piece material are determined by physical properties. With the mechanical efficiency of the machine \(\left( \eta \right)\), the consumption of the power \(\left( P \right)\) can be expressed as the function of the cutting force and cutting speed (Eq. 30) and \(F\) is given by Eq. 31. When Eq. 31 is introduced into Eq. 30 and \(k_{n} = \frac{{k_{F} }}{{\left( {6122.45\eta } \right)}}\), Eq. 32 is obtained. The limitations of the power and cutting force are shown as Eq. 33.

Table 1 Parameters and description in machining model A
$$v_{min} \le v \le v_{max} ,\quad f_{min} \le f \le f_{max} , \quad a_{min} \le a \le a_{max}$$
(29)
$$P = \frac{Fv}{6122.45\eta }$$
(30)
$$F = k_{F} f^{{\beta_{2} }} a^{{\beta_{3} }}$$
(31)
$$P = k_{n} f^{{\beta_{2} }} a^{{\beta_{3} }}$$
(32)
$$P_{{\left( {v,f,a} \right)}} \le P_{max}, \quad F_{{\left( {v,f,a} \right)}} \le F_{max}$$
(33)

Values of coefficients for A model are given later. By substituting these values, the mathematical model is derived as follows:

$$Z\left( {T_{P} , C_{P} ,R_{a} } \right) = 0.42e^{{\left( { - 0.22T_{P} } \right)}} + 0.36e^{{\left( { - 0.32C_{P} } \right)}} + 0.17e^{{\left( { - 0.26R_{a} } \right)}} + 0.05/\left( {1 + 1.22T_{P} C_{P} R_{a} } \right)$$
$$MinT_{P} = 0.12 + 231376\left( {1 + 0.26/T} \right)MRR + 0.04$$
$$MinC_{P} = \left( {13.55/T + 0.39} \right)TP$$
$$MinR_{a} = 0.0088v + 0.3232f + 0.3144a$$

Subject to:

$$T = 1575134.21\left( {v^{ - 1.7} f^{ - 1.55} a^{ - 1.22} } \right)$$
$$MRR = 1000vfa$$
$$70 \le v \le 90$$
$$0.1 \le f \le 2$$
$$0.1 \le a \le 5$$
$$0.000626\left( {vf^{1.18} a^{1.26} } \right) \le 5$$
$$1.38\left( {f^{1.18} a^{1.26} } \right) \le 230$$

Multi-pass turning model: B

In multi-pass turning operations defined by Chen and Tsai, the objective of Eq. 34 is to minimise unit production cost (C U ). The unit production cost includes the cutting cost (C M ), machine idle cost (C I ), tool replacement cost (C R ) and tool cost (C T ), respectively. The unit production cost (C U )is subject to various constraints, which are parameter bounds that cover depth of cut (Eq. 35), a cutting speed (Eq. 36) and a feed rate (Eq. 37), tool-life constraint (Eq. 38), a cutting force constraint (Eq. 39), a power constraint (Eq. 40), a stable cutting region constraint (Eq. 41), and a chip–tool interface temperature constraint (Eq. 42).

$$C_{U} = C_{M} + C_{I} + C_{R} + C_{T}$$
(34.a)

This can be expanded as Eq. 34.b.

$$C_{U} = k_{o} \left[ {\frac{\pi DL}{{1000V_{r} f_{r} }}\left( {\frac{{d_{t} - d_{s} }}{{d_{r} }}} \right) + \frac{\pi DL}{{1000V_{s} f_{s} }}} \right]\,+\,k_{o} \left[ {t_{c} + \left( {h_{1} L + h_{2} } \right)\left( {\frac{{d_{t} - d_{s} }}{{d_{r} }} + 1} \right)} \right] + k_{o} \frac{{t_{e} }}{{T_{P} }}\left[ {\frac{\pi DL}{{1000V_{r} f_{r} }}\left( {\frac{{d_{r} - d_{s} }}{{d_{r} }}} \right) + \frac{\pi DL}{{1000V_{s} f_{s} }}} \right] + \frac{{k_{t} }}{{T_{P} }}\left[ {\frac{\pi DL}{{1000V_{r} f_{r} }}\left( {\frac{{d_{r} - d_{s} }}{{d_{r} }}} \right) + \frac{\pi DL}{{1000V_{s} f_{s} }}} \right]$$
(34.b)
$$d_{rL} \le d_{r} \le d_{rU}$$
(35)
$$f_{rL} \le f_{r} \le f_{rU}$$
(36)
$$V_{rL} \le V_{r} \le V_{rU}$$
(37)
$$T_{L} \le T_{r} \le T_{U}$$
(38)
$$k_{I} f_{r}^{\mu } d_{r}^{v} \le F_{U}$$
(39)
$$\frac{{k_{I} f_{r}^{\mu } d_{r}^{v} V_{r} }}{6120\eta } \le P_{U}$$
(40)
$$V_{r}^{\lambda } f_{r} d_{r}^{v} \ge S_{c}$$
(41)
$$Q_{r} = k_{2} V_{r}^{\tau } f_{r}^{\phi } d_{r}^{\delta } \le Q_{U}$$
(42)

There are some surface finish machining constraints and parameter relationships. Surface finish machining constraints are depth of cut, feed rate, cutting speed, tool-life, cutting force, power, stable cutting region, chip-tool interface temperature and surface finish (Table 2). These are formulated in Eqs. (4355), which also include the parameters relationships.

Table 2 Parameters and description in machining model B
$$d_{sL} \le d_{s} \le d_{sU}$$
(43)
$$f_{sL} \le f_{s} \le f_{sU}$$
(44)
$$V_{sL} \le V_{s} \le V_{sU}$$
(45)
$$T_{L} \le T_{s} \le T_{U}$$
(46)
$$k_{I} f_{s}^{\mu } d_{s}^{v} \le F_{U}$$
(47)
$$P_{r} = \frac{{k_{I} f_{s}^{\mu } d_{s}^{v} V_{s} }}{6120\eta } \le P_{U}$$
(48)
$$V_{s}^{\lambda } f_{s} d_{s}^{v} \ge S_{c}$$
(49)
$$Q_{s} = k_{2} V_{s}^{r} f_{s}^{\phi } d_{s}^{\delta } \le Q_{U}$$
(50)
$$\frac{{f_{s}^{2} }}{{8R_{n} }} < SR_{u}$$
(51)
$$V_{s} \ge k_{3} V_{r}$$
(52)
$$f_{v} \ge k_{4} f_{s}$$
(53)
$$d_{r} \ge k_{5} d_{s}$$
(54)
$$d_{r} = \frac{{d_{t} - d_{s} }}{n}$$
(55)

In addition to these constraints, the total depth of cut is another important constraint for this model. The total depth of cut (d t ) is the sum of the depth of the finished cut (d s ) and the depth of the rough cut (nd r ). The optimisation algorithm does not determine the optimal depth of roughing since it can be given by the mathematical manipulation as expressed Therefore, one can eliminate the equality constraint and the decision variable (d r ) in the optimisation procedure:

$$d_{s} = d_{t} - nd_{r}$$

The five machining parameters \((V_{r} , f_{r} , d_{s} , V_{s} , f_{s} )\) are determined for turning model optimisation. Further details about the turning mathematical model and data with respect to machining can be obtained from Shin and Joo (1992).

Computational results and analyses

A preliminary study used two engineering optimisation problems of single pass turning and multi-pass turning to evaluate selected approaches of original harmony search (HSA) and shuffled frog leaping (SFLA) algorithms. The first model (S) was developed for single pass turning of a medium carbon steel work piece using a carbide tool (Khan et al. 1997). The objective of this model was to minimise the production cost in dollars per piece. The problem was to evaluate the performance of various new methods and defined as follows

$${\text{min }}Cost = 452V^{ - 1} + f^{ - 1} + 10^{ - 5} V^{2.33} f^{0.4}$$

Subject to the constraints:

  1. 1.

    Constraint due to cutting power (P c ): \(P_{c} \le 5.5\); where, P c  = 10.6 × 10−2 Vf 0.83.

  2. 2.

    Constraint due to surface finish (R a ): \(SF \le 2\,\upmu {\text{m}}\); where, SF = 2.2 × 104 V −1.52 f

  3. 3.

    The range of feed rate and cutting speed were taken as: 0 ≤ V ≤ 500 and 0.0 ≤ f ≤ 0.5

The second model (M), was formulated for multi-pass turning operation of a medium carbon tool. The objective was to minimise the production cost in yen per piece. Parameters of n and di are the number of passes and the depth of cut, respectively. The total depth (A) of the material is the sum of depths of n cuts, so \(A = \sum\nolimits_{i = 1}^{n} {d_{i} }\). The problem was defined as follows:

Subject to the constraints:

  1. 1.

    Constraint due to cutting force (F c ): \(F_{c} \le 170 \,{\text{kg}}\); where, F c  = 290.73 V −0.1013 f 0.725 d

  2. 2.

    Constraint due to stable cutting surface; fV 2 ≥ 2230.5

  3. 3.

    Constraint due to surface roughness (H max ): 0.356f 2 ≤ H max

  4. 4.

    Constraint due to power consumption (P c ): \(P_{c} = 7.5 \,{\rm kw}\); where, \(P_{c} = \frac{{F_{c} V}}{4896}\)

  5. 5.

    The allowable ranges for these variables:

$$0 \le d \le A, 14.13 \le V \le 1005.3\, {\text{m/min}}, 0.001 \le f \le 5.6\, {\text{mm/rev}}$$

The HSA parameters of HMS, probability of HMCR and probability of \(PAR\) were set at 30, 0.90 and 0.35, respectively. The parameter values for SFLA on well know response functions were performed on factorial experiments are shown in Fig. 6. The preferable levels of [number of frogs (P), number of memeplexes (M), Iterations] were [100, 25, and 80]. The vertical transportation system parameters were set as: acceleration (a) = 1, maximal velocity (V max ) = 0.8 and leveling = 0.005. These algorithms were executed with 6000 iterative searches (MaxIte). There were twenty replications in each problem. The performance of both algorithms was compared using the mean and standard deviation (STDEV) of actual process yields including the processing time to reach the optimum at the maximal preset of iterations. On the S model, the HSA seemed to be better in terms of both process yield and processing time. In the M problem, the SFLA found the better solution. In addition, the speed of convergence of the SFLA was superior in both problems (Table 3).

Table 3 Comparison of performance measures in a preliminary study
Fig. 6
figure 6

Main effect plot of the well-know Branin response function

Although the shuffle frog leaping algorithm has been used for several optimisation applications, it has not yet been reported in the literature for optimisation of machining parameters in turning operations. In this study, the proposed variants of a vertical transportation system on the SFLA were applied to machining Operation optimisation problems. On the multi-pass turning models, an important task was to find optimal cutting conditions. The turning values of coefficients were statistically determined on the basis of the data measured experimentally via tool life, roughness, manufacturing time and cutting force. Values of coefficients for the model A and B are given in Tables 4 and 5.

Table 4 Values of coefficients for the model A
Table 5 Values of coefficients for the model B

The proposed algorithms based on vertical transportation systems were programmed in a Visual C# 2008 on a Laptop ASUS A45V Series. A comparison of the conventional procedures of SFLA and three hybridisations results were presented in this section. For all meta-heuristics, their influential parameters affected algorithm performance measures such as solution quality and computational time. On the tested manufacturing problems, the experiments were run and analysed to achieve the most preferable parameter settings based on the initial levels from previous literatures. For all optimisation problems presented in this paper, parameter values for the SFLA were taken from other research, and those for evolutionary elements parameters in vertical transportation system were determined from actual elevator operations. These parameter levels were then applied throughout. The performance of the different algorithms was compared via the mean and standard deviation of actual process yields and the processing time to reach the optimum at the maximal preset of iterations. For the model A, the descriptive results found by the SFLA and all variants via a box-whisker plot are shown in Fig. 7. The HSFLA3 was statistically significant, at the 95 % confidence interval, with the lowest T P value of 0.3938, when the minimum number of rough cuts or n of 1 was taken. Fine tuning gave solutions with two steps. The first vertical movement of S 2 brought the convergence rate to near the optimal solution and the next vertical movement of S 1 was used for fine turning to the optimal point. The HSFLA3 were superior in terms of sample mean, minimum and standard deviation after 500 iterations. Numerical results of the best variant (HSFLA3) from previous solutions reported in literature are in Table 6.

Fig. 7
figure 7

Box–Whisker graphical results on the model A

Table 6 Parameter levels from GA, TLBO and HSFLA3

The machining data required for optimal evaluation of Model B were initially analysed for different values of depth of cut without considering equality constraints on the total depth of cut (Ermer 1971). The optimal results from using the SFLA and its variants for removing a depth of 6 mm are shown in Fig. 8. From the analysis of results, HSFLA3 provided the statistically significant results, at the 95 % confidence interval, without any violation of constraints. From the analytical results for four cases a limitation of the depth of finish cut to a shorter range led to an increase in the number of passes and the optimal cost. Therefore, the same range for finish and rough cuts was introduced for removing the total depth of cut in multi-pass turning operations. An analysis of Model B was performed with an unequal constraint on total depth of cut, which only gave a limit on number of passes. Additionally, an equality constraint on total cutting depth was included on the model.

Fig. 8
figure 8

A convergence rate of the model B

The optimal parameter levels included an optimal subdivision of depth of cut, an optimal number of passes required in each case, cutting speed and feed rates for each rough and finish pass and the optimal production cost. Analysis of results suggested that considering different ranges for finish and rough cuts was not recommended because it required more passes to remove the total depth. This resulted in an increase of total production cost. Additionally, when depths of both finish and rough cuts were in the same range, there were fewer passes with reduced production cost. Therefore, the same range for finish and rough cuts for removing the total depth of cut in multi-pass turning operations was proved to be a better choice. HSFLA3 outperformed, when compared to all other methods in the literatures. The preferable convergence rate of the HSFLA3 with 10,000 function evaluations is shown in Fig. 7. The results show that the HSFLA3 is highly competitive with other published optimisation techniques available in the literature. The HSFLA3 needs a lower number of function evaluations, improves the convergence rate, and can handle different constraint forms. The results of the SFLA and all hybridisations were compared with results of cuckoo optimisation algorithm (COA), genetic algorithms (GA), particle swarm optimisation (PSO), ant colony optimisation (ACO), hybrid particle swarm optimisation (HPSO), simulated annealing-pattern search (SA-PS), teaching–learning-based optimisation algorithm (TLBO), hybrid robust differential evolution (HRDE), artificial immune algorithm (AIA), differential evolution algorithm and receptor editing (DERE), artificial bee colony (ABC), differential evolution (DE), hybrid artificial bee colony (HABC), hybrid teaching learning based optimisation (HRTLBO), hybrid genetic algorithm sequential quadratic programming (GA-SQP), firefly (FA) and totally disturbed particle swarm optimisation (TDPSO) as shown in Table 7. The HSFLA3 obtained near optimal solution; it can be used for machining parameter selection of complex machined parts that require many machining constraints. Moreover, it can also solve the other metal cutting optimisation problems such as milling and drilling. In addition, the machining model proposed herein can be integrated into a CAD/CAM system for identifying the optimal machining parameters and reducing the manufacturing cost in metal machining.

Table 7 Comparison of different optimisation methods

Conclusion and future work

This paper embedded various evolutionary elements from the novel vertical transportation systems on a hybrid shuffled frog leaping algorithm. An objective is to simultaneously improve the local search stability and the global search ability for nonlinear constrained models. When optimising the machining processes is effective these parameters dramatically decrease both production cost and time and increase the final product quality. Both models of single-pass and multi-pass operations were highly constrained and nonlinear in nature. When an economic perspective under a constrictive machining environment is focused, the multi-pass operations are mainly preferred over single-pass operations. This study mainly focused on empirical models of multi-pass turning processes to determine the optimal parameter settings under the consumer production requirements in terms of better quality with lower costs. HSFLA3 outperformed on these machining optimizations, when comparing numerical results with the remaining embedded algorithms and previous studies. It may be concluded that HSFLA3 was a good choice for solving complex machining optimisation problems arising in manufacturing or other process industries. Further works include applications of the proposed methods on other turning operation models and implementations of the proposed approach to real-world problems.

References

  • Belloufi A, Assas M, Rezgui I (2012) Optimization of cutting conditions in multi-pass turning using hybrid genetic algorithm-sequential quadratic programming. J Appl Res Technol 1(1):3–7

    Google Scholar 

  • Belloufi A, Assas M, Rezgui I (2014) Intelligent selection of machining parameters in multi-pass turnings using firefly algorithm. Model Simul Eng 2014:1–6

    Article  Google Scholar 

  • Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0/1 knapsack problem. Appl Soft Comput 19:252–263

    Article  Google Scholar 

  • Chauhan P, Pant M, Deep K (2015) Parameter optimization of multi-pass turning using chaotic PSO. Int J Mach Learn Cybernet 6:319–337

    Article  Google Scholar 

  • Chen M-C, Chen K-Y (2010) Optimization of multipass turning operations with genetic algorithms: a note. Int J Prod Res 41(14,2003):3385–3388

    Google Scholar 

  • Chen MC, Tsai DM (1996) A simulated annealing approach for optimization of multi-pass turning operations. Int J Prod Res 34(10):2803–2825

    Article  Google Scholar 

  • Costa A, Celano G, Fichera S (2011) Optimization of multi-pass turning economies through a hybrid particle swarm optimization technique. Int J Adv Manuf Technol 53(5–8):421–433

    Article  Google Scholar 

  • Dep K, Datta R (2011) Hybrid evolutionary multi-objective optimization and analysis of machining operations. Eng Optim 44(6):685–706

    Google Scholar 

  • Elbeltagi E, Hegazy T, Grierson D (2007) A modified shuffled frog-leaping optimisation algorithm: applications to project management. Struct Infrastruct Eng Maint Manag Life Cycl 3:53–60

    Article  Google Scholar 

  • Ermer ED (1971) Optimization of the constrained machining economics problem by geometric programming. ASME J Eng Ind 93(4):1067–1072

    Article  Google Scholar 

  • Ermer DS, Patel DC (1974) Maximization of production rate with constraints by linear programming and sensitivity analysis. In: The 2nd North American Metalworking Research Conference (WI’74)

  • Eusuff MM, Lansey KE (2003) Optimisation of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manag 129:210–225

    Article  Google Scholar 

  • Guo J, Tang H, Sun Z, Wang S, Jia X, Chen H, Zhang Z (2015) An improved shuffled frog leaping algorithm for assembly sequence planning of remote handling maintenance in radioactive environment. Sci Technol Nucl Install 2015:1–14

    Article  Google Scholar 

  • Jadidoleslam M, Ebrahimi A (2015) Reliability constrained generation expansion planning by a modified shuffled frog leaping algorithm. Int J Electr Power Energy Syst 64:743–751

    Article  Google Scholar 

  • Khan Z, Prasad LB, Singhl T (1997) Machine condition optimisation by genetic algorithms and simulated annealing. Comput Oper Res 24(7):647–657

    Article  Google Scholar 

  • Klote JH (1993) Method for calculation of elevator evacuation time. J Fire Prot Eng 5:83–96

    Article  Google Scholar 

  • Kumar JV, Kumar DMV (2014) Generation bidding strategy in a pool based electricity market using Shuffled Frog Leaping Algorithm. Appl Soft Comput 21:407–414

    Article  Google Scholar 

  • Li J, Pan Q, Xie S (2012) An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems. Appl Math Comput 218:9353–9371

    Google Scholar 

  • Lu K, Jing M, Zhang X, Liu H (2013) Optimization of sequential subdivision of depth of cut in turning operations using dynamic programming. Int J Adv Manuf Technol 68:1733–1744

    Article  Google Scholar 

  • Luo J, Chen M-R (2014) Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem. Expert Syst Appl 41:2535–2545

    Article  Google Scholar 

  • Mellal MA, Williams EJ (2015) Cuckoo optimization algorithm for unit production cost in multi-pass turning operations. Int J Adv Manuf Technol 76:647–656

    Article  Google Scholar 

  • Niknam T, Mr Narimani, Jabbari M, Malekpour AR (2011) A modified shuffle frog leaping algorithm for multi-objective optimal power flow. Energy 36:6420–6432

    Article  Google Scholar 

  • Onwubolu GC, Kumalo T (2001) Optimization of multipass turning operations with genetic algorithms. Int J Prod Res 39:3727–3745

    Article  Google Scholar 

  • Rao RV, Kalyankar V (2013) Multi-pass turning process parameter optimization using teaching-learning-based optimization algorithm. Scientia Iranica 20(3):967–974

    Google Scholar 

  • Roy P (2011) A new technique to solve minimum spanning tree (MST) problem using modified shuffled frog-leaping algorithm (MSFLA) with GA cross-over. In: Paper presented at the 3rd International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom 2011), Bangalore

  • Samuel GG, Rajan CCA (2015) Hybrid: particle swarm optimisation-genetic algorithm and particle swarm optimisation-shuffled frog leaping algorithm for long-term generator maintenance scheduling. Electr Power Energy Syst 65:432–442

    Article  Google Scholar 

  • Shang YL, Bouffanais R (2014) Influence of the number of topologically interacting neighbors on swarm dynamics. Sci Rep 4:4184

    Google Scholar 

  • Sharma S, Sharma TK, Pant M, Rajpurohit J, Naruka B (2015) Accelerated shuffled frog-leaping algorithm. In: Fourth international conference on soft computing for problem solving. Springer, India

  • Shin YC, Joo YS (1992) Optimization of machining conditions with practical constraints. Int J Prod Res 30(12):2907–2919

    Article  Google Scholar 

  • Srinivas J, Giri R, Yang S (2009) Optimization of multi-pass turning using particle swarm intelligence. Int J Adv Manuf Technol 40(1–2):56–66

    Article  Google Scholar 

  • Strakosch GR, Caporale RS (2010) The vertical transportation handbook, 4th edn. Wiley, New Jersey

    Book  Google Scholar 

  • Vijayakumar K, Kumudinidevi DRP (2007) A new method for optimal location of facts controllers using genetic algorithm. J Theor Appl Inf Technol 3(4):1–6

    Google Scholar 

  • Vijayakumar K, Prabhaharan G, Asokan P, Saravanan R (2003) Optimization of multi-pass turning operation using ant colony system. Int J Mach Tools Manuf 43:1633–1639

    Article  Google Scholar 

  • Wang Y-C (2007) A note on optimization of multi-pass turning operations using ant colony system. Int J Mach Tools Manuf 47(12):2057–2059

    Article  Google Scholar 

  • Yammani C (2011) Optimal placement and sizing of the DER in distribution systems using shuffled frog leaping algorithm. In: Paper presented at the recent advances in intelligent computational systems (RAICS) IEEE, Trivandrum

  • Yildiz A (2012) A comparative study of population-based optimisation algorithms for turning operations. Inf Sci 210:81–88

    Article  Google Scholar 

  • Yildiz A (2013a) Hybrid Taguchi differential evolution algorithm for optimization of multi-pass turning operations. Appl Soft Comput 13(3):1433–1439

    Article  Google Scholar 

  • Yildiz A (2013b) Optimization of cutting parameters in multi-pass turning using artificial bee colony-based approach. Inf Sci 220:399–407

    Article  Google Scholar 

  • Yildiz A (2013c) Optimization of multi-pass turning operations using hybrid teaching learning based approach. Int J Adv Manuf Technol 66(9–12):1319–1326

    Article  Google Scholar 

  • Yildiz AR (2013d) A new hybrid differential evolution algorithm for the selection of optimal machining parameters in milling operations. Appl Soft Comput 13:1561–1566

    Article  Google Scholar 

  • Yildiz A, Ozturk F (2006) Hybrid enhanced genetic algorithm to select optimal machining parameters in turning operation. Proc Inst Mech Eng D J Automob Eng 220(12):2041–2053

    Article  Google Scholar 

  • Yusup N, Zain AM, Hashim SZM (2012) Evolutionary techniques in optimizing machining parameters. Expert Syst Appl Int J 39(10):9909–9927

    Article  Google Scholar 

  • Zarei O, Fesanghary M, Farshi B, Saffar RJ, Razfar MR (2009) Optimization of multi-pass face-milling via harmony search algorithm. J Mater Process Technol 209(5):2386–2392

    Article  Google Scholar 

  • Zhang X, Zhang Y, Shi Y, Zhao L, Zoua C (2012) Power control algorithm in cognitive radio system based on modified shuffled frog leaping algorithm. Int J Electron Commun 66:448–454

    Article  Google Scholar 

  • Zhu GY, Zhang WB (2014) An improved shuffled frog-leaping algorithm to optimise component pick-and-place sequencing optimisation problem. Expert Syst Appl Int J 41:6818–6829

    Article  Google Scholar 

Download references

Authors’ contributions

PA devised the study. PA and PL analysed the results and wrote the main manuscript text. PA coded computer programs. PA and PL performed the numerical analysis and generated the figures. Both authors read and approved the final manuscript.

Acknowledgements

This work was supported by the Higher Education Research Promotion and National Research University Project of Thailand, Office of the Higher Education Commission. The authors wish to thank the Faculty of Engineering, Thammasat University, THAILAND for financial support.

Competing interests

The authors declare that they have no competing interests.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pasura Aungkulanon.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Aungkulanon, P., Luangpaiboon, P. Vertical transportation systems embedded on shuffled frog leaping algorithm for manufacturing optimisation problems in industries. SpringerPlus 5, 831 (2016). https://doi.org/10.1186/s40064-016-2449-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/s40064-016-2449-1

Keywords

  • Vertical transportation system
  • Shuffled frog leaping algorithm
  • Single pass turning
  • Multi-pass turning