ALGORITHM SYSTEMS FOR COMBINATORIAL OPTIMIZATION: HIERARCHICAL MULTISTAGE FRAMEWORK
|
|
- Arlene Cole
- 5 years ago
- Views:
Transcription
1 ALGORITHM SYSTEMS FOR COMBINATORIAL OPTIMIZATION: HIERARCHICAL MULTISTAGE FRAMEWORK Dr. Mark Sh. Levin, The Research Inst., The College Judea & Samaria, Ariel, Israel Introduction In recent decades, signicance heuristic approaches to combinatorial optimization s is increasing. The situation is based on the fact that majority real applied s are very complicated and require composite heuristic solving schemes which can be considered as hierarchical multi-stage algorithm systems. Thus it is reasonable to examine systems engineering approach to a design the algorithm systems. The list traditional well-known heuristic approaches involves the following [1, 2, 4, 5,, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 21, etc.]: (1) approximation solving schemes; (2) genetic algorithms and evolutionary computing; (3) tabu-search; (4) simulated annealing; (5) greedy algorithms; () constraint satisfaction approach; and (7) probabilistic approaches. In our opinion, a basic trend in the eld heuristic design for combinatorial optimization is the following: FROM algorithms [1, etc.] TO algorithm frameworks [1, etc.]. A three-stage algorithm framework is described for a sport timetabling by Nemhauser and Trick [1]. Multi-stage algorithm systems have been proposed in works Glover et al. [5,, etc.]. Moreover, the heuristic algorithm systems can be considered as specic solving environments which have been studied in recent years [3, etc.]. In the paper, a structure the systems, kinds and basic algorithm frameworks are proposed which can be considered as a step to the design the algorithm systems. Hierarchy System The essense the contemporary novelty in this eld is based on the following: eectiveness simple algorithmic schemes is limited and it is reasonable to build more complex multi-level, hierarchical solving frameworks which involve series-parallel and adaptive solving. A structure the algorithm system can be analyzed as follows: 1. Control unit (planning, adaptation): (a) selection corresponding basic algorithms, and (b) design composite solving strategy. 2. Level execution: (a) analysis an initial, (b) execution a solving, and (c) analysis. 3. Level bases / repositories: (a) s and examples, (b) algorithms and procedures, and (c) solving strategies.
2 Kinds System Structure Here let us examine basic kinds algorithm systems structures. First, let us point out main parameters the algotihm systems: 1. Kind algorithm base: (a) one-algorithm framework; (b) algorithm set with parallel execution the algorithms; and (c) complex multistage algorithm framework (e.g., series, series-parallel, etc.). 2. Feedback: (a) without feedback; (b) with feedback two types as follows: (i) analysis resultant solution; and / or (ii) analysis intermediate. 3. Kind algorithm framework (scheme, composite strategy) synthesis: (a) xed algorithm framework (algorithm strategy); (b) exible design algorithm framework (e.g., selection standard algorithm strategies, synthesis new algorithm frameworks). Thus the following functional operations have to be examined: (1) analysis (input), (2) solving, (3) analysis, (4) modication / selection algorithm, (5) selection / synthesis an algorithm set, () aggregation, and (7) selection / synthesis an algorithm scheme. Clearly, the simplest solving scheme involves initial, solving, result, and result analysis). Figs. 1, 2, 3, and 4 depict possible more complicated situations (e.g., parametric modication / selection algorithm, selection / design algorithm scheme). Initial - Modication algorithm (algorithm) Fig. 1. Simple one-algorithm framework (output) - Initial - Modication & selection algorithm (algorithm) (output) - Repository s Fig. 2. One-algorithm framework with algorithm base Note it is possible to add into the multi-algorihtm framework at Fig. 2 a block for aggregation which were obtained on the basis dierent algorithms.
3 Initial - Modication & selection algorithms (algorithms) (output) - Repository s Fig. 3. Multi-algorithm framework with algorithm base Initial - Design algorithm scheme (scheme) (output) - Repository s Scheme Methods for scheme synthesis Fig. 4. Multi-algorithm scheme framework Some Frameworks Our list the some prospecitve solving schemes (frameworks) consists the following non-typical schemes and/or models: Framework 1. Hierarchical morphological approach on the basis morphological clique including steps as follows [12]: (1.1) decomposition, (1.2) searching for multialternative local decisions, and (1.3) integration local decisions into global decisions for the initial. Framework 2. Multi-level framework on the basis k-exchange techniques [19, 20]: (2.1) hierarchical base k-exchange heuristics; (2.2) special control unit for the following: (i) analysis an individual, (ii) planning the solving (selection algorithms and synthesis solving strategy); and (2.3) analysis intermediate and correction solving. Framework 3. Repository approach [13]: (3.1) model repository; (3.2) analysis and approximation initial on the basis repository; and (3.3) selection and/or design algorithmic schemes. Framework 4. Spacelling curves approach including their generation on the basis various
4 kinds fractals [2, etc.]. Here we do not examine issues special decomposition approaches. We guess the use some well-known decomposition algorithms (e.g., clustering) will be sucient. The stage planning (design solving composite strategies) has to be based on multicriteria decision making and system integration methods which are basic ones in systems engineering [12, etc.]. Table 1 depicts correspondence the frameworks and classes applied s. Framework Morphological approach Framework on the basis k-exchange technique Framework on the basis repositories Spacelling curves Table. 1. Frameworks and Problems Classes Combinatorial Problems Scheduling TSP Minimal Problem Steiner Tree Problem * * * * * * * * Allocation/ Assignment Problem * Example Series-Parallel Framework Here an example series-parallel solving strategy is described (multicriteria ranking alternatives) [12]. The approach was implemented in DSS COMBI [12, etc.]. In the main, an information part decision support system involves the following components: (1) (alternatives, criteria, multicriteria estimates alternatives upon criteria, preference relations); and (2) tools for management. We consider the following types information: (mainly, preference relations) R j (j = 0; :::3): (1) initial information as alternatives, criteria, multicriteria estimates (R 0 ); (2) preference relation on alternatives (R 1 ); (3) intermediate linear ordering alternatives (R 2 ); (4) ranking alternatives (R 3 ) i.e., generation a priority for each alternatives. The following ing operations are the basic ones: (i) basic ing; (ii) aggregation ; and (iii) parallelization solving. Thus we point out the following hierarchy the solving : (1) algorithms and /or interactive procedures; (2) series-parallel composite strategies (including series-parallel) (3) scenaria (strategy framework that includes stages result analysis and feedback too). The composite strategy for multicriteria ranking consists the following three stages: R 0 =) R 1 =) R 2 =) R 3 or S = H T U where H corresponds to the design R 1 : T corresponds to the design R 2 ; and U corresponds to the design R 3. Considered basic local techniques (algorithms and procedures) are the following:
5 Stage H: pairwise comparison (H 1 ); ELECTRE-like technique (H 2 ); technique additive utility function (H 3 ); and expert stratication (H 4 ). Stage T : line elements sum preference matrix (T 1 ); technique additive utility function (T 2 ); series revelation maximal elements (T 3 ); series revelation Pareto-eective elements (T 4 ); and expert stratication (T 5 ). Stage U: series revelation maximal elements (U 1 ); series revelation Pareto-eective elements (U 2 ); dividing linear ranking (U 3 ); and expert stratication (U 4 ). The design morphological space and an example series-parallel composite strategy are depicted in Fig. 5. Solving strategy S = H T U S 1 &S 2 &S 3 = (H 4 T 5 U 4 )&(H 2 T 1 U 3 )&(H 2 T 3 U 1 ) Generation preference relations R 1 x Generation linear ordering R 2 Ranking R 3 e e e H 1 T 1 U 1 H 2 H 3 H 4 H T U T 2 T 3 T 4 T 5 Fig. 5. Resultant design morphology U 2 U 3 U 4 Conclusion We have examined solving frameworks for some combinatorial optimization s. It is reasonable to point out the following directions future research: 1. Design and analysis several non-standard heuristic solving schemes above including the selection and design composite solving strategies. 2. Application the above-mentioned heuristic solving schemes for well-known combinatorial optimization s (scheduling, TSP, assignment / allocation, etc.). 3. using the solving schemes above for multicriteria situations. 4. Studies some signicant applications (e.g., facilities design / planning, scheduling, network design, channel / frequency assignment, team design). The research was supported by the Center Absorption in Science, The Ministry Absorption, State Israel. References 1. Ball, M. and Magazine, M. (1981), "The Design and Heuristics", Networks, Vol. 11, No. 2, pp Bartholdi, J.J., III and Platzman, L.K. (1989), "Spacelling Curves and the Planar Travelling Salesman Problem", J. the ACM, Vol. 34, No. 4, pp Gallopoulos, E., Houstis, N.E. and Rice, J.R. (1995), "Workshop on Problem-Solving Enviroments: Findings and Recommendations", ACM Computing Surveys, Vol. 27, No. 2, pp
6 4. Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability. The Guide to the Theory NP-Completeness, San-Francisco, W.H. Freeman and Company. 5. Glover, F., Klingman, D., Phillips, N. and Ross, T. (1985), "Integrating Modeling, Design and Computational Implementation to Solve Large Scale Non-Linear Mixed Integer Programming Problems", In Annals Operations Research, C. Monma, ed., Vol. 5, pp Glover, F. and Laguna, M. (1997), Tabu Search, Boston, Kluwer. 7. Goldberg, D.E. (1989), Genetic in Search, Optimization and Machine Learning, Mass: Addison-Wesley, Reading. 8. Himmelblau, D.M., ed. (1973), Decomposition Large-Scale Problems, New York, North-Holland. 9. Holland, J.H. (1975), Adaptation in Natural and articial Systems, Ann Arbor, Michigan, Univ. Michigan Press. 10. Karp, R. (1997), "Probabilistic Partitioning for the Traveling- Salesman Problem", Mathematics Operations Research, Vol. 2, No. 3, pp Laporte, G. and Osman, I., eds. (1995), Metaheuristics in Combinatorial Optimization, Annals Operations Research, Vol. 9, Amsterdam, Baltzer. 12. Levin, M.Sh. (1998), Combinatorial Engineering Decomposable Systems, Dordrecht, Kluwer. 13. Levin, M.Sh., Sethi, S. and Sriskandarajah, S. (1998), "Towards Assignment-like Facilities Layout Problem", Unpublished Manuscript, Univ. Toronto. 14. Mackworth, A.K. (1987), "Constraint Satisfaction", in Encyclopedia on Articial Intelligence, S.C. Shapiro, ed., New York, J.Wiley & Sons, pp Michalewicz, M.D. (199), Genetic s + Data Structure = Evolutionary Programs, 3rd ed., Berlin, Springer-Verlag. 1. Nemhauser, G.L. and Trick, M.A. (1998), "Scheduling a Major College Basketball Conference", Operations Research, Vol. 4, No. 1, pp Pearl, J. (198), Heuristics, Prentice-Hall. 18. Reeves, C.R. (1995), Modern Heuristic Techniques for Combinatorial Problems, New York, J.Wiley & Sons. 19. Reinelt, G. (1994), The Traveling Salesman, LNCS, Vol. 840, Berlin, Springer-Verlag. 20. Sidney, J.B. and Levin, M.Sh. (1998), "K-exchange Technique for Optimization Over Permutations", Working Paper No , Univ. Ottawa, Faculty Business Administration. 21. Ulungu, E.L. and Teghem, J. (1994), "Multi-objective Combinatorial Optimization Problems: A Survey", J. Multi-Criteria Decision, Vol. 3, No. 2, pp
Multicriteria Steiner Tree Problem for Communication Network
!#"$&%'%(()*+ -,/.(''0'$&%(1, 2 $%1%(4365798;: =A@B8DCFE9GAHI5JLK7, MNPORQTSVUXWYZMQ[N\YI]?^I_PǸ QTaRQcbcdeMFNf]gǸ bhmnp]g]gscmfǹ bei-djikyz]gu i Multicriteria Steiner Tree Problem for Communication
More informationarxiv: v2 [cs.dc] 18 Dec 2016
arxiv:1612.04519v2 [cs.dc] 18 Dec 2016 Data allocation on disks with solution reconfiguration (problems, heuristics) Mark Sh. Levin The paper addresses problem of data allocation in two-layer computer
More informationSPATIAL OPTIMIZATION METHODS
DELMELLE E. (2010). SPATIAL OPTIMIZATION METHODS. IN: B. WHARF (ED). ENCYCLOPEDIA OF HUMAN GEOGRAPHY: 2657-2659. SPATIAL OPTIMIZATION METHODS Spatial optimization is concerned with maximizing or minimizing
More informationAdaptive Tabu Search for Traveling Salesman Problems
Adaptive Tabu Search for Traveling Salesman Problems S. Suwannarongsri and D. Puangdownreong Abstract One of the most intensively studied problems in computational mathematics and combinatorial optimization
More information2ND INTERNATIONAL CONFERENCE ON METAHEURISTICS - MIC97 1. Graduate School of Engineering, Kyoto University
2ND INTERNATIONAL CONFERENCE ON METAHEURISTICS - MIC97 1 A Variable Depth Search Algorithm for the Generalized Assignment Problem Mutsunori Yagiura 1, Takashi Yamaguchi 1 and Toshihide Ibaraki 1 1 Department
More informationGraph Vertex Colorability & the Hardness. Mengfei Cao COMP-150 Graph Theory Tufts University
Dec. 15 th, Presentation for Final Project Graph Vertex Colorability & the Hardness Mengfei Cao COMP-150 Graph Theory Tufts University Framework In General: Graph-2-colorability is in N Graph-3-colorability
More informationSolution of P versus NP problem
Algorithms Research 2015, 4(1): 1-7 DOI: 105923/jalgorithms2015040101 Solution of P versus NP problem Mustapha Hamidi Meknes, Morocco Abstract This paper, taking Travelling Salesman Problem as our object,
More informationAn Algorithm for Solving the Traveling Salesman Problem
JKAU: Eng. Sci.. vol. 4, pp. 117 122 (1412 A.H.l1992 A.D.) An Algorithm for Solving the Traveling Salesman Problem M. HAMED College ofarts and Science, Bahrain University, [sa Town, Bahrain ABSTRACT. The
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 informationDynamically Configured λ-opt Heuristics for Bus Scheduling
Dynamically Configured λ-opt Heuristics for Bus Scheduling Prapa Rattadilok and Raymond S K Kwan School of Computing, University of Leeds, UK {prapa, rsk}@comp.leeds.ac.uk Bus scheduling is a complex combinatorial
More informationAttractor of Local Search Space in the Traveling Salesman Problem
Attractor of Local Search Space in the Traveling Salesman Problem WEIQI LI School of Management University of Michigan - Flint 303 East Kearsley Street, Flint, Michigan 48502 U. S. A. Abstract: - A local
More informationA Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem
A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem Richard E. Mowe Department of Statistics St. Cloud State University mowe@stcloudstate.edu Bryant A. Julstrom Department
More informationDept. of Computer Science. The eld of time series analysis and forecasting methods has signicantly changed in the last
Model Identication and Parameter Estimation of ARMA Models by Means of Evolutionary Algorithms Susanne Rolf Dept. of Statistics University of Dortmund Germany Joachim Sprave y Dept. of Computer Science
More informationHEURISTIC ALGORITHMS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
Proceedings of the International Conference on Theory and Applications of Mathematics and Informatics - ICTAMI 24, Thessaloniki, Greece HEURISTIC ALGORITHMS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
More informationAnale. Seria Informatică. Vol. X fasc Annals. Computer Science Series. 10 th Tome 1 st Fasc. 2012
Anale. Seria Informatică. Vol. X fasc. 1 2012 9 HEURISTIC ALGORITHM FOR GRAPH COLORING BASED ON MAXIMUM INDEPENDENT SET Hilal Al Mara beh, Amjad Suleiman Department Basic Science King Saud bin Abdulaziz
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 informationA Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time
A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time S. Suresh 1, V. Mani 1, S. N. Omkar 1, and H. J. Kim 2 1 Department of Aerospace Engineering,
More informationImproved K-Means Algorithm for Capacitated Clustering Problem
Improved K-Means Algorithm for Capacitated Clustering Problem S. GEETHA 1 G. POONTHALIR 2 P. T. VANATHI 3 PSG College of Technology Tamil Nadu India 1 geet_shan@yahoo.com 2 thalirkathir@rediffmail.com
More informationa a b b a a a a b b b b
Category: Genetic Algorithms Interactive Genetic Algorithms for the Traveling Salesman Problem Sushil Louis Genetic Adaptive Systems LAB Dept. of Computer Science/171 University of Nevada, Reno Reno, NV
More informationOn the Complexity of Broadcast Scheduling. Problem
On the Complexity of Broadcast Scheduling Problem Sergiy Butenko, Clayton Commander and Panos Pardalos Abstract In this paper, a broadcast scheduling problem (BSP) in a time division multiple access (TDMA)
More informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
More informationThe metric travelling salesman problem: pareto-optimal heuristic algorithms
295 The metric travelling salesman problem: pareto-optimal heuristic algorithms Ekaterina Beresneva Faculty of Computer Science National Research University Higher School of Economics Moscow, Russia, +7(925)538-40-58
More informationTwo new variants of Christofides heuristic for the Static TSP and a computational study of a nearest neighbor approach for the Dynamic TSP
Two new variants of Christofides heuristic for the Static TSP and a computational study of a nearest neighbor approach for the Dynamic TSP Orlis Christos Kartsiotis George Samaras Nikolaos Margaritis Konstantinos
More informationParallel Path-Relinking Method for the Flow Shop Scheduling Problem
Parallel Path-Relinking Method for the Flow Shop Scheduling Problem Wojciech Bożejko 1 and Mieczys law Wodecki 2 1 Wroc law University of Technology Institute of Computer Engineering, Control and Robotics
More informationThe Heuristic Strategy Implementation to the Hopfield -Tank TSP Neural Algorithm
The Heuristic Strategy Implementation to the Hopfield -Tank TSP Neural Algorithm N. Kovač, S. Bauk Faculty of Maritime Studies, University of Montenegro Dobrota 36, 85 330 Kotor, Serbia and Montenegro
More informationA Genetic Approach to Analyze Algorithm Performance Based on the Worst-Case Instances*
J. Software Engineering & Applications, 21, 3, 767-775 doi:1.4236/jsea.21.3889 Published Online August 21 (http://www.scirp.org/journal/jsea) 767 A Genetic Approach to Analyze Algorithm Performance Based
More informationImproved Large-Step Markov Chain Variants for the Symmetric TSP
Journal of Heuristics, 3, 63 81 (1997) c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. Improved Large-Step Markov Chain Variants for the Symmetric TSP INKI HONG, ANDREW B. KAHNG UCLA
More informationON THE COMPLEXITY OF THE BROADCAST SCHEDULING PROBLEM
ON THE COMPLEXITY OF THE BROADCAST SCHEDULING PROBLEM SERGIY I. BUTENKO, CLAYTON W. COMMANDER, AND PANOS M. PARDALOS Abstract. In this paper, a Broadcast Scheduling Problem (bsp) in a time division multiple
More informationComplete Local Search with Memory
Complete Local Search with Memory Diptesh Ghosh Gerard Sierksma SOM-theme A Primary Processes within Firms Abstract Neighborhood search heuristics like local search and its variants are some of the most
More informationis the Capacitated Minimum Spanning Tree
Dynamic Capacitated Minimum Spanning Trees Raja Jothi and Balaji Raghavachari Department of Computer Science, University of Texas at Dallas Richardson, TX 75083, USA raja, rbk @utdallas.edu Abstract Given
More informationSome Approximation Algorithms for Constructing Combinatorial Structures Fixed in Networks
Some Approximation Algorithms for Constructing Combinatorial Structures Fixed in Networks Jianping Li Email: jianping@ynu.edu.cn Department of Mathematics Yunnan University, P.R. China 11 / 31 8 ¹ 1 3
More informationA memetic algorithm for symmetric traveling salesman problem
ISSN 1750-9653, England, UK International Journal of Management Science and Engineering Management Vol. 3 (2008) No. 4, pp. 275-283 A memetic algorithm for symmetric traveling salesman problem Keivan Ghoseiri
More informationOn-line Steiner Trees in the Euclidean Plane
On-line Steiner Trees in the Euclidean Plane Noga Alon Yossi Azar Abstract Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph
More informationLinear and Integer Programming (ADM II) Script. Rolf Möhring WS 2010/11
Linear and Integer Programming (ADM II) Script Rolf Möhring WS 200/ Contents -. Algorithmic Discrete Mathematics (ADM)... 3... 4.3 Winter term 200/... 5 2. Optimization problems 2. Examples... 7 2.2 Neighborhoods
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 informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Introduction and Motivation Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Organizational Stuff Lectures: Tuesday 11:00 12:30 in room SR015 Cover
More informationNetwork Routing Protocol using Genetic Algorithms
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:0 No:02 40 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali Abstract This paper aims to develop a
More informationPareto Recommendation via Graph-Based Modeling for Interactive Decision-Making
Pareto Recommendation via Graph-Based Modeling for Interactive Decision-Making Dr. Ofer M. Shir School of Computer Science, Tel-Hai College, Israel ofersh@telhai.ac.il Based on a recent paper that appeared
More informationSolving ISP Problem by Using Genetic Algorithm
International Journal of Basic & Applied Sciences IJBAS-IJNS Vol:09 No:10 55 Solving ISP Problem by Using Genetic Algorithm Fozia Hanif Khan 1, Nasiruddin Khan 2, Syed Inayatulla 3, And Shaikh Tajuddin
More informationRuled Based Approach for Scheduling Flow-shop and Job-shop Problems
Ruled Based Approach for Scheduling Flow-shop and Job-shop Problems Mohammad Komaki, Shaya Sheikh, Behnam Malakooti Case Western Reserve University Systems Engineering Email: komakighorban@gmail.com Abstract
More informationHybrid approach for solving TSP by using DPX Cross-over operator
Available online at www.pelagiaresearchlibrary.com Advances in Applied Science Research, 2011, 2 (1): 28-32 ISSN: 0976-8610 CODEN (USA): AASRFC Hybrid approach for solving TSP by using DPX Cross-over operator
More informationThe NP-Completeness of Some Edge-Partition Problems
The NP-Completeness of Some Edge-Partition Problems Ian Holyer y SIAM J. COMPUT, Vol. 10, No. 4, November 1981 (pp. 713-717) c1981 Society for Industrial and Applied Mathematics 0097-5397/81/1004-0006
More informationA B. A: sigmoid B: EBA (x0=0.03) C: EBA (x0=0.05) U
Extending the Power and Capacity of Constraint Satisfaction Networks nchuan Zeng and Tony R. Martinez Computer Science Department, Brigham Young University, Provo, Utah 8460 Email: zengx@axon.cs.byu.edu,
More informationImproved Genetic Algorithm to Solve Asymmetric Traveling Salesman Problem
Int. J. Open Problems Compt. Math., Vol. 9, No. 4, December 2016 ISSN 1998-6262; Copyright ICSRS Publication, 2016 www.i-csrs.org Improved Genetic Algorithm to Solve Asymmetric Traveling Salesman Problem
More informationGraph Coloring Algorithms for Assignment Problems in Radio Networks
c 1995 by Lawrence Erlbaum Assoc. Inc. Pub., Hillsdale, NJ 07642 Applications of Neural Networks to Telecommunications 2 pp. 49 56 (1995). ISBN 0-8058-2084-1 Graph Coloring Algorithms for Assignment Problems
More informationInternational Journal of Current Trends in Engineering & Technology Volume: 02, Issue: 01 (JAN-FAB 2016)
Survey on Ant Colony Optimization Shweta Teckchandani, Prof. Kailash Patidar, Prof. Gajendra Singh Sri Satya Sai Institute of Science & Technology, Sehore Madhya Pradesh, India Abstract Although ant is
More informationA Genetic Algorithm Approach to the Group Technology Problem
IMECS 008, 9- March, 008, Hong Kong A Genetic Algorithm Approach to the Group Technology Problem Hatim H. Sharif, Khaled S. El-Kilany, and Mostafa A. Helaly Abstract In recent years, the process of cellular
More informationA New Algorithm for Solving the Operation Assignment Problem in 3-Machine Robotic Cell Scheduling
Australian Journal of Basic and Applied Sciences, 5(12): 1578-1585, 211 ISSN 1991-8178 A New Algorithm for Solving the Operation Assignment Problem in 3-Machine Robotic Cell Scheduling 1 Mohammad Fathian,
More informationRevision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems
4 The Open Cybernetics and Systemics Journal, 008,, 4-9 Revision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems K. Kato *, M. Sakawa and H. Katagiri Department of Artificial
More informationAbstract. This paper shows how parallelism has been integrated into
Parallel Optimisation in the SCOOP Library Per Kristian Nilsen 1 and Nicolas Prcovic 2 1 SINTEF Applied Mathematics, Box 124 Blindern, 0314 Oslo, NORWAY E-mail: pkn@math.sintef.no 2 CERMICS-INRIA Sophia
More informationSurrogate Gradient Algorithm for Lagrangian Relaxation 1,2
Surrogate Gradient Algorithm for Lagrangian Relaxation 1,2 X. Zhao 3, P. B. Luh 4, and J. Wang 5 Communicated by W.B. Gong and D. D. Yao 1 This paper is dedicated to Professor Yu-Chi Ho for his 65th birthday.
More informationIntroduction to Approximation Algorithms
Introduction to Approximation Algorithms Subir Kumar Ghosh School of Technology & Computer Science Tata Institute of Fundamental Research Mumbai 400005, India ghosh@tifr.res.in Overview 1. Background 2.
More informationarxiv: v1 [cs.ai] 2 Sep 2008
MCDM 2006, Chania, Greece, June 19-23, 2006 FOUNDATIONS OF THE PARETO ITERATED LOCAL SEARCH METAHEURISTIC arxiv:0809.0406v1 [cs.ai] 2 Sep 2008 Martin Josef Geiger Lehrstuhl für Industriebetriebslehre Institut
More informationMeshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods
Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods Uei-Ren Chen 1, Chin-Chi Wu 2, and Woei Lin 3 1 Department of Electronic Engineering, Hsiuping Institute of Technology
More informationA Performance Comparison of Five Algorithms for Graph Isomorphism
A Performance Comparison of Five Algorithms for Graph Isomorphism P. Foggia, C.Sansone, M. Vento Dipartimento di Informatica e Sistemistica Via Claudio, 21 - I 80125 - Napoli, Italy {foggiapa, carlosan,
More information700 a a b b
Interactive Genetic Algorithms for the Traveling Salesman Problem Sushil J. Louis Genetic Adaptive Systems Lab Dept. of Computer Science/171 University ofnevada, Reno Reno, NV 89557 sushil@cs.unr.edu Abstract
More informationExtending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems
Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems Hamidullah Khan Niazi 1, Sun Hou-Fang 2, Zhang Fa-Ping 3, Riaz Ahmed 4 ( 1, 4 National University of Sciences and Technology
More informationSelection of Optimal Path in Routing Using Genetic Algorithm
Selection of Optimal Path in Routing Using Genetic Algorithm Sachin Kumar Department of Computer Science and Applications CH. Devi Lal University, Sirsa, Haryana Avninder Singh Department of Computer Science
More informationKey words. space allocation, optimisation, heuristics, hill climbing.
A COMPUTER BASED SYSTEM FOR SPACE ALLOCATIO OPTIMISATIO E.K. Burke, P. Cowling, J.D. Landa Silva, B. McCollum, D. Varley Automated Scheduling, Optimisation and Planning Group Department of Computer Science,
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 informationGENETIC ALGORITHMS OPTIMIZATION FOR THE MACHINE LAYOUT PROBLEM
GENETIC ALGORITHMS OPTIMIZATION FOR THE MACHINE LAYOUT PROBLEM Norhashimah Morad School of Industrial Technology Universiti Sains Malaysia 800, Minden, Penang Malaysia e-mail:nhashima@usm.my Abstract This
More informationNew Optimal Load Allocation for Scheduling Divisible Data Grid Applications
New Optimal Load Allocation for Scheduling Divisible Data Grid Applications M. Othman, M. Abdullah, H. Ibrahim, and S. Subramaniam Department of Communication Technology and Network, University Putra Malaysia,
More informationA Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling Repairman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling
More informationBI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP SCHEDULING PROBLEM. Minimizing Make Span and the Total Workload of Machines
International Journal of Mathematics and Computer Applications Research (IJMCAR) ISSN 2249-6955 Vol. 2 Issue 4 Dec - 2012 25-32 TJPRC Pvt. Ltd., BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP
More informationSOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH A SIMPLE GENETIC ALGORITHM
ISSN 1726-4529 Int j simul model 8 (2009) 4, 197-205 Original scientific paper SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH A SIMPLE GENETIC ALGORITHM Lestan, Z.; Brezocnik, M.; Buchmeister, B.; Brezovnik,
More informationA Parallel Architecture for the Generalized Traveling Salesman Problem
A Parallel Architecture for the Generalized Traveling Salesman Problem Max Scharrenbroich AMSC 663 Project Proposal Advisor: Dr. Bruce L. Golden R. H. Smith School of Business 1 Background and Introduction
More informationBottleneck Steiner Tree with Bounded Number of Steiner Vertices
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash Paz Carmi Matthew J. Katz June 18, 2011 Abstract Given a complete graph G = (V, E), where each vertex is labeled either
More informationMetaheuristics: a quick overview
Metaheuristics: a quick overview Marc Sevaux University of Valenciennes CNRS, UMR 8530, LAMIH / Production systems Marc.Sevaux@univ-valenciennes.fr Marc Sevaux TEW Antwerp 2003 1 Outline Outline Neighborhood
More informationParallel path-relinking method for the flow shop scheduling problem
Parallel path-relinking method for the flow shop scheduling problem Wojciech Bożejko 1 and Mieczys law Wodecki 2 1 Wroc law University of Technology Institute of Computer Engineering, Control and Robotics
More informationImproving Lin-Kernighan-Helsgaun with Crossover on Clustered Instances of the TSP
Improving Lin-Kernighan-Helsgaun with Crossover on Clustered Instances of the TSP Doug Hains, Darrell Whitley, and Adele Howe Colorado State University, Fort Collins CO, USA Abstract. Multi-trial Lin-Kernighan-Helsgaun
More informationInteger Programming and Network Modeis
H.A. Eiselt C.-L. Sandblom Integer Programming and Network Modeis With Contributions by K. Spielberg, E. Richards, B.T. Smith, G. Laporte, B.T. Boffey With 165 Figures and 43 Tables &m Springer CONTENTS
More informationAn ATM Network Planning Model. A. Farago, V.T. Hai, T. Cinkler, Z. Fekete, A. Arato. Dept. of Telecommunications and Telematics
An ATM Network Planning Model A. Farago, V.T. Hai, T. Cinkler, Z. Fekete, A. Arato Dept. of Telecommunications and Telematics Technical University of Budapest XI. Stoczek u. 2, Budapest, Hungary H-1111
More informationAn Efficient Technique to Test Suite Minimization using Hierarchical Clustering Approach
An Efficient Technique to Test Suite Minimization using Hierarchical Clustering Approach Fayaz Ahmad Khan, Anil Kumar Gupta, Dibya Jyoti Bora Abstract:- Software testing is a pervasive activity in software
More informationApplying Evolutionary Algorithms and the No Fit Polygon to the Nesting Problem
Applying Evolutionary Algorithms and the No Fit Polygon to the Nesting Problem Edmund Burke Department of Computer Science The University of Nottingham Nottingham NG7 2RD UK Graham Kendall Department of
More informationVISUALIZING NP-COMPLETENESS THROUGH CIRCUIT-BASED WIDGETS
University of Portland Pilot Scholars Engineering Faculty Publications and Presentations Shiley School of Engineering 2016 VISUALIZING NP-COMPLETENESS THROUGH CIRCUIT-BASED WIDGETS Steven R. Vegdahl University
More informationThe travelling thief problem: the first step in the transition from theoretical problems to realistic problems
The travelling thief problem: the first step in the transition from theoretical problems to realistic problems Mohammad Reza Bonyadi School of Computer Science The University of Adelaide, Adelaide, mrbonyadi@cs.adelaide.edu.au
More informationComparing the Best Maximum Clique Finding Algorithms, Which are Using Heuristic Vertex Colouring
Comparing the Best Maximum Clique Finding Algorithms, Which are Using Heuristic Vertex Colouring DENISS KUMLANDER Department of Informatics Tallinn University of Technology Raja St.15, 12617 Tallinn ESTONIA
More informationMA PM: memetic algorithms with population management
Computers & Operations Research 33 (2006) 1214 1225 www.elsevier.com/locate/cor MA PM: memetic algorithms with population management Kenneth Sörensen a,, Marc Sevaux b a University of Antwerp, Faculty
More informationUsing Penalties instead of Rewards: Solving OCST Problems with Problem-Specific Guided Local Search
Using Penalties instead of Rewards: Solving OCST Problems with Problem-Specific Guided Local Search Wolfgang Steitz, Franz Rothlauf Working Paper 01/2011 March 2011 Working Papers in Information Systems
More informationPrinciples of Optimization Techniques to Combinatorial Optimization Problems and Decomposition [1]
International Journal of scientific research and management (IJSRM) Volume 3 Issue 4 Pages 2582-2588 2015 \ Website: www.ijsrm.in ISSN (e): 2321-3418 Principles of Optimization Techniques to Combinatorial
More informationOPTICAL SOLUTIONS FOR THE UNBOUNDED SUBSET-SUM PROBLEM
International Journal of Innovative Computing, Information and Control ICIC International c 2008 ISSN 1349-4198 Volume 5, Number 8, August 2009 pp. 2159 2167 OPTICAL SOLUTIONS FOR THE UNBOUNDED SUBSET-SUM
More informationSOLVING TRAVELING SALESMAN PROBLEMS USING HEURISTIC LEARNING APPROACH
SOLVING TRAVELING SALESMAN PROBLEMS USING HEURISTIC LEARNING APPROACH Sim Kim Lau 1), Li-Yen Shue 2) 1) Department of Information Systems, University of Wollongong, Australia (simlau@uow.edu.au) 2) Department
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 informationRearrangement of DNA fragments: a branch-and-cut algorithm Abstract. In this paper we consider a problem that arises in the process of reconstruction
Rearrangement of DNA fragments: a branch-and-cut algorithm 1 C. E. Ferreira 1 C. C. de Souza 2 Y. Wakabayashi 1 1 Instituto de Mat. e Estatstica 2 Instituto de Computac~ao Universidade de S~ao Paulo e-mail:
More informationA primal dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Operations Research Letters 22 (1998) 111 118 A primal dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs Fabian A. Chudak a;1, Michel X. Goemans
More informationFINDING THE CHROMATIC NUMBER BY MEANS OF CRITICAL GRAPHS
FINDING THE CHROMATIC NUMBER BY MEANS OF CRITICAL GRAPHS Francine HERRMANN LITA, Université de Metz Ile de Saulcy 57045 Metz Cedex France Email : herrmann@lrim.sciences.univ-metz.fr and Alain HERTZ Département
More informationApproximating the Maximum Quadratic Assignment Problem 1
Approximating the Maximum Quadratic Assignment Problem 1 Esther M. Arkin Refael Hassin 3 Maxim Sviridenko 4 Keywords: Approximation algorithm; quadratic assignment problem 1 Introduction In the maximum
More informationTelecommunication and Informatics University of North Carolina, Technical University of Gdansk Charlotte, NC 28223, USA
A Decoder-based Evolutionary Algorithm for Constrained Parameter Optimization Problems S lawomir Kozie l 1 and Zbigniew Michalewicz 2 1 Department of Electronics, 2 Department of Computer Science, Telecommunication
More informationGenetic Hybrids for the. Quadratic Assignment Problem CHARLES FLEURENT AND JACQUES A. FERLAND. May 16, 1993
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 00, 0000 Genetic Hybrids for the Quadratic Assignment Problem CHARLES FLEURENT AND JACQUES A. FERLAND May 16, 1993 Abstract.
More informationA Two-Dimensional Mapping for the Traveling Salesman Problem
Computers Math. Apphc. Vol. 26, No. 12, pp. 65-73, 1993 0898-1221/93 $6.00 + 0.00 Printed in Great Britain. All rights reserved Copyright 1993 Pergarnon Press Ltd A Two-Dimensional Mapping for the Traveling
More informationIntroduction to Combinatorial Algorithms
Fall 2009 Intro Introduction to the course What are : Combinatorial Structures? Combinatorial Algorithms? Combinatorial Problems? Combinatorial Structures Combinatorial Structures Combinatorial structures
More informationResearch Article A Novel Metaheuristic for Travelling Salesman Problem
Industrial Volume 2013, Article ID 347825, 5 pages http://dx.doi.org/10.1155/2013/347825 Research Article A Novel Metaheuristic for Travelling Salesman Problem Vahid Zharfi and Abolfazl Mirzazadeh Industrial
More informationThe Data Organization
C V I T F E P A O TM The Data Organization 1251 Yosemite Way Hayward, CA 94545 (510) 303-8868 info@thedataorg.com By Rainer Schoenrank Data Warehouse Consultant May 2017 Copyright 2017 Rainer Schoenrank.
More informationREDUCING GRAPH COLORING TO CLIQUE SEARCH
Asia Pacific Journal of Mathematics, Vol. 3, No. 1 (2016), 64-85 ISSN 2357-2205 REDUCING GRAPH COLORING TO CLIQUE SEARCH SÁNDOR SZABÓ AND BOGDÁN ZAVÁLNIJ Institute of Mathematics and Informatics, University
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 informationRandomized rounding of semidefinite programs and primal-dual method for integer linear programming. Reza Moosavi Dr. Saeedeh Parsaeefard Dec.
Randomized rounding of semidefinite programs and primal-dual method for integer linear programming Dr. Saeedeh Parsaeefard 1 2 3 4 Semidefinite Programming () 1 Integer Programming integer programming
More informationTHE Multiconstrained 0 1 Knapsack Problem (MKP) is
An Improved Genetic Algorithm for the Multiconstrained 0 1 Knapsack Problem Günther R. Raidl Abstract This paper presents an improved hybrid Genetic Algorithm (GA) for solving the Multiconstrained 0 1
More informationarxiv:math/ v1 [math.co] 20 Nov 2005
THE DISTANCE OF A PERMUTATION FROM A SUBGROUP OF S n arxiv:math/0550v [math.co] 20 Nov 2005 RICHARD G.E. PINCH For Bela Bollobas on his 60th birthday Abstract. We show that the problem of computing the
More informationVladimir Dimitrijevic, Milan Milosavljevic, Milan Markovic. as: nd a minimum cost cycle which includes exactly one vertex from each
Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 7 (1996), 31{35. A BRANCH AND BOUND ALGORITHM FOR SOLVING A GENERALIZED TRAVELING SALESMAN PROBLEM Vladimir Dimitrijevic, Milan Milosavljevic, Milan Markovic
More informationGENERATIONAL MODEL GENETIC ALGORITHM FOR REAL WORLD SET PARTITIONING PROBLEMS
International Journal of Electronic Commerce Studies Vol.4, No.1, pp. 33-46, 2013 doi: 10.7903/ijecs.1138 GENERATIONAL MODEL GENETIC ALGORITHM FOR REAL WORLD SET PARTITIONING PROBLEMS Chi-san Althon Lin
More information