Food Food Food Nest Nest Nest

Size: px
Start display at page:

Download "Food Food Food Nest Nest Nest"

Transcription

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26 Food Food Food Nest Nest Nest

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42 instances solved to the optimum log CPU time in seconds ILS ACO

43

44 CPU time ACS - ILS (sec) log CPU time(sec) ILS tardiness factor range of due dates

45 instance 5: instance 2: instance 5: instance 2: instance 5: instance 2:

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60 optimal solutions CPU time(sec) neighborhood bound as percentage of size neighborhood bound as percentage of size

61

62

63

64

65

66

67 empirical solution probability instance 9 interchange right insert inter.+ins. inter.k=5+ins. ins.+inter. empirical solution probability instance 42 interchange right insert inter.+ins. inter.k=5+ins. ins.+inter. empirical solution probability instance 7 interchange right insert inter.+ins. inter.k=5+ins. ins.+inter. log CPU time(sec). log CPU time(sec) empirical solution probability instance 7 interchange right insert inter.+ins. inter.k=5+ins. ins.+inter. log CPU time(sec). log CPU time(sec)

68

69 .8 interchange kick right insert kick left insert kick 4, interchange.8 interchange kick right insert kick left insert kick 2, interchange interchange kick right insert kick left insert kick 4, insert.8 interchange kick right insert kick left insert kick 2, insert interchange kick right insert kick left insert kick 4, inter.+ins..8 interchange kick right insert kick left insert kick 2, inter.+ins interchange kick right insert kick left insert kick 4, ins.+inter..8 interchange kick right insert kick left insert kick 2, ins.+inter

70 empirical solution probability kick strength instance 4 empirical solution probability kick strength instance 38. log CPU time(sec). log CPU time(sec) empirical solution probability kick strength instance 86 empirical solution probability kick strength instance 2. log CPU time(sec) log CPU time(sec)

71

72

73

74

75

76 empirical solution probability neighborhood interchange insert inter.+ins. ins.+inter. half half instance 4 empirical solution probability neighborhood interchange insert inter.+ins. ins.+inter. half half instance 42 log CPU time(sec) log CPU time(sec) empirical solution probability neighborhood interchange insert inter.+ins. ins.+inter. half half instance 7 empirical solution probability neighborhood interchange insert inter.+ins. ins.+inter. half half instance 92 log CPU time(sec) log CPU time(sec)

77

78 empirical solution probability popsize 2 ants 6 ants ants 2 ants instance 42 empirical solution probability popsize 2 ants 6 ants ants 2 ants instance 67 log CPU time(sec) log CPU time(sec) empirical solution probability popsize 2 ants 6 ants ants 2 ants instance 92 empirical solution probability popsize 2 ants 6 ants ants 2 ants instance 7 log CPU time(sec). log CPU time(sec)

79

80 empirical solution probability instance 4 standard candidate list alt. update alt. action choice empirical solution probability instance 42 standard candidate list alt. update alt. action choice log CPU time(sec) log CPU time(sec) empirical solution probability instance 67 standard candidate list alt. update alt. action choice empirical solution probability instance 86 standard candidate list alt. update alt. action choice log CPU time(sec) log CPU time(sec)

81 empirical solution probability instance 9 pheromone position constraint adjacency constraint no pheromone empirical solution probability instance 38 pheromone position constraint adjacency constraint no pheromone log CPU time(sec) log CPU time(sec) empirical solution probability instance 92 pheromone position constraint adjacency constraint no pheromone empirical solution probability instance 2 pheromone position constraint adjacency constraint no pheromone log CPU time(sec) log CPU time(sec)

82 empirical solution probability heuristic EDD MDD AU no heuristic instance 9 empirical solution probability heuristic EDD MDD AU no heuristic instance 38 log CPU time(sec) log CPU time(sec) empirical solution probability heuristic EDD MDD AU no heuristic instance 92 empirical solution probability heuristic EDD MDD AU no heuristic instance 2 log CPU time(sec) log CPU time(sec)

83

84

85

86 solution probability instance 9 ILS ACO. log CPU time(sec) solution probability instance 9 ILS ACO. log CPU time(sec) solution probability instance 44 ILS ACO. log CPU time(sec) solution probability instance 45 ILS ACO log CPU time(sec) solution probability instance 48 ILS ACO. log CPU time(sec) solution probability instance 66 ILS ACO. log CPU time(sec) solution probability instance 67 ILS ACO. log CPU time(sec) solution probability instance 7 ILS ACO. log CPU time(sec) solution probability instance 88 ILS ACO log CPU time(sec) solution probability instance 93 ILS ACO. log CPU time(sec) solution probability instance 98 ILS ACO. log CPU time(sec) solution probability instance 2 ILS ACO log CPU time(sec) solution probability instance 4 ILS ACO log CPU time(sec) solution probability instance 6 ILS ACO. log CPU time(sec) solution probability instance 8 ILS ACO. log CPU time(sec) solution probability instance 2 ILS ACO log CPU time(sec) solution probability instance 22 ILS ACO log CPU time(sec) solution probability instance 23 ILS ACO. log CPU time(sec)

87 solution probability ILS ACO 2: log CPU time(sec) solution probability.4.2 ILS ACO 2:2 log CPU time(sec) solution probability ILS ACO 2:3 log CPU time(sec) solution probability ILS ACO 2:4 log CPU time(sec) solution probability ILS ACO 2:5 log CPU time(sec) solution probability ILS ACO 2:6 log CPU time(sec) solution probability ILS ACO 2:7 log CPU time(sec) solution probability ILS ACO 2:8 log CPU time(sec) solution probability ILS ACO 2:9 log CPU time(sec)

88

89

90 TF Tardiness Factor instance #

91 RDD Range of Due Dates instance #

92 TF RDD CPU time(sec) TF RDD CPU time(sec)

93 # runs min max mean Runs instance #

94

95 autocorrelation instance 38 move left insert right insert interchange invert steps

96

97

98

99 cost instance 9; uni-directional adjacency based distance cost instance 9; precendence based distance cost instance 9; position based distance cost instance 67; uni-directional adjacency based distance cost instance 67; precendence based distance cost instance 67; position based distance

100

101 distances between local optima avg max min

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

Ant Colony Optimization: an introduction. Daniel Chivilikhin

Ant Colony Optimization: an introduction. Daniel Chivilikhin Ant Colony Optimization: an introduction Daniel Chivilikhin 03.04.2013 Outline 1. Biological inspiration of ACO 2. Solving NP-hard combinatorial problems 3. The ACO metaheuristic 4. ACO for the Traveling

More information

Metaheuristics and Local Search

Metaheuristics and Local Search Metaheuristics and Local Search 8000 Discrete optimization problems Variables x 1,..., x n. Variable domains D 1,..., D n, with D j Z. Constraints C 1,..., C m, with C i D 1 D n. Objective function f :

More information

Metaheuristics and Local Search. Discrete optimization problems. Solution approaches

Metaheuristics and Local Search. Discrete optimization problems. Solution approaches Discrete Mathematics for Bioinformatics WS 07/08, G. W. Klau, 31. Januar 2008, 11:55 1 Metaheuristics and Local Search Discrete optimization problems Variables x 1,...,x n. Variable domains D 1,...,D n,

More information

Meta heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date

Meta heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date DOI 10.1186/s40064-015-1559-5 RESEARCH Open Access Meta heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date Zhenzhen Xu, Yongxing

More information

3D HP Protein Folding Problem using Ant Algorithm

3D HP Protein Folding Problem using Ant Algorithm 3D HP Protein Folding Problem using Ant Algorithm Fidanova S. Institute of Parallel Processing BAS 25A Acad. G. Bonchev Str., 1113 Sofia, Bulgaria Phone: +359 2 979 66 42 E-mail: stefka@parallel.bas.bg

More information

Part B" Ants (Natural and Artificial)! Langton s Vants" (Virtual Ants)! Vants! Example! Time Reversibility!

Part B Ants (Natural and Artificial)! Langton s Vants (Virtual Ants)! Vants! Example! Time Reversibility! Part B" Ants (Natural and Artificial)! Langton s Vants" (Virtual Ants)! 11/14/08! 1! 11/14/08! 2! Vants!! Square grid!! Squares can be black or white!! Vants can face N, S, E, W!! Behavioral rule:!! take

More information

New Instances for the Single Machine Total Weighted Tardiness Problem

New Instances for the Single Machine Total Weighted Tardiness Problem HELMUT-SCHMIDT-UNIVERSITÄT UNIVERSITÄT DER BUNDESWEHR HAMBURG LEHRSTUHL FÜR BETRIEBSWIRTSCHAFTSLEHRE, INSBES. LOGISTIK-MANAGEMENT Prof. Dr. M. J. Geiger Arbeitspapier / Research Report RR-10-03-01 March

More information

Outline. Ant Colony Optimization. Outline. Swarm Intelligence DM812 METAHEURISTICS. 1. Ant Colony Optimization Context Inspiration from Nature

Outline. Ant Colony Optimization. Outline. Swarm Intelligence DM812 METAHEURISTICS. 1. Ant Colony Optimization Context Inspiration from Nature DM812 METAHEURISTICS Outline Lecture 8 http://www.aco-metaheuristic.org/ 1. 2. 3. Marco Chiarandini Department of Mathematics and Computer Science University of Southern Denmark, Odense, Denmark

More information

Optimal Shape and Topology of Structure Searched by Ants Foraging Behavior

Optimal Shape and Topology of Structure Searched by Ants Foraging Behavior ISSN 0386-1678 Report of the Research Institute of Industrial Technology, Nihon University Number 83, 2006 Optimal Shape and Topology of Structure Searched by Ants Foraging Behavior Kazuo MITSUI* ( Received

More information

SINGLE MACHINE SEQUENCING Part 2. ISE480 Sequencing and Scheduling Fall semestre

SINGLE MACHINE SEQUENCING Part 2. ISE480 Sequencing and Scheduling Fall semestre SINGLE MACHINE SEQUENCING Part 2 2011 2012 Fall semestre Minimizing Total Weighted Flowtime In a common variation of the F-problem, obs do not have equal importance. One way of distinguishing the obs is

More information

Computational Intelligence in Product-line Optimization

Computational Intelligence in Product-line Optimization Computational Intelligence in Product-line Optimization Simulations and Applications Peter Kurz peter.kurz@tns-global.com June 2017 Restricted use Restricted use Computational Intelligence in Product-line

More information

A parallel metaheuristics for the single machine total weighted tardiness problem with sequence-dependent setup times

A parallel metaheuristics for the single machine total weighted tardiness problem with sequence-dependent setup times A parallel metaheuristics for the single machine total weighted tardiness problem with sequence-dependent setup times Wojciech Bożejko Wroc law University of Technology Institute of Computer Engineering,

More information

ARTIFICIAL INTELLIGENCE

ARTIFICIAL INTELLIGENCE BABEŞ-BOLYAI UNIVERSITY Faculty of Computer Science and Mathematics ARTIFICIAL INTELLIGENCE Solving search problems Informed local search strategies Nature-inspired algorithms March, 2017 2 Topics A. Short

More information

Flow Shop and Job Shop Models

Flow Shop and Job Shop Models Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 11 Flow Shop and Job Shop Models 1. Flow Shop 2. Job Shop Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Resume Permutation

More information

Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model

Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model Presented by Sayantika Goswami 1 Introduction Indian summer

More information

Capacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm

Capacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm Capacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm Bharat Solanki Abstract The optimal capacitor placement problem involves determination of the location, number, type

More information

Multi-Objective Scheduling Using Rule Based Approach

Multi-Objective Scheduling Using Rule Based Approach Multi-Objective Scheduling Using Rule Based Approach Mohammad Komaki, Shaya Sheikh, Behnam Malakooti Case Western Reserve University Systems Engineering Email: komakighorban@gmail.com Abstract Scheduling

More information

Convergence of Ant Colony Optimization on First-Order Deceptive Systems

Convergence of Ant Colony Optimization on First-Order Deceptive Systems Convergence of Ant Colony Optimization on First-Order Deceptive Systems Yixin Chen Washington University in St. Louis Department of Computer Science & Engineering St. Louis, MO 6330, USA chen@cse.wustl.edu

More information

Lecture 4 Scheduling 1

Lecture 4 Scheduling 1 Lecture 4 Scheduling 1 Single machine models: Number of Tardy Jobs -1- Problem 1 U j : Structure of an optimal schedule: set S 1 of jobs meeting their due dates set S 2 of jobs being late jobs of S 1 are

More information

Simple Dispatch Rules

Simple Dispatch Rules Simple Dispatch Rules We will first look at some simple dispatch rules: algorithms for which the decision about which job to run next is made based on the jobs and the time (but not on the history of jobs

More information

VNS for the TSP and its variants

VNS for the TSP and its variants VNS for the TSP and its variants Nenad Mladenović, Dragan Urošević BALCOR 2011, Thessaloniki, Greece September 23, 2011 Mladenović N 1/37 Variable neighborhood search for the TSP and its variants Problem

More information

Self-Adaptive Ant Colony System for the Traveling Salesman Problem

Self-Adaptive Ant Colony System for the Traveling Salesman Problem Proceedings of the 29 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 29 Self-Adaptive Ant Colony System for the Traveling Salesman Problem Wei-jie Yu, Xiao-min

More information

Artificial Intelligence Heuristic Search Methods

Artificial Intelligence Heuristic Search Methods Artificial Intelligence Heuristic Search Methods Chung-Ang University, Jaesung Lee The original version of this content is created by School of Mathematics, University of Birmingham professor Sandor Zoltan

More information

Traffic Signal Control with Swarm Intelligence

Traffic Signal Control with Swarm Intelligence 009 Fifth International Conference on Natural Computation Traffic Signal Control with Swarm Intelligence David Renfrew, Xiao-Hua Yu Department of Electrical Engineering, California Polytechnic State University

More information

Ant Colony Optimization for Multi-objective Optimization Problems

Ant Colony Optimization for Multi-objective Optimization Problems Ant Colony Optimization for Multi-objective Optimization Problems Inès Alaya 1,2, Christine Solnon 1, and Khaled Ghédira 2 1 LIRIS, UMR 5205 CNRS / University of Lyon 2 SOIE ICTAI 2007 Multi-objective

More information

Computational statistics

Computational statistics Computational statistics Combinatorial optimization Thierry Denœux February 2017 Thierry Denœux Computational statistics February 2017 1 / 37 Combinatorial optimization Assume we seek the maximum of f

More information

Archive of SID. 1 Introduction. S. Molla-Alizadeh-Zavardehi, R. Tavakkoli-Moghaddam, F. Hosseinzadeh Lotfi

Archive of SID.   1 Introduction. S. Molla-Alizadeh-Zavardehi, R. Tavakkoli-Moghaddam, F. Hosseinzadeh Lotfi Available online at http://ijim.srbiau.ac.ir/ Int. J. Industrial Mathematics (ISSN 2008-5621) Vol. 7, No. 1, 2015 Article ID IJIM-00458, 15 pages Research Article Electromagnetism-like algorithm for fuzzy

More information

A new ILS algorithm for parallel machine scheduling problems

A new ILS algorithm for parallel machine scheduling problems J Intell Manuf (2006) 17:609 619 DOI 10.1007/s10845-006-0032-2 A new ILS algorithm for parallel machine scheduling problems Lixin Tang Jiaxiang Luo Received: April 2005 / Accepted: January 2006 Springer

More information

Available online at ScienceDirect. Procedia Computer Science 20 (2013 ) 90 95

Available online at  ScienceDirect. Procedia Computer Science 20 (2013 ) 90 95 Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 20 (2013 ) 90 95 Complex Adaptive Systems, Publication 3 Cihan H. Dagli, Editor in Chief Conference Organized by Missouri

More information

An Enhanced Aggregation Pheromone System for Real-Parameter Optimization in the ACO Metaphor

An Enhanced Aggregation Pheromone System for Real-Parameter Optimization in the ACO Metaphor An Enhanced Aggregation Pheromone System for Real-Parameter ptimization in the AC Metaphor Shigeyoshi Tsutsui Hannan University, Matsubara, saka 58-852, Japan tsutsui@hannan-u.ac.jp Abstract. In previous

More information

Supporting Information. Strategy To Discover Diverse Optimal Molecules in the Small Molecule Universe

Supporting Information. Strategy To Discover Diverse Optimal Molecules in the Small Molecule Universe Supporting Information Strategy To Discover Diverse Optimal Molecules in the Small Molecule Universe Chetan Rupakheti 1, Aaron Virshup 2, Weitao Yang 2,3, David N. Beratan 2,3,4 1 Program in Computational

More information

A Fast Heuristic for GO and MINLP

A Fast Heuristic for GO and MINLP A Fast Heuristic for GO and MINLP John W. Chinneck, M. Shafique, Systems and Computer Engineering Carleton University, Ottawa, Canada Introduction Goal: Find a good quality GO/MINLP solution quickly. Trade

More information

Swarm Intelligence Traveling Salesman Problem and Ant System

Swarm Intelligence Traveling Salesman Problem and Ant System Swarm Intelligence Leslie Pérez áceres leslie.perez.caceres@ulb.ac.be Hayfa Hammami haifa.hammami@ulb.ac.be IRIIA Université Libre de ruxelles (UL) ruxelles, elgium Outline 1.oncept review 2.Travelling

More information

A Note on the Parameter of Evaporation in the Ant Colony Optimization Algorithm

A Note on the Parameter of Evaporation in the Ant Colony Optimization Algorithm International Mathematical Forum, Vol. 6, 2011, no. 34, 1655-1659 A Note on the Parameter of Evaporation in the Ant Colony Optimization Algorithm Prasanna Kumar Department of Mathematics Birla Institute

More information

Exponential neighborhood search for a parallel machine scheduling problem

Exponential neighborhood search for a parallel machine scheduling problem xponential neighborhood search for a parallel machine scheduling problem Y.A. Rios Solis and F. Sourd LIP6 - Université Pierre et Marie Curie 4 Place Jussieu, 75252 Paris Cedex 05, France Abstract We consider

More information

Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model

Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model Chapter -7 Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model 7.1 Summary Forecasting summer monsoon rainfall with

More information

New approaches to evaporation in ant colony optimization algorithms

New approaches to evaporation in ant colony optimization algorithms New approaches to evaporation in ant colony optimization algorithms E. Foundas A. Vlachos Department of Informatics University of Piraeus Piraeus 85 34 Greece Abstract In Ant Colony Algorithms (ACA), artificial

More information

The treatment of uncertainty in uniform workload distribution problems

The treatment of uncertainty in uniform workload distribution problems The treatment of uncertainty in uniform workload distribution problems tefan PE KO, Roman HAJTMANEK University of šilina, Slovakia 34 th International Conference Mathematical Methods in Economics Liberec,

More information

Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic

Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic Leonora Bianchi 1, Luca Maria Gambardella 1 and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH-6928 Manno,

More information

Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization

Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Alfred Mayer 1, Clemens Nothegger 2, Andreas Chwatal 1, and Günther R. Raidl 1 1 Institute of Computer Graphics and Algorithms

More information

Implementation of Travelling Salesman Problem Using ant Colony Optimization

Implementation of Travelling Salesman Problem Using ant Colony Optimization RESEARCH ARTICLE OPEN ACCESS Implementation of Travelling Salesman Problem Using ant Colony Optimization Gaurav Singh, Rashi Mehta, Sonigoswami, Sapna Katiyar* ABES Institute of Technology, NH-24, Vay

More information

Mining Spatial Trends by a Colony of Cooperative Ant Agents

Mining Spatial Trends by a Colony of Cooperative Ant Agents Mining Spatial Trends by a Colony of Cooperative Ant Agents Ashan Zarnani Masoud Rahgozar Abstract Large amounts of spatially referenced data has been aggregated in various application domains such as

More information

3.4 Relaxations and bounds

3.4 Relaxations and bounds 3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper

More information

Single Machine Models

Single Machine Models Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 8 Single Machine Models 1. Dispatching Rules 2. Single Machine Models Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Dispatching

More information

Computational Intelligence Methods

Computational Intelligence Methods Computational Intelligence Methods Ant Colony Optimization, Partical Swarm Optimization Pavel Kordík, Martin Šlapák Katedra teoretické informatiky FIT České vysoké učení technické v Praze MI-MVI, ZS 2011/12,

More information

An ant colony algorithm applied to lay-up optimization of laminated composite plates

An ant colony algorithm applied to lay-up optimization of laminated composite plates 10(2013) 491 504 An ant colony algorithm applied to lay-up optimization of laminated composite plates Abstract Ant colony optimization (ACO) is a class of heuristic algorithms proposed to solve optimization

More information

Ant Colony Optimization for Resource-Constrained Project Scheduling

Ant Colony Optimization for Resource-Constrained Project Scheduling Ant Colony Optimization for Resource-Constrained Project Scheduling Daniel Merkle, Martin Middendorf 2, Hartmut Schmeck 3 Institute for Applied Computer Science and Formal Description Methods University

More information

Iterated Responsive Threshold Search for the Quadratic Multiple Knapsack Problem

Iterated Responsive Threshold Search for the Quadratic Multiple Knapsack Problem Noname manuscript No. (will be inserted by the editor) Iterated Responsive Threshold Search for the Quadratic Multiple Knapsack Problem Yuning Chen Jin-Kao Hao* Accepted to Annals of Operations Research

More information

Mining Spatial Trends by a Colony of Cooperative Ant Agents

Mining Spatial Trends by a Colony of Cooperative Ant Agents Mining Spatial Trends by a Colony of Cooperative Ant Agents Ashan Zarnani Masoud Rahgozar Abstract Large amounts of spatially referenced data have been aggregated in various application domains such as

More information

CHAPTER 16: SCHEDULING

CHAPTER 16: SCHEDULING CHAPTER 16: SCHEDULING Solutions: 1. Job A B C A B C 1 5 8 6 row 1 0 3 1 Worker 2 6 7 9 reduction 2 0 1 3 3 4 5 3 3 1 2 0 column reduction A B C 1 0 2 1 Optimum: 2 0 0 3 Worker 1, Job A 3 1 1 0 2 B 3 C

More information

International Journal of Industrial Engineering Computations

International Journal of Industrial Engineering Computations International Journal of Industrial Engineering Computations 2 (20) 49 498 Contents lists available at GrowingScience International Journal of Industrial Engineering Computations homepage: www.growingscience.com/iec

More information

Object segmentation using ant colony optimization algorithm and fuzzy entropy q

Object segmentation using ant colony optimization algorithm and fuzzy entropy q Pattern Recognition Letters 28 (2007) 788 796 www.elsevier.com/locate/patrec Object segmentation using ant colony optimization algorithm and fuzzy entropy q Wenbing Tao a,b, *, Hai Jin a,b, Liman Liu c

More information

Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multi-Machine Problems: A Survey

Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multi-Machine Problems: A Survey Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multi-Machine Problems: A Survey Volker Lauff and Frank Werner 1 Otto-von-Guericke-Universität, Fakultät für Mathematik, PSF 4120,

More information

Solving Multi-Criteria Optimization Problems with Population-Based ACO

Solving Multi-Criteria Optimization Problems with Population-Based ACO Solving Multi-Criteria Optimization Problems with Population-Based ACO Michael Guntsch 1 and Martin Middendorf 2 1 Institute for Applied Computer Science and Formal Description Methods University of Karlsruhe,

More information

OPTIMAL PLACEMENT OF DISTRIBUTED GENERATION AND CAPACITOR IN DISTRIBUTION NETWORKS BY ANT COLONY ALGORITHM

OPTIMAL PLACEMENT OF DISTRIBUTED GENERATION AND CAPACITOR IN DISTRIBUTION NETWORKS BY ANT COLONY ALGORITHM International Journal on Technical and Physical Problems of Engineering (IJTPE) Published by International Organization of IOTPE ISSN 2077-3528 IJTPE Journal www.iotpe.com ijtpe@iotpe.com September 204

More information

arxiv: v1 [math.oc] 2 Nov 2014

arxiv: v1 [math.oc] 2 Nov 2014 Noname manuscript No. (will be inserted by the editor) 1 Introduction arxiv:1411.0309v1 [math.oc] 2 Nov 2014 Scheduling step-deteriorating jobs to minimize the total weighted tardiness on a single machine

More information

Multiobjective Optimization

Multiobjective Optimization Multiobjective Optimization MOO Applications Professores: Eduardo G. Carrano Frederico G. Guimarães Lucas S. Batista {egcarrano,fredericoguimaraes,lusoba}@ufmg.br www.ppgee.ufmg.br/ lusoba Universidade

More information

Permutation distance measures for memetic algorithms with population management

Permutation distance measures for memetic algorithms with population management MIC2005: The Sixth Metaheuristics International Conference??-1 Permutation distance measures for memetic algorithms with population management Marc Sevaux Kenneth Sörensen University of Valenciennes, CNRS,

More information

Lecture H2. Heuristic Methods: Iterated Local Search, Simulated Annealing and Tabu Search. Saeed Bastani

Lecture H2. Heuristic Methods: Iterated Local Search, Simulated Annealing and Tabu Search. Saeed Bastani Simulation Lecture H2 Heuristic Methods: Iterated Local Search, Simulated Annealing and Tabu Search Saeed Bastani saeed.bastani@eit.lth.se Spring 2017 Thanks to Prof. Arne Løkketangen at Molde University

More information

Markov Chain Monte Carlo Methods

Markov Chain Monte Carlo Methods Markov Chain Monte Carlo Methods p. /36 Markov Chain Monte Carlo Methods Michel Bierlaire michel.bierlaire@epfl.ch Transport and Mobility Laboratory Markov Chain Monte Carlo Methods p. 2/36 Markov Chains

More information

A reactive framework for Ant Colony Optimization

A reactive framework for Ant Colony Optimization A reactive framework for Ant Colony Optimization Madjid Khichane 1,2, Patrick Albert 1, and Christine Solnon 2 1 ILOG SA, 9 rue de Verdun, 94253 Gentilly cedex, France {mkhichane,palbert}@ilog.fr 2 LIRIS

More information

5. Simulated Annealing 5.2 Advanced Concepts. Fall 2010 Instructor: Dr. Masoud Yaghini

5. Simulated Annealing 5.2 Advanced Concepts. Fall 2010 Instructor: Dr. Masoud Yaghini 5. Simulated Annealing 5.2 Advanced Concepts Fall 2010 Instructor: Dr. Masoud Yaghini Outline Acceptance Function Initial Temperature Equilibrium State Cooling Schedule Stopping Condition Handling Constraints

More information

SEQUENCING A SINGLE MACHINE WITH DUE DATES AND DEADLINES: AN ILP-BASED APPROACH TO SOLVE VERY LARGE INSTANCES

SEQUENCING A SINGLE MACHINE WITH DUE DATES AND DEADLINES: AN ILP-BASED APPROACH TO SOLVE VERY LARGE INSTANCES SEQUENCING A SINGLE MACHINE WITH DUE DATES AND DEADLINES: AN ILP-BASED APPROACH TO SOLVE VERY LARGE INSTANCES PH. BAPTISTE, F. DELLA CROCE, A. GROSSO, AND V. T KINDT Abstract. We consider the problem of

More information

Simultaneous state and input estimation of non-linear process with unknown inputs using particle swarm optimization particle filter (PSO-PF) algorithm

Simultaneous state and input estimation of non-linear process with unknown inputs using particle swarm optimization particle filter (PSO-PF) algorithm Simultaneous state and input estimation of non-linear process with unknown inputs using particle swarm optimization particle filter (PSO-PF) algorithm Mohammad A. Khan, CSChe 2016 Outlines Motivations

More information

Sensitive Ant Model for Combinatorial Optimization

Sensitive Ant Model for Combinatorial Optimization Sensitive Ant Model for Combinatorial Optimization CAMELIA CHIRA cchira@cs.ubbcluj.ro D. DUMITRESCU ddumitr@cs.ubbcluj.ro CAMELIA-MIHAELA PINTEA cmpintea@cs.ubbcluj.ro Abstract: A combinatorial optimization

More information

MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING

MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING Journal of the Operations Research Society of Japan Vol. 39, No. 3, September 1996 1996 The Operations Research Society of Japan MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING Tsung-Chyan Lai

More information

Femtosecond Quantum Control for Quantum Computing and Quantum Networks. Caroline Gollub

Femtosecond Quantum Control for Quantum Computing and Quantum Networks. Caroline Gollub Femtosecond Quantum Control for Quantum Computing and Quantum Networks Caroline Gollub Outline Quantum Control Quantum Computing with Vibrational Qubits Concept & IR gates Raman Quantum Computing Control

More information

Single-machine scheduling to minimize the maximum tardiness under piecewise linear deteriorating jobs

Single-machine scheduling to minimize the maximum tardiness under piecewise linear deteriorating jobs Scientia Iranica E (2018) 25(1), 370{385 Sharif University of Technology Scientia Iranica Transactions E: Industrial Engineering http://scientiairanica.sharif.edu Single-machine scheduling to minimize

More information

Gas Turbine LQR, INTEGRAL Controllers and Optimal PID Tuning by Ant Colony Optimization Comparative Study

Gas Turbine LQR, INTEGRAL Controllers and Optimal PID Tuning by Ant Colony Optimization Comparative Study International Journal of Computer Science and elecommunications [Volume 4, Issue, January 23] 35 ISSN 247-3338 Gas urbine LQR, INEGRAL Controllers and Optimal PID uning by Ant Colony Optimization Comparative

More information

Australian Journal of Basic and Applied Sciences. Parametric Modelling of Flexible Plate Structures Using Ant Colony Optimization

Australian Journal of Basic and Applied Sciences. Parametric Modelling of Flexible Plate Structures Using Ant Colony Optimization Australian Journal of Basic and Applied Sciences, 8(9) Special, Pages: 58-6 AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:99-878 Journal home page: www.ajbasweb.com Parametric Modelling

More information

Finding optimal configurations ( combinatorial optimization)

Finding optimal configurations ( combinatorial optimization) CS 1571 Introduction to AI Lecture 10 Finding optimal configurations ( combinatorial optimization) Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square Constraint satisfaction problem (CSP) Constraint

More information

Omega 38 (2010) Contents lists available at ScienceDirect. Omega. journal homepage:

Omega 38 (2010) Contents lists available at ScienceDirect. Omega. journal homepage: Omega 38 (2010) 3 -- 11 Contents lists available at ScienceDirect Omega journal homepage: www.elsevier.com/locate/omega A single-machine learning effect scheduling problem with release times Wen-Chiung

More information

Minimizing the Number of Tardy Jobs

Minimizing the Number of Tardy Jobs Minimizing the Number of Tardy Jobs 1 U j Example j p j d j 1 10 10 2 2 11 3 7 13 4 4 15 5 8 20 Ideas: Need to choose a subset of jobs S that meet their deadlines. Schedule the jobs that meet their deadlines

More information

Unrelated Parallel Machines Scheduling Problem with Sequence Dependent Setup Times

Unrelated Parallel Machines Scheduling Problem with Sequence Dependent Setup Times Proceedings of the 014 International onference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 014 Unrelated Parallel Machines Scheduling Problem with Sequence Dependent

More information

An integrated schedule planning and revenue management model

An integrated schedule planning and revenue management model An integrated schedule planning and revenue management model Bilge Atasoy Michel Bierlaire Matteo Salani LATSIS - 1 st European Symposium on Quantitative Methods in Transportation Systems September 07,

More information

Cellular Automata Models of Traffic on Ant Trails

Cellular Automata Models of Traffic on Ant Trails Cellular Automata Models of Traffic on Ant Trails Andreas Schadschneider Institut für Theoretische Physik Universität zu Köln www.thp.uni-koeln.de/~as www.thp.uni-koeln.de/ant-traffic Introduction Organized

More information

An Ant Colony Approach to Forward-Reverse Logistics Network Design Under Demand Certainty

An Ant Colony Approach to Forward-Reverse Logistics Network Design Under Demand Certainty Journal of Optimization in Industrial Engineering 22 (207) 0-4 DOI: 0.22094/joie.207.28 An Ant Colony Approach to Forward-Reverse Logistics Network Design Under Demand Certainty Hamed Soleimani a,* Mostafa

More information

Methods for finding optimal configurations

Methods for finding optimal configurations CS 1571 Introduction to AI Lecture 9 Methods for finding optimal configurations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Search for the optimal configuration Optimal configuration search:

More information

An FPTAS for Total Weighted Earliness Tardiness Problem with Constant Number of Distinct Due Dates and Polynomially Related Weights

An FPTAS for Total Weighted Earliness Tardiness Problem with Constant Number of Distinct Due Dates and Polynomially Related Weights An FPTAS for Total Weighted Earliness Tardiness Problem with Constant Number of Distinct Due Dates and Polynomially Related Weights AN FPTAS FOR TOTAL WEIGHTED EARLINESS TARDINESS PROBLEM WITH CONSTANT

More information

The Optimal Resource Allocation in Stochastic Activity Networks via The Electromagnetism Approach

The Optimal Resource Allocation in Stochastic Activity Networks via The Electromagnetism Approach The Optimal Resource Allocation in Stochastic Activity Networks via The Electromagnetism Approach AnabelaP.Tereso,M.MadalenaT.Araújo Universidade do Minho, 4800-058 Guimarães PORTUGAL anabelat@dps.uminho.pt;

More information

An ant colony algorithm for multiple sequence alignment in bioinformatics

An ant colony algorithm for multiple sequence alignment in bioinformatics An ant colony algorithm for multiple sequence alignment in bioinformatics Jonathan Moss and Colin G. Johnson Computing Laboratory University of Kent at Canterbury Canterbury, Kent, CT2 7NF, England. C.G.Johnson@ukc.ac.uk

More information

7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Outcomes

7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Outcomes The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a 0has a reciprocal b written as a or such that a ba = ab =. Similarly a square matrix A may have an inverse B = A where AB =

More information

Finding the best tree by heuristic search

Finding the best tree by heuristic search Chapter 4 Finding the best tree by heuristic search If we cannot find the best trees by examining all possible trees, we could imagine searching in the space of possible trees. In this chapter we will

More information

Dynamic Scheduling with Genetic Programming

Dynamic Scheduling with Genetic Programming Dynamic Scheduling with Genetic Programming Domago Jakobović, Leo Budin domago.akobovic@fer.hr Faculty of electrical engineering and computing University of Zagreb Introduction most scheduling problems

More information

Errata and Updates for ASM Exam MAS-I (First Edition) Sorted by Date

Errata and Updates for ASM Exam MAS-I (First Edition) Sorted by Date Errata for ASM Exam MAS-I Study Manual (First Edition) Sorted by Date 1 Errata and Updates for ASM Exam MAS-I (First Edition) Sorted by Date Practice Exam 5 Question 6 is defective. See the correction

More information

Errata and Updates for ASM Exam MAS-I (First Edition) Sorted by Page

Errata and Updates for ASM Exam MAS-I (First Edition) Sorted by Page Errata for ASM Exam MAS-I Study Manual (First Edition) Sorted by Page 1 Errata and Updates for ASM Exam MAS-I (First Edition) Sorted by Page Practice Exam 5 Question 6 is defective. See the correction

More information

Engineering Structures

Engineering Structures Engineering Structures 31 (2009) 715 728 Contents lists available at ScienceDirect Engineering Structures journal homepage: www.elsevier.com/locate/engstruct Particle swarm optimization of tuned mass dampers

More information

Mauro Birattari, Prasanna Balaprakash, and Marco Dorigo

Mauro Birattari, Prasanna Balaprakash, and Marco Dorigo Chapter 10 THE ACO/F-RACE ALGORITHM FOR COMBINATORIAL OPTIMIZATION UNDER UNCERTAINTY Mauro Birattari, Prasanna Balaprakash, and Marco Dorigo IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium

More information

Non-linear programs with max-linear constraints: A heuristic approach

Non-linear programs with max-linear constraints: A heuristic approach Non-linear programs with max-linear constraints: A heuristic approach A. Aminu P. Butkovič October 5, 2009 Abstract Let a b = max(a, b) and a b = a + b for a, b R and ext the pair of operations to matrices

More information

MULTI-PERIOD MULTI-DIMENSIONAL KNAPSACK PROBLEM AND ITS APPLICATION TO AVAILABLE-TO-PROMISE

MULTI-PERIOD MULTI-DIMENSIONAL KNAPSACK PROBLEM AND ITS APPLICATION TO AVAILABLE-TO-PROMISE MULTI-PERIOD MULTI-DIMENSIONAL KNAPSACK PROBLEM AND ITS APPLICATION TO AVAILABLE-TO-PROMISE Hoong Chuin LAU and Min Kwang LIM School of Computing National University of Singapore, 3 Science Drive 2, Singapore

More information

Hill climbing: Simulated annealing and Tabu search

Hill climbing: Simulated annealing and Tabu search Hill climbing: Simulated annealing and Tabu search Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Hill climbing Instead of repeating local search, it is

More information

Ruin and Recreate Principle Based Approach for the Quadratic Assignment Problem

Ruin and Recreate Principle Based Approach for the Quadratic Assignment Problem Ruin and Recreate Principle Based Approach for the Quadratic Assignment Problem Alfonsas Misevicius Kaunas University of Technology, Department of Practical Informatics, Studentu St. 50 400a, LT 3031 Kaunas,

More information

Linear Algebra The Inverse of a Matrix

Linear Algebra The Inverse of a Matrix Linear Algebra The Inverse of a Matrix Dr. Bisher M. Iqelan biqelan@iugaza.edu.ps Department of Mathematics The Islamic University of Gaza 2017-2018, Semester 2 Dr. Bisher M. Iqelan (IUG) Sec.2.2: The

More information

Collective Intelligence for Optimal Power Flow Solution Using Ant Colony Optimization

Collective Intelligence for Optimal Power Flow Solution Using Ant Colony Optimization Leonardo Electronic Journal of Practices and Technologies Collective Intelligence for Optimal Power Flow Solution Using Ant Colony Optimization Boumediène ALLAOUA * and Abdellah LAOUFI Bechar University,

More information

Algorithms and Complexity theory

Algorithms and Complexity theory Algorithms and Complexity theory Thibaut Barthelemy Some slides kindly provided by Fabien Tricoire University of Vienna WS 2014 Outline 1 Algorithms Overview How to write an algorithm 2 Complexity theory

More information

On Asymptotic Complexity of the Optimum Golomb Ruler Problem: From Established Stochastic Methods to Self-Avoiding Walks

On Asymptotic Complexity of the Optimum Golomb Ruler Problem: From Established Stochastic Methods to Self-Avoiding Walks On Asymptotic Complexity of the Optimum Golomb Ruler Problem: From Established Stochastic Methods to Self-Avoiding Walks Franc Brglez Computer Science, NC State University Raleigh, NC 27695, USA Email:

More information

Intuitionistic Fuzzy Estimation of the Ant Methodology

Intuitionistic Fuzzy Estimation of the Ant Methodology BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 2 Sofia 2009 Intuitionistic Fuzzy Estimation of the Ant Methodology S Fidanova, P Marinov Institute of Parallel Processing,

More information

(0)

(0) Citation A.Divsalar, P. Vansteenwegen, K. Sörensen, D. Cattrysse (04), A memetic algorithm for the Orienteering problem with hotel selection European Journal of Operational Research, 37, 9-49. Archived

More information

A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms

A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms 358 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 4, AUGUST 2002 A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms Thomas Stützle and Marco Dorigo, Senior Member,

More information

A Land Use Spatial Allocation Model based on Ant. Colony Optimization

A Land Use Spatial Allocation Model based on Ant. Colony Optimization A Land Use Spatial Allocation Model based on Ant Colony Optimization LIU YaoLin 1,2 *, TANG DiWei 1,LIU DianFeng 1,2,KONG XueSong 1,2 1 School of Resource and Environment Science, Wuhan University, Wuhan

More information