An Ant Colony Optimization Approach for the Multi-Level Unconstrained Lot-Sizing Problem
|
|
- Shonda Freeman
- 6 years ago
- Views:
Transcription
1 An Ant Colony Optimization Approach for the Multi-Level Unconstrained Lot-Sizing Problem Jörg Homberger Stuttgart University of Applied Sciences Schellingstr. 24, Stuttgart, Germany Hermann Gehring University of Hagen Profilstr. 8, Postfach 940, Hagen, Germany Abstract An Ant Colony Optimization approach for the Multi- Level Unconstrained Lot-Sizing Problem (MLULSP) is described and evaluated using 176 benchmark problems from the literature, with problem sizes varying from 5 to 500 products and up to 52 periods. The approach consists of a binary encoding of production plans. The lot-sizing decisions are mapped on a routing graph to apply the metaheuristic concept of ant systems. The proposed approach is competitive with the best known solution methods. It was possible with the new method to calculate new best solutions for 11 of the benchmark problems. 1. Introduction and Literature Review Models of Material Requirements Planning (MRP) are essential components of Production Planning and Control Systems (PPS) and of Enterprise Resource Planning Systems (ERP) as well [17][27][20]. A comprehensive overview of the different MRP models is given by Tempelmeier [25]. This paper deals with the Multi-Level Unconstrained Lot-Sizing Problem (MLULSP) which belongs to the class of dynamic lotsizing problems with multi-level production of one or more end products. The MLULSP aims at the calculation of lot-sizes for end products, intermediate products, and components that minimize the sum of set-up and inventory-holding costs, while meeting the given demand for end products over several periods [29][28]. According to the basic idea of MRP, capacity constraints are not considered in MLULSP. Hence, the practical application of the MLULSP covers mainly three situations: (1) The MLULSP is applied to the planning of lot-sizes in cases where due to the practical conditions complete or current information on the availability of capacities of resources is not known [22][10][20]. (2) In the case of given capacity constraints, the model can be used as a component within successive planning approaches of PPS. For this purpose the MRP is followed by a capacity requirements planning aiming at the calculation of feasible solutions with respect to the available capacities [22][10][20]. (3) Finally, in the area of purchasing the MLULSP is suited to determine earliest possible requirement times for (raw) material entering the production process [27]. Apart from capacity constraints, additional issues coming from correlations over time, random events, etc. are often to be considered in practical planning situations [4]. In these cases, a direct application of the MLULSP is not possible. In spite of its limited applicability to practical problems, the MLULSP is used in the current scientific literature as a basis for the development and evaluation of new methods for the planning of lot-sizes [9][20][16]. The reasons are as follows: (1) Since the MLULSP is a well established standard-problem of lot-size planning, a multitude of benchmark problems and solutions are reported in the literature. This favours the meaningful evaluation of new lot-sizing planning approaches. (2) The MLULSP considers only a few constraints (e.g., predecessor and successor relations between products) and ignores special practical conditions. Within the development of solution methods the focus can therefore be on metaheuristic components of methods. The Ant Colony Optimization (ACO) metaheuristic was introduced by Colorni et al. [8]. The basic idea of ACO is to imitate real ants searching for food based on pheromones. In each iteration, m alternative solutions of the optimization problem at hand are built by artificial ants (search processes) using a randomized constructive procedure and a pheromone matrix that represents an adaptive memory of previously visited solutions. A solution is generated stepwise. In each step, a further component of the solution is selected in accordance with a probability distribution and then added to the partial solution constructed so far. The probability distribution is defined by artificial pheromones. For a given solution /09 $ IEEE 1
2 component, a pheromone value describes the solution quality obtained by solutions containing this component. At the end of each iteration all constructed solutions are evaluated and the pheromone values of the solution components of the best solution or ant are increased according to an adaption rule. In this way, the components of good solutions get higher pheromone values and future ants will use this information to generate new and better solutions. To avoid local optima, some kind of pheromone evaporation is used, i.e., pheromone values are decreased during the search. Three standard ACO algorithms are distinguished. The Ant Colony System (ACS) [12][14], the MAX-MIN Ant System (MMAS) proposed by Stützle and Hoos [24], and the rank-based Ant System (AS rank ) [6]. These describe essential different pheromone update mechanisms. Usually the ACS is fastest, the MMAS gives best solutions but is slower, and the AS rank is a good compromise. Until now, ACO approaches have been applied successively to combinatorial optimization problems, especially vehicle routing problems [6][24][18][19]. For solving the MLULSP, different heuristics, metaheuristics, and exact optimization procedures were developed. An overview can be found in Dellaert and Jeunet [10]. Best results for large instances could be achieved by the following metaheuristics: a hybrid genetic algorithm (HGA) [9], a MMAS [20], and a parallel genetic algorithm (PGA) [16]. On the one hand, these methods differ with respect to the given metaheuristic concept, and on the other hand, with respect to the problem representation used. The HGA is based on a binary encoding of production plans, where each bit represents a set-up decision. In MMAS, production plans are represented as a sequence of products. Finally, a redundant binary encoding of production plans, which is based on a pre-selection of production periods, is used in PGA. In this paper, a new ACO approach for solving the MLULSP, denoted as Simple Ant System (SAS) in the following, is described. The aim is to develop and to test a new pheromone matrix for solving multi-level lotsizing problems. For the adaption of pheromone values only some simple rules are applied (i.e., only some of the rules described in ACS are used).the SAS differs from MMAS as follows: The SAS is based on a direct encoding of solutions by means of binary production decisions. The MMAS of Pitakaso et al. [20], on the other hand, is based on a indirect encoding of solutions using the sequence of the different items of the product structure. The MMAS is used to calculate a good sequence of items; for each item a modified Wagner-Whitin algorithm is applied separately. Apart from the chosen representation of solutions, a new pheromone matrix, and therefore a different interpretation of pheromones and a different rule of their adaptation, are used in SAS. Finally, problem specific heuristics like, e.g., the Wagner-Whitin algorithm, are not used for the construction of solutions. In this way, it is tried to extend the part of the solution space which is accessible for the search process. The formulation of the MLULSP is given in Section 2. In Section 3 the proposed SAS is described. To analyze the performance of the new metaheuristic for solving the MLULSP, the method is compared with best known solution methods in Section 4. Section 5 contains some conclusions and objectives for further research. 2. The Multi-Level Unconstrained Lot- Sizing Problem Based on the model formulation by Steinberg and Napier [23], the MLULSP is represented as mixedinteger program in the following. The notation used is described in Table 1. N T d i,t Γ(i) Γ -1 (i) q i,j t i s i h i x i,t l i,t y i,t M Table 1. Notation of the MLULSP. number of items finite planning horizon total requirement for item i in period t all direct successors of item i all direct predecessors of item i quantity of item i required to produce one unit of item j lead time to assemble, to manufacture or to purchase item i set-up cost for item i inventory-holding cost for item i delivered quantity (lot-size) of item i at the beginning of period t inventory positions for item i at the end of period t binary (set-up) variable which indicates if an item i is produced in period t (y i,t = 1) or not (y i,t = 0) a large number By using the introduced notation, the MLULSP is modelled as follows [9]: 2
3 minimize N T Cost = i= 1 t = 1 s i y i,t + h i l i,t, (1) subject to l i,t = l i,t-1 + x i,t d i,t, i = 1,..., N, (2) d i,t = q i, j x j,t + t, i, i = 1,..., N Γ(i) Ø, (3) i j (i) x i,t M y i,t 0, i = 1,..., N, (4) l i,0 = 0, i = 1,..., N, (5) l i,t 0, i = 1,..., N, (6) x i,t 0, i = 1,..., N, (7) y i,t {0, 1}, i = 1,..., N. (8) The objective function (1) aims at the minimization of the sum Cost of set-up and inventory costs for all items over the entire planning horizon. Equation (2) is the inventory balance equation. The constraints (3) ensure that a lot of item j in period t+t i triggers a corresponding demand d i,t in each predecessor item i, i Γ -1 (j). The demand triggered by a lot is also designated the dependent demand. Constraint (4) captures the fact that a set-up cost is incurred whenever an item is produced. Constraints (5) - (7) express that backlog is not allowed and that production is either positive or zero. Finally, constraint (8) represents the binary character of decisions on set-ups. As is usual in the literature, q i,j = 1, for i, j = 1,..., N, will be assumed in this paper without loss of generality [13]. Arkin et al. [3] show that the MLULSP is NP-hard for general multi-level bill-of-material (BOM) structures, i.e., for product structures, where each item can have more than one successor and predecessor [21]. exactly T bits are reserved for each item (see [16]). The bits c i,t, i = 1,..., N, and t = 1,..., T, represent a preselection of periods that can be used when required for production, where c i,t = 1 when period t is pre-selected as a possible production period for item i, and c i,t = 0 otherwise Pheromone Matrix ACO approaches are well suited for solving problems which require the construction of an efficient path between two nodes of a graph. Pheromone values imposed on the arcs of the graph are used to construct efficient paths. In order to enable the construction of encoded solutions of the MLULSP by means of the pheromone-based approach, the binary decision variables c i,t, i = 1,..., N, t = 1,..., T, are represented in a graph. The subgraph G i consists of T+1 nodes and T(T+1)/2 arcs. The nodes k i,t, t = 1,..., T, represent the possible production periods and the node k i,t+1 (also denoted as node stop) represents the end of the planning for item i. From node k i,x, x = 1,..., T, arcs emanate to the nodes k i,z, x < z T+1. An arc (k i,x, k i,z ), z < T+1, represents the decisions c i,y = 0, x < y < z, and c i,z = 1. This means, after the production in period x a further production may not start earlier than in period z. An arc (k i,x, k i,t+1 ) represents the decisions c i,y = 0, x < y T. This means, after the production of period x, item i may not be produced in any of the further periods. For each arc (k i,x, k i,z ) a pheromone value τ i,x,z is now introduced and kept in a three-dimensional pheromone matrix. In Figure 1, an example of an encoded solution c for a simple MLULSP instance which consists of only two items (one end item and one component) is given. 3. Ant Colony Optimization Approach 3.1. Representation of Solutions A solution of the MLULSP can basically be understood as a N T matrix, in which the delivered quantity, x i,t, is given for each item and each period. As it is not easy to directly derive feasible solutions, an indirect problem representation is used in this paper. In conformity with Dellaert and Jeunet [9], a binary encoding is chosen to represent solutions. A solution is represented by a N T bit matrix, denoted as c, in which 3
4 encoded solution c period t: c 1,t : c 2,t : heuristic information i,x, y, i.e., each ant k in its current position x decides to go to the period y with the probability i,x, k y (nr ) given in formula 9. graph G 1 k 1,1 k 1,2 k 1,3 k 1,4 stop τ 1,1,2 τ 1,1,3 τ 1,1,4 τ 1,1,stop τ 1,1,stop τ 1,2,3 τ 1,2,4 τ 1,2,stop τ 1,2,stop 1,3,4 τ τ 1,3,stop i,x,y( nr) i,x,y ( nr) = (9) k i, x, y ( i,x,z( nr) i,x,z ) z> x The local heuristic information i,x, y is calculated by the following rule: Starting with period x, the next period y is determined by the Groff criterion [15]. The heuristic information i,x, y is now defined as i,x, y = (T-x) for y = y, and i,x, y = 1 otherwise. graph G 2 k 2,1 k 2,2 k 2,3 k 2,4 stop τ 2,1,2 τ 2,1,3 τ 2,1,4 2,1,stop τ 2,1,stop τ τ 2,2,3 τ 2,2,4 τ 2,2,stop τ 2,2,stop τ 2,3,4 τ 2,3,stop Figure 1. Example of a Graph and of the introduced Pheromones. On the one hand, all possible paths leading from the production in period t = 1 to the end of planning (node stop) are shown in Figure 1. On the other hand, the encoded solution (i.e., possible set-up decisions for item 1 and 2) is given in graph G 1 and G 2, and the respective solution paths are highlighted using bold types Generation of Encoded Solutions In each iteration, m encoded solutions are generated. In the terminology of ACO, the construction of a solution correspondents to starting an artificial ant. In order to construct an encoded solution c, all subgraphs G i are traversed by initialized ants in the sequence i = 1,..., N. The traversion of subgraph G i starts at the node representing the first period of demand of item i. Hence, an according production for the first period of demand is planned and the calculation of a feasible solution is guaranteed [9]. In each construction step, each ant moves from the current period x to another period y > x. The next period y is selected on the basis of a probabilistic decision. The probabilistic selection in iteration nr is biased by the pheromone information i, x, y(nr) and some local 3.4. Decoding Rule The decoding rule, i.e., the decoding of a binary represented solution c, follows the ideas of Homberger [16]. The following two decoding steps per level are executed successively for each item i N (for a detailed description we refer to the mentioned publications): (1) For each period t = 1,..., T, calculate the demand d i,t subject to the BOM and the lots for Γ(i) which have been determined already. (2) For each period t = 1,..., T, calculate the set-ups y i,t, the quantity stored l i,t, and the delivery quantity x i,t subject to d i,t and c i,t. For this purpose, for each period t of the planning horizon a check is made to determine whether a demand d i,t, d i,t > 0, was calculated in the first decoding step. Two cases can be distinguished for selecting the set-up y i,t : (1) The period t in the encoded solution c is pre-selected (c i,t = 1). The demand d i,t is then produced in period t; i.e., y i,t is set to 1, and x i,t is actualized as follows: x i,t := x i,t + d i,t. (2) The period t is not pre-selected (c i,t = 0). Then a lot is run in period w (w < t, c i,w = 1), which is the last period before t and which is pre-selected for the production of i. The quantity d i,t produced in period w is stored until period t, i.e., y i,w is set to 1, y i,t is set to 0, and x i,w is actualized as follows: x i,w := x i,w + d i,t. The calculated delivery quantities represent the (decoded) solution con Initialization of Pheromones and Adaptation Rule The initialization of the pheromones pursues the goal to generate each possible solution with equal probability. To achieve this goal, pheromones are initialized in such a manner that each period is selected as a possible production period with a probability of 0.5; i.e., the variables c i,t should receive the value 1 with probability 4
5 0.5. This is achieved by an initialization according to formula 10. i,x,y 1 2 if 1< y < T + 1, i,x,y = init if y = 1, (10) i,x,y 1 if y = T + 1. In each iteration, the best decoded solution con of m generated decoded solutions is selected and the pheromone information is updated by the following updating rule. First, all current pheromone values are decreased by a constant factor ρ. This procedure is also called pheromone evaporation. Second, the selected solution con is used to update the pheromones. Therefore, the pheromone values on the arcs which represent the selected solution con are increased with respect to the cost value Cost con of the solution con. The pheromone update rule is given by i, x, y( nr + 1) = * i, x,y nr + Δ i,x, y ( ), (11) with Δ i,x, y = 1/Cost con, if the ant which constructs the selected solution con has visited arc (x, y), and * Δ i,x,y = 0 otherwise. * 4. Computational Results 4.1. Problem Instances To evaluate the SAS, three classes of benchmark problems were used. Class 1 consists of 96 problem instances which were developed by Coleman and McKnew [7] on the basis of a work by Veral and LaForge [26] and by Benton and Srivastava [5]. Optimum solutions are known for all instances. Class 2 covers 40 problem instances with problem sizes of N = 40 and N = 50 products and of T = 12 and T = 24 periods. The instances are based on the product structures published by Afentakis et al. [2], Afentakis and Gavish [1], and Dellaert and Jeunet [9]. All lead times were set to zero. Class 3 covers the 40 problem instances with a problem size of N = 500 products and T = 36 and T = 52 periods generated by Dellaert and Jeunet [9]. A lead time of one period is assumed for all products in this case Analysis of the Solution Quality The SAS was implemented in Java. Each calculation run was carried out on a Dual-Core CPU (2.4 GHz, 2 GB RAM) operating under Red Hat Enterprise Linux Version 4 Update 4. In the following, SAS is compared to other methods on the basis of results reported in the literature. For each class and each method, the average solution quality is provided in Table 2. Table 2. Summary of Total Cost of Various Solution Methods. Method class 1 class 2 class 3 HGA , ,817,600 MMAS , ,371,702 PGA , ,809,739 SAS , ,790,184 The SAS is competitive with the best known solution methods. It was possible to calculate new best solutions for 11 instances Analysis of the Performance The mean execution times in seconds for HGA, MMAS, PGA, and SAS (to reach the solution quality identified in Table 2) are provided in Table 3. Table 3. Executing Times of Various Solution Methods. Method class 1 class 2 class 3 HGA ,810 MMAS ,400 PGA ,600 SAS ,800 The executing times of SAS are competitive with the computing times reported for other approaches. The MMAS by Pitakaso et al. [20] is a bit faster than the approach at hand. It should be remarked that comparison of the computing times should be made with caution because of the different test environments. To make a fair comparison of the efficiency of SAS and MMAS, the computing times of SAS are converted according to the different machines by using the information provided by Dongarra [11]. On this basis, the average computing times per instance of SAS are 5 seconds for class 1, 258 seconds for class 2, and 5040 seconds for class 3. In comparison to the average computing times of MMAS as given in Table 3, the respective times of SAS are approximately five times higher for class 1, and two times higher for the classes 2 and 3. It should be considered, however, that SAS was developed and tested under Java, and MMAS, on the other hand, under C. The latter programming language is regarded as to be more efficient. 5
6 In order to examine the solution quality of SAS on dependence of the computing time, all problem instances were solved again with SAS. As termination criterion a maximum computing time per run was now used which is comparable to the computing time reported by Pitakaso et al. [20], i.e., shorter computing times were now used. The obtained average solution quality amounts for for class 1, 263,798.2 for class 2, and 40,611,991 for class 3. These results may be interpreted as follows. For the classes 1 and 2, the reduction of the computing time leads hardly to worsenings, i.e., MMAS and SAS provide solutions of nearly same quality for these classes. In the case of class 3, SAS generates on average a little more worse results than MMAS for comparable computing times. In order to demonstrate the solution quality of SAS on dependence of the computing time, the convergence behaviour per run for each calculated benchmark instance of class 2 is exemplarily shown in Figure 2. In this diagram, the dependence of the solution quality of the best solution or ant on the number of iterations is considered. Cost [1000 monetary units] 1, , benchmark problems from the literature, with problem sizes varying from 5 to 500 products and covering 12 to 52 periods. The SAS is competetive with the best known solution methods described in the literature. It was possible to calculate new best solutions for 11 of the benchmark problems. Further research on the MLULSP will follow two directions: (1) Problem-specific extension of the described ant system SAS. The MLULSP underlying this paper is based on the assumption that capacity constraints are not to be considered. In order to eliminate this in many cases rather restrictive issue, it is intended to extend SAS in such a manner that capacitated problems can be solved, too. This requires the replacement of the problem-specific components of SAS, namely the Groff heuristic (Section 3.3) which is used to generate encoded solutions and the decoding procedure (Section 3.4), by new components which consider the capacity constraints. (2) Metaheuristic extension of the ant system SAS. In SAS only simple rules are used for the adaption of pheromone values. It is intended to refine the adaption concept by using and evaluating the mentioned three standard-algorithms ACS, MMAS, and AS rank. 6. References , , ,00 1, , , , , ,00 0, Iterations 50 Figure 2. Convergence Diagram of SAS for Class 2. From Figure 2 it can be depicted that beyond an iteration number of about thirty improvements could scarcely be obtained. 5. Conclusions and Further Research A new Ant Colony Optimization approach for the MLULSP, denoted as SAS, is presented. The proposed procedure is based on a new pheromone matrix for solving multi-level lot-sizing problems and on the redundant binary encoding for the MLULSP introduced by Homberger [16]. The method was evaluated using [1] P. Afentakis, B. Gavish, Optimal lot-sizing algorithms for complex product structures, Oper. Res. 34, 1986, pp [2] P. Afentakis, B. Gavish, and U.S. Karmarkar, Computationally efficient optimal solutions to the lot-sizing problem in multistage assembly systems, Management Sci. 30, 1984, pp [3] E. Arkin, D. Joneja, and R. Roundy, Computational complexity of uncapacitated multi-echelon production planning problems, Oper. Res. Lett. 8, 1989, pp [4] G. Belvaux, L. Wolsey, Modelling practical lot-sizing problems as mixed-integer programs, Management Sci. 47, 2001, pp [5] W.C. Benton, R. Srivastava, Product structure complexity and multilevel lot sizing using alternative costing policies, Decision Sci. 16, 1985, pp [6] B. Bullnheimer, R.F. Hartl, and C. Strauss, A new rankbased version of the ant system: a computational study, Central European Journal of Operations Research 7(1), 1999, pp [7] B.J. Coleman, M.A. McKnew, An improved heuristic for multilevel lot sizing in material requirements planning, Decision Sci. 22, 1991, pp [8] A.M. Colorni, M. Dorigo, and V. Maniezzo, Distributed optimization by ant colonies, in: Varela, F.J., P. Bourgine (eds.), Proceedings of the First European Conference on 6
7 Artificial Life, Elsevier Publishing, New York, USA, 1991, pp [9] N.P. Dellaert, J. Jeunet, Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm, Internat. J. of Production Res. 38, 2000, pp [10] N.P. Dellaert, J. Jeunet, Randomized cost-modification procedures for multilevel lot-sizing heuristics, Eur. J. of Oper. Res. 148, 2003, pp [11] J.J. Dongarra, Performance of various computers using standard linear equations software, University of Tennessee Computer Science Technical Report CS , [12] M. Dorigo, L.M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation 1(1), 1997, pp [13] A. Fink, Untersuchungen zur effizienten Lösbarkeit dynamischer, unkapazitierter, mehrstufiger Mehrprodukt- Losgrößenprobleme, Research Report AP-Nr. 97/11, TU Braunschweig, Germany, [14] L.M. Gambardella, M. Dorigo, An ant colony system hybridized with a new local search for the sequential ordering problem, INFORMS Journal on Computing 12(3), 2000, pp [15] G.K. Groff, A lot-sizing rule for time-phased components demand, Production and Inventory Management 20(1), 1979, pp [16] J. Homberger, A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem, INFORMS Journal on Computing 20(1), 2008, pp [17] M. Jäger, Kennliniengestützte Parametereinstellung von PPS-Systemen, PhD Thesis, University of Hannover, Germany, [18] D. Merkle, M. Middendorf, An ant algorithm with a new pheromone evaluation rule for total tardiness problems, in: Boers, E.J.W. et al. (eds), Proceedings of the EvoWorkshops, Volume 1803 of LNCS, 2000, pp [19] D. Merkle, M. Middendorf, and H. Schmeck, Ant colony optimization for resource constrained project scheduling, IEEE Transactions on Evolutionary Computation 6, 2002, pp [20] R. Pitakaso, C. Almeder, K.F. Doerner, and R.F. Hartl, A MAX-MIN ant system for unconstrained multi-level lot-sizing problems, Comput. and Oper. Res. 34, 2007, pp [21] M. Salomon, R. Kuik, Statistical search methods for lotsizing problems, Ann. of Oper. Res. 41, 1993, pp [22] A. Segerstedt, A capacity-constrained multilevel inventory and production control problem, International Journal of Production Economics 45, 1996, pp [23] E. Steinberg, H.A. Napier, Optimal multi-level lot sizing for requirements planning systems, Management Sci. 26, 1980, pp [24] T. Stützle, H. Hoos, MAX-MIN ant system, Future Generation Computer Systems 16, 2000, pp [25] H. Tempelmeier, Material-Logistik. Modelle und Algorithmen für die Produktionsplanung und -steuerung und das Supply Chain Management, 5 th ed., Springer, Berlin, [26] E.A. Veral, R.L. LaForge, The performance of a simple incremental lot-sizing rule in a multilevel inventory environment, Decision Sci. 16, 1985, pp [27] S. Voß, D.L. Woodruff, Introduction to computational optimization models for production planning in a supply chain. 2 nd ed., Springer, Berlin, Heidelberg, [28] L.E. Yelle, Materials requirements lot sizing: a multilevel approach, Internat. J. of Production Res. 17, 1979, pp [29] W. Zangwill, Minimum concave cost flows in certain networks, Management Sci. 14, 1968, pp
A MAX-MIN Ant System for Unconstrained Multi-Level Lot-Sizing Problems
A MAX-MIN Ant System for Unconstrained Multi-Level Lot-Sizing Problems Rapeepan Pitakaso, Christian Almeder, Karl F. Doerner, Richard F. Hartl Institute for Management Science, University of Vienna Bruenner
More informationCombining Population-Based and Exact Methods for Multi-Level Capacitated Lot Sizing Problems
International Journal of Production Research Vol. 00, No. 00, 15 July 2004, 1 27 Combining Population-Based and Exact Methods for Multi-Level Capacitated Lot Sizing Problems Rapeepan Pitakaso Ubonrajathanee
More informationComputers and Mathematics with Applications. Incorporating a database approach into the large-scale multi-level lot sizing problem
Computers and Mathematics with Applications 60 (2010) 2536 2547 Contents lists available at ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa Incorporating
More informationAn Ant Approach to the Flow Shop Problem
An Ant Approach to the Flow Shop Problem Thomas Stützle TU Darmstadt, Computer Science Department Alexanderstr. 10, 64283 Darmstadt Phone: +49-6151-166651, Fax +49-6151-165326 email: stuetzle@informatik.tu-darmstadt.de
More informationAnt Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art
Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art Krzysztof Socha, Michael Sampels, and Max Manfrin IRIDIA, Université Libre de Bruxelles, CP 194/6, Av. Franklin
More informationSolving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques N.N.Poddar 1, D. Kaur 2 1 Electrical Engineering and Computer Science, University of Toledo, Toledo, OH, USA 2
More informationA heuristic approach to find the global optimum of function
Journal of Computational and Applied Mathematics 209 (2007) 160 166 www.elsevier.com/locate/cam A heuristic approach to find the global optimum of function M. Duran Toksarı Engineering Faculty, Industrial
More informationSavingsAnts for the Vehicle Routing Problem. Karl Doerner Manfred Gronalt Richard F. Hartl Marc Reimann Christine Strauss Michael Stummer
SavingsAnts for the Vehicle Routing Problem Karl Doerner Manfred Gronalt Richard F. Hartl Marc Reimann Christine Strauss Michael Stummer Report No. 63 December 2001 December 2001 SFB Adaptive Information
More informationAn Ant System with Direct Communication for the Capacitated Vehicle Routing Problem
An Ant System with Direct Communication for the Capacitated Vehicle Routing Problem Michalis Mavrovouniotis and Shengxiang Yang Abstract Ant colony optimization (ACO) algorithms are population-based algorithms
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationSolving a combinatorial problem using a local optimization in ant based system
Solving a combinatorial problem using a local optimization in ant based system C-M.Pintea and D.Dumitrescu Babeş-Bolyai University of Cluj-Napoca, Department of Computer-Science Kogalniceanu 1, 400084
More informationThe Influence of Run-Time Limits on Choosing Ant System Parameters
The Influence of Run-Time Limits on Choosing Ant System Parameters Krzysztof Socha IRIDIA, Université Libre de Bruxelles, CP 194/6, Av. Franklin D. Roosevelt 50, 1050 Bruxelles, Belgium ksocha@ulb.ac.be
More informationAnt Colony Optimization
Ant Colony Optimization CompSci 760 Patricia J Riddle 1 Natural Inspiration The name Ant Colony Optimization was chosen to reflect its original inspiration: the foraging behavior of some ant species. It
More informationAnt Colony Optimization for dynamic Traveling Salesman Problems
Ant Colony Optimization for dynamic Traveling Salesman Problems Carlos A. Silva and Thomas A. Runkler Siemens AG, Corporate Technology Information and Communications, CT IC 4 81730 Munich - Germany thomas.runkler@siemens.com
More informationINTEGRATION OF INVENTORY CONTROL AND SCHEDULING USING BINARY PARTICLE SWARM OPTIMIZATION ALGORITHM
INTEGRATION OF INVENTORY CONTROL AND SCHEDULING USING BINARY PARTICLE SWARM OPTIMIZATION ALGORITHM Manash Dey Assistant Professor, Mechanical Engineering Department, JIMS EMTC Greater Noida (India) ABSTRACT
More informationSearching for Maximum Cliques with Ant Colony Optimization
Searching for Maximum Cliques with Ant Colony Optimization Serge Fenet and Christine Solnon LIRIS, Nautibus, University Lyon I 43 Bd du 11 novembre, 69622 Villeurbanne cedex, France {sfenet,csolnon}@bat710.univ-lyon1.fr
More informationA combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem
A combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem TRUNG HOANG DINH, ABDULLAH AL MAMUN Department of Electrical and Computer Engineering
More informationIntuitionistic Fuzzy Estimations of the Ant Colony Optimization
Intuitionistic Fuzzy Estimations of the Ant Colony Optimization Stefka Fidanova, Krasimir Atanasov and Pencho Marinov IPP BAS, Acad. G. Bonchev str. bl.25a, 1113 Sofia, Bulgaria {stefka,pencho}@parallel.bas.bg
More informationAnt Colony Algorithms for the Dynamic Vehicle Routing Problem with Time Windows
Ant Colony Algorithms for the Dynamic Vehicle Routing Problem with Time Windows Barry van Veen, Michael Emmerich, Zhiwei Yang, Thomas Bäck, and Joost Kok LIACS, Leiden University, Niels Bohrweg 1, 2333-CA
More informationImage Edge Detection Using Ant Colony Optimization
Image Edge Detection Using Ant Colony Optimization Anna Veronica Baterina and Carlos Oppus Abstract Ant colony optimization (ACO) is a population-based metaheuristic that mimics the foraging behavior of
More informationSolving Travelling Salesmen Problem using Ant Colony Optimization Algorithm
SCITECH Volume 3, Issue 1 RESEARCH ORGANISATION March 30, 2015 Journal of Information Sciences and Computing Technologies www.scitecresearch.com Solving Travelling Salesmen Problem using Ant Colony Optimization
More informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationAnt Colony Optimization Algorithm for Reactive Production Scheduling Problem in the Job Shop System
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Ant Colony Optimization Algorithm for Reactive Production Scheduling Problem in
More informationAlternative Solution Representations for the Job Shop Scheduling Problem in Ant Colony Optimisation
Alternative Solution Representations for the Job Shop Scheduling Problem in Ant Colony Optimisation James Montgomery Complex Intelligent Systems Laboratory Centre for Information Technology Research Faculty
More informationParallel Implementation of Travelling Salesman Problem using Ant Colony Optimization
Parallel Implementation of Travelling Salesman Problem using Ant Colony Optimization Gaurav Bhardwaj Department of Computer Science and Engineering Maulana Azad National Institute of Technology Bhopal,
More informationMemory-Based Immigrants for Ant Colony Optimization in Changing Environments
Memory-Based Immigrants for Ant Colony Optimization in Changing Environments Michalis Mavrovouniotis 1 and Shengxiang Yang 2 1 Department of Computer Science, University of Leicester University Road, Leicester
More informationA data-driven approach for solving route & fleet optimization problems
A data-driven approach for solving route & fleet optimization problems TECHNICAL WHITE PAPER Authors Charles Florin, PhD Senior Director & Chief Data Scientist, Karvy Analytics Ltd. Akhil Sakhardande Senior
More informationResearch Article Using the ACS Approach to Solve Continuous Mathematical Problems in Engineering
Mathematical Problems in Engineering, Article ID 142194, 7 pages http://dxdoiorg/101155/2014/142194 Research Article Using the ACS Approach to Solve Continuous Mathematical Problems in Engineering Min-Thai
More informationJednociljna i višeciljna optimizacija korištenjem HUMANT algoritma
Seminar doktoranada i poslijedoktoranada 2015. Dani FESB-a 2015., Split, 25. - 31. svibnja 2015. Jednociljna i višeciljna optimizacija korištenjem HUMANT algoritma (Single-Objective and Multi-Objective
More informationLearning Fuzzy Rules Using Ant Colony Optimization Algorithms 1
Learning Fuzzy Rules Using Ant Colony Optimization Algorithms 1 Jorge Casillas, Oscar Cordón, Francisco Herrera Department of Computer Science and Artificial Intelligence, University of Granada, E-18071
More informationAn Efficient Heuristic Algorithm for Capacitated Lot Sizing Problem with Overtime Decisions
An Efficient Heuristic Algorithm for Capacitated Lot Sizing Problem with Overtime Decisions Cagatay Iris and Mehmet Mutlu Yenisey Department of Industrial Engineering, Istanbul Technical University, 34367,
More informationRelationship between Genetic Algorithms and Ant Colony Optimization Algorithms
Relationship between Genetic Algorithms and Ant Colony Optimization Algorithms Osvaldo Gómez Universidad Nacional de Asunción Centro Nacional de Computación Asunción, Paraguay ogomez@cnc.una.py and Benjamín
More informationAnt Colony Optimization
DM841 DISCRETE OPTIMIZATION Part 2 Heuristics Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. earch 2. Context Inspiration from Nature 3. 4. 5.
More informationConstrained Minimum Spanning Tree Algorithms
December 8, 008 Introduction Graphs and MSTs revisited Minimum Spanning Tree Algorithms Algorithm of Kruskal Algorithm of Prim Constrained Minimum Spanning Trees Bounded Diameter Minimum Spanning Trees
More informationCT79 SOFT COMPUTING ALCCS-FEB 2014
Q.1 a. Define Union, Intersection and complement operations of Fuzzy sets. For fuzzy sets A and B Figure Fuzzy sets A & B The union of two fuzzy sets A and B is a fuzzy set C, written as C=AUB or C=A OR
More informationWorkflow Scheduling Using Heuristics Based Ant Colony Optimization
Workflow Scheduling Using Heuristics Based Ant Colony Optimization 1 J.Elayaraja, 2 S.Dhanasekar 1 PG Scholar, Department of CSE, Info Institute of Engineering, Coimbatore, India 2 Assistant Professor,
More informationProceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Solving Assembly Line Balancing Problem in the State of Multiple- Alternative
More informationACO for Maximal Constraint Satisfaction Problems
MIC 2001-4th Metaheuristics International Conference 187 ACO for Maximal Constraint Satisfaction Problems Andrea Roli Christian Blum Marco Dorigo DEIS - Università di Bologna Viale Risorgimento, 2 - Bologna
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Faculty of Information & Communication Technologies Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation James Montgomery, Carole Fayad 1 and Sanja Petrovic 1 1 School of
More informationParallel Implementation of the Max_Min Ant System for the Travelling Salesman Problem on GPU
Parallel Implementation of the Max_Min Ant System for the Travelling Salesman Problem on GPU Gaurav Bhardwaj Department of Computer Science and Engineering Maulana Azad National Institute of Technology
More informationHybrid Ant Colony Optimization and Cuckoo Search Algorithm for Travelling Salesman Problem
International Journal of Scientific and Research Publications, Volume 5, Issue 6, June 2015 1 Hybrid Ant Colony Optimization and Cucoo Search Algorithm for Travelling Salesman Problem Sandeep Kumar *,
More informationStructural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems
Structural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems James Montgomery No Institute Given Abstract. When using a constructive search algorithm, solutions to scheduling
More informationApplication of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 3673 3677 Advanced in Control Engineeringand Information Science Application of Improved Discrete Particle Swarm Optimization in
More informationAn ant colony optimization heuristic for an integrated. production and distribution scheduling problem 1
An ant colony optimization heuristic for an integrated production and distribution scheduling problem 1 Yung-Chia Chang a, Vincent C. Li b* and Chia-Ju Chiang a a Department of Industrial Engineering and
More informationEffective Optimizer Development for Solving Combinatorial Optimization Problems *
Proceedings of the 11th WSEAS International Conference on SYSTEMS, Agios Nikolaos, Crete Island, Greece, July 23-25, 2007 311 Effective Optimizer Development for Solving Combinatorial Optimization s *
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More informationAdaptive Ant Colony Optimization for the Traveling Salesman Problem
- Diplomarbeit - (Implementierungsarbeit) Adaptive Ant Colony Optimization for the Traveling Salesman Problem Michael Maur Mat.-Nr.: 1192603 @stud.tu-darmstadt.de Eingereicht im Dezember 2009
More informationLOW AND HIGH LEVEL HYBRIDIZATION OF ANT COLONY SYSTEM AND GENETIC ALGORITHM FOR JOB SCHEDULING IN GRID COMPUTING
LOW AND HIGH LEVEL HYBRIDIZATION OF ANT COLONY SYSTEM AND GENETIC ALGORITHM FOR JOB SCHEDULING IN GRID COMPUTING Mustafa Muwafak Alobaedy 1, and Ku Ruhana Ku-Mahamud 2 2 Universiti Utara Malaysia), Malaysia,
More informationPre-Scheduled Colony Size Variation in Dynamic Environments
Pre-Scheduled Colony Size Variation in Dynamic Environments Michalis Mavrovouniotis 1, Anastasia Ioannou 2, and Shengxiang Yang 3 1 School of Science and Technology, Nottingham Trent University Clifton
More informationAn Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm
An Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm Prabha S. 1, Arun Prabha K. 2 1 Research Scholar, Department of Computer Science, Vellalar
More informationRefinement of Data-Flow Testing using Ant Colony Algorithm
Refinement of Data-Flow Testing using Ant Colony Algorithm Abhay Kumar Srivastav, Supriya N S 2,2 Assistant Professor,2 Department of MCA,MVJCE Bangalore-560067 Abstract : Search-based optimization techniques
More informationNORMALIZATION OF ACO ALGORITHM PARAMETERS
U.P.B. Sci. Bull., Series C, Vol. 79, Iss. 2, 2017 ISSN 2286-3540 NORMALIZATION OF ACO ALGORITHM PARAMETERS Alina E. NEGULESCU 1 Due to the fact that Swarm Systems algorithms have been determined to be
More informationAnt Colony Optimization for Multi-Objective Machine-Tool Selection and Operation Allocation in a Flexible Manufacturing System
World Applied Sciences Journal 15 (6): 867-872, 2011 ISSN 1818-4952 IDOSI Publications, 2011 Ant Colony Optimization for Multi-Objective Machine-Tool Selection and Operation Allocation in a Flexible Manufacturing
More informationA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
More informationPre-scheduled and adaptive parameter variation in MAX-MIN Ant System
Pre-scheduled and adaptive parameter variation in MAX-MIN Ant System Michael Maur, Manuel López-Ibáñez, and Thomas Stützle Abstract MAX-MIN Ant System (MMAS) is an ant colony optimization (ACO) algorithm
More informationA Review: Optimization of Energy in Wireless Sensor Networks
A Review: Optimization of Energy in Wireless Sensor Networks Anjali 1, Navpreet Kaur 2 1 Department of Electronics & Communication, M.Tech Scholar, Lovely Professional University, Punjab, India 2Department
More informationRESEARCH ARTICLE. Accelerating Ant Colony Optimization for the Traveling Salesman Problem on the GPU
The International Journal of Parallel, Emergent and Distributed Systems Vol. 00, No. 00, Month 2011, 1 21 RESEARCH ARTICLE Accelerating Ant Colony Optimization for the Traveling Salesman Problem on the
More informationAnt Colony Optimization: The Traveling Salesman Problem
Ant Colony Optimization: The Traveling Salesman Problem Section 2.3 from Swarm Intelligence: From Natural to Artificial Systems by Bonabeau, Dorigo, and Theraulaz Andrew Compton Ian Rogers 12/4/2006 Traveling
More informationHybrid ant colony optimization algorithm for two echelon vehicle routing problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 3361 3365 Advanced in Control Engineering and Information Science Hybrid ant colony optimization algorithm for two echelon vehicle
More informationACCELERATING THE ANT COLONY OPTIMIZATION
ACCELERATING THE ANT COLONY OPTIMIZATION BY SMART ANTS, USING GENETIC OPERATOR Hassan Ismkhan Department of Computer Engineering, University of Bonab, Bonab, East Azerbaijan, Iran H.Ismkhan@bonabu.ac.ir
More informationFirst approach to solve linear system of equations by using Ant Colony Optimization
First approach to solve linear system equations by using Ant Colony Optimization Kamil Ksia z ek Faculty Applied Mathematics Silesian University Technology Gliwice Poland Email: kamiksi862@studentpolslpl
More informationOptimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO
Optimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO Nasir Mehmood1, Muhammad Umer2, Dr. Riaz Ahmad3, Dr. Amer Farhan Rafique4 F. Author, Nasir Mehmood is with National
More informationTasks Scheduling using Ant Colony Optimization
Journal of Computer Science 8 (8): 1314-1320, 2012 ISSN 1549-3636 2012 Science Publications Tasks Scheduling using Ant Colony Optimization 1 Umarani Srikanth G., 2 V. Uma Maheswari, 3.P. Shanthi and 4
More informationLECTURE 20: SWARM INTELLIGENCE 6 / ANT COLONY OPTIMIZATION 2
15-382 COLLECTIVE INTELLIGENCE - S18 LECTURE 20: SWARM INTELLIGENCE 6 / ANT COLONY OPTIMIZATION 2 INSTRUCTOR: GIANNI A. DI CARO ANT-ROUTING TABLE: COMBINING PHEROMONE AND HEURISTIC 2 STATE-TRANSITION:
More informationTHE OPTIMIZATION OF RUNNING QUERIES IN RELATIONAL DATABASES USING ANT-COLONY ALGORITHM
THE OPTIMIZATION OF RUNNING QUERIES IN RELATIONAL DATABASES USING ANT-COLONY ALGORITHM Adel Alinezhad Kolaei and Marzieh Ahmadzadeh Department of Computer Engineering & IT Shiraz University of Technology
More informationMETAHEURISTICS. Introduction. Introduction. Nature of metaheuristics. Local improvement procedure. Example: objective function
Introduction METAHEURISTICS Some problems are so complicated that are not possible to solve for an optimal solution. In these problems, it is still important to find a good feasible solution close to the
More informationACO with semi-random start applied on MKP
Proceedings of the International Multiconference on Computer Science and Information Technology pp. 887 891 ISBN 978-83-60810-22-4 ISSN 1896-7094 ACO with semi-random start applied on MKP Stefka Fidanova
More informationAnt Colony Optimization Exercises
Outline DM6 HEURISTICS FOR COMBINATORIAL OPTIMIZATION Lecture 11 Ant Colony Optimization Exercises Ant Colony Optimization: the Metaheuristic Application Examples Connection between ACO and other Metaheuristics
More informationAdaptive Model of Personalized Searches using Query Expansion and Ant Colony Optimization in the Digital Library
International Conference on Information Systems for Business Competitiveness (ICISBC 2013) 90 Adaptive Model of Personalized Searches using and Ant Colony Optimization in the Digital Library Wahyu Sulistiyo
More informationA Comparative Study for Efficient Synchronization of Parallel ACO on Multi-core Processors in Solving QAPs
2 IEEE Symposium Series on Computational Intelligence A Comparative Study for Efficient Synchronization of Parallel ACO on Multi-core Processors in Solving Qs Shigeyoshi Tsutsui Management Information
More informationA Parallel Implementation of Ant Colony Optimization
A Parallel Implementation of Ant Colony Optimization Author Randall, Marcus, Lewis, Andrew Published 2002 Journal Title Journal of Parallel and Distributed Computing DOI https://doi.org/10.1006/jpdc.2002.1854
More informationScalability of a parallel implementation of ant colony optimization
SEMINAR PAPER at the University of Applied Sciences Technikum Wien Game Engineering and Simulation Scalability of a parallel implementation of ant colony optimization by Emanuel Plochberger,BSc 3481, Fels
More informationSolving Permutation Constraint Satisfaction Problems with Artificial Ants
Solving Permutation Constraint Satisfaction Problems with Artificial Ants Christine Solnon 1 Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization
More informationSwarm Intelligence (Ant Colony Optimization)
(Ant Colony Optimization) Prof. Dr.-Ing. Habil Andreas Mitschele-Thiel M.Sc.-Inf Mohamed Kalil 19 November 2009 1 Course description Introduction Course overview Concepts of System Engineering Swarm Intelligence
More informationNew algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems
Journal of Scientific & Industrial Research ESWARAMURTHY: NEW ALGORITHM FOR ANALYZING PERFORMANCE OF NEIGHBORHOOD STRATEGIES 579 Vol. 67, August 2008, pp. 579-588 New algorithm for analyzing performance
More informationVariable Neighbourhood Search (VNS)
Variable Neighbourhood Search (VNS) Key dea: systematically change neighbourhoods during search Motivation: recall: changing neighbourhoods can help escape local optima a global optimum is locally optimal
More informationVariable Neighbourhood Search (VNS)
Variable Neighbourhood Search (VNS) Key dea: systematically change neighbourhoods during search Motivation: recall: changing neighbourhoods can help escape local optima a global optimum is locally optimal
More informationCombining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem
Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem Weichen Liu, Thomas Weise, Yuezhong Wu and Qi Qi University of Science and Technology of Chine
More informationHybrid Bionic Algorithms for Solving Problems of Parametric Optimization
World Applied Sciences Journal 23 (8): 1032-1036, 2013 ISSN 1818-952 IDOSI Publications, 2013 DOI: 10.5829/idosi.wasj.2013.23.08.13127 Hybrid Bionic Algorithms for Solving Problems of Parametric Optimization
More informationTwo models of the capacitated vehicle routing problem
Croatian Operational Research Review 463 CRORR 8(2017), 463 469 Two models of the capacitated vehicle routing problem Zuzana Borčinová 1, 1 Faculty of Management Science and Informatics, University of
More informationTask Scheduling Using Probabilistic Ant Colony Heuristics
The International Arab Journal of Information Technology, Vol. 13, No. 4, July 2016 375 Task Scheduling Using Probabilistic Ant Colony Heuristics Umarani Srikanth 1, Uma Maheswari 2, Shanthi Palaniswami
More informationIMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM
IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM Er. Priya Darshni Assiociate Prof. ECE Deptt. Ludhiana Chandigarh highway Ludhiana College Of Engg. And Technology Katani
More informationAn Ant Colony Optimization Algorithm to Solve the Minimum Cost Network Flow Problem with Concave Cost Functions
An Ant Colony Optimization Algorithm to Solve the Minimum Cost Network Flow Problem with Concave Cost Functions Marta S. R. Monteiro Faculdade de Economia and LIAAD-INESC Porto L.A., Universidade do Porto
More informationAnt Colony Optimization Parallel Algorithm for GPU
Ant Colony Optimization Parallel Algorithm for GPU Honours Project - COMP 4905 Carleton University Karim Tantawy 100710608 Supervisor: Dr. Tony White, School of Computer Science April 10 th 2011 Abstract
More informationANT COLONY OPTIMIZATION FOR MANUFACTURING RESOURCE SCHEDULING PROBLEM
ANT COLONY OPTIMIZATION FOR MANUFACTURING RESOURCE SCHEDULING PROBLEM Wang Su, Meng Bo Computer School, Wuhan University, Hubei Province, China; Email: zzwangsu@63.com. Abstract: Key words: Effective scheduling
More informationAn Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem
1 An Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem Krishna H. Hingrajiya, Ravindra Kumar Gupta, Gajendra Singh Chandel University of Rajiv Gandhi Proudyogiki Vishwavidyalaya,
More informationGrouping Genetic Algorithm with Efficient Data Structures for the University Course Timetabling Problem
Grouping Genetic Algorithm with Efficient Data Structures for the University Course Timetabling Problem Felipe Arenales Santos Alexandre C. B. Delbem Keywords Grouping Genetic Algorithm Timetabling Problem
More informationApplying Opposition-Based Ideas to the Ant Colony System
Applying Opposition-Based Ideas to the Ant Colony System Alice R. Malisia, Hamid R. Tizhoosh Department of Systems Design Engineering, University of Waterloo, ON, Canada armalisi@uwaterloo.ca, tizhoosh@uwaterloo.ca
More informationNavigation of Multiple Mobile Robots Using Swarm Intelligence
Navigation of Multiple Mobile Robots Using Swarm Intelligence Dayal R. Parhi National Institute of Technology, Rourkela, India E-mail: dayalparhi@yahoo.com Jayanta Kumar Pothal National Institute of Technology,
More informationOpen Vehicle Routing Problem Optimization under Realistic Assumptions
Int. J. Research in Industrial Engineering, pp. 46-55 Volume 3, Number 2, 204 International Journal of Research in Industrial Engineering www.nvlscience.com Open Vehicle Routing Problem Optimization under
More informationSolution Bias in Ant Colony Optimisation: Lessons for Selecting Pheromone Models
Solution Bias in Ant Colony Optimisation: Lessons for Selecting Pheromone Models James Montgomery Faculty of Information & Communication Technologies Swinburne University of Technology, VIC 3122, Australia
More informationScheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm
Scheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm Binggang Wang, Yunqing Rao, Xinyu Shao, and Mengchang Wang The State Key Laboratory of Digital Manufacturing Equipment and
More informationAnt Colony Optimization: A Component-Wise Overview
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Ant Colony Optimization: A Component-Wise Overview M. López-Ibáñez, T. Stützle,
More informationAnt Colony Optimization Approaches to the Degree-constrained Minimum Spanning Tree Problem
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 1081-1094 (2008) Ant Colony Optimization Approaches to the Degree-constrained Minimum Spanning Tree Problem Faculty of Information Technology Multimedia
More informationAn Iterative Improvement Search and Binary Particle Swarm Optimization for Large Capacitated Multi Item Multi Level Lot Sizing (CMIMLLS) Problem
An Iterative Improvement Search and Binary Particle Swarm Optimization for Large Capacitated Multi Item Multi Level Lot Sizing (CMIMLLS) Problem V.V.D.Sahithi 1,P.Sai Krishna 2,K.Lalithkumar 3,C.S.P.Rao
More informationKNAPSACK BASED ACCS INFORMATION RETRIEVAL FRAMEWORK FOR BIO-MEDICAL LITERATURE USING SIMILARITY BASED CLUSTERING APPROACH.
KNAPSACK BASED ACCS INFORMATION RETRIEVAL FRAMEWORK FOR BIO-MEDICAL LITERATURE USING SIMILARITY BASED CLUSTERING APPROACH. 1 K.Latha 2 S.Archana 2 R.John Regies 3 Dr. Rajaram 1 Lecturer of Information
More information6. Tabu Search 6.1 Basic Concepts. Fall 2010 Instructor: Dr. Masoud Yaghini
6. Tabu Search 6.1 Basic Concepts Fall 2010 Instructor: Dr. Masoud Yaghini Outline Tabu Search: Part 1 Introduction Illustrative Problems Search Space Neighborhood Structure Tabus Aspiration Criteria Termination
More informationA Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems
Gutenberg School of Management and Economics Discussion Paper Series A Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems Michael Drexl March 202 Discussion paper
More informationarxiv: v1 [cs.ai] 9 Oct 2013
The Generalized Traveling Salesman Problem solved with Ant Algorithms arxiv:1310.2350v1 [cs.ai] 9 Oct 2013 Camelia-M. Pintea, Petrică C. Pop, Camelia Chira North University Baia Mare, Babes-Bolyai University,
More informationHop-constrained Minimum Spanning Tree Problems in Nonlinear Cost Network Flows: an Ant Colony Optimization Approach
Noname manuscript No. (will be inserted by the editor) Hop-constrained Minimum Spanning Tree Problems in Nonlinear Cost Network Flows: an Ant Colony Optimization Approach Marta S.R. Monteiro Dalila B.M.M.
More information