q uadratic a ssignment p roblem qap
play

Q UADRATIC A SSIGNMENT P ROBLEM (QAP) There are n factories and n - PowerPoint PPT Presentation

S EARCH M OVES IN THE L OCAL O PTIMA N ETWORKS OF P ERMUTATION S PACES THE QAP CASE M ARCO B AIOLETTI U NIVERSITY OF P ERUGIA A LFREDO M ILANI U NIVERSITY OF P ERUGIA V ALENTINO S ANTUCCI U NIVERSITY FOR F OREIGNERS OF P ERUGIA M ARCO T OMASSINI U


  1. S EARCH M OVES IN THE L OCAL O PTIMA N ETWORKS OF P ERMUTATION S PACES THE QAP CASE M ARCO B AIOLETTI U NIVERSITY OF P ERUGIA A LFREDO M ILANI U NIVERSITY OF P ERUGIA V ALENTINO S ANTUCCI U NIVERSITY FOR F OREIGNERS OF P ERUGIA M ARCO T OMASSINI U NIVERSITY OF L AUSANNE

  2. M OTIVATIONS AND G OAL ❑ One of the achieved objectives of Fitness Landscape Analysis (FLA) is: “estimate how many search moves need to be performed in order to escape an attraction basin ” … ❑ … but FLA does not identify which moves have to be performed! ❑ Our goal: identify the “escaping moves” VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 2

  3. O UTLINE ❑ Quadratic Assignment Problem ❑ Local Optima Network ❑ Algebraic framework for Evolutionary Computation ❑ Qualitative analysis of the “ escaping moves ” ❑ Future lines of research VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 3

  4. Q UADRATIC A SSIGNMENT P ROBLEM (QAP) ❑ There are n factories and n cities. ❑ A distance a ij is specified for each pair of cities. ❑ A flow b ij is specified for each pair of factories. ❑ The problem is to assign all factories to different cities with the goal of minimizing the sum of the distances multiplied by the corresponding flows. VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 4

  5. F ITNESS L ANDSCAPE (FL) A FL is a triplet ( X,N,f ) where: ❑ X is the set of solutions (all the permutations of n items in QAP) ❑ N is a neighborhood structure among the solutions (exchange neighborhood in QAP) ❑ f is a fitness function (the QAP objective function) VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 5

  6. L OCAL O PTIMA N ETWORK (LON) A LON is a graph extracted from a given FL by using a (best-improvement) hill-climber hc where: ❑ the nodes are the local optima of the given FL ❑ there is an (escape) edge e ij between LO i and LO j if a solution x exists such that dist ( x,LO i )  D and hc ( x ) = LO j ❑ the edge e ij has weight w ij = v ij /  j v ij where v ij = #{ x  X | dist ( x , LO i )  D and hc ( x ) = LO j } VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 6

  7. C OMMUNITIES OF O PTIMA IN LON S ❑ LONs are complex networks which can be studied with methods of network science ❑ LONs can have a clustered structure, thus the local optima can be divided in communities VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 7

  8. A LGEBRAIC S TRUCTURE OF THE P ERMUTATION S PACE ❑ A permutation of [𝑜] = {1,2, … , 𝑜} is a bijective discrete function from [𝑜] to [𝑜] , thus it is possible to invert and compose permutations: 𝜏 = 𝜌 ∘ 𝜍 iff 𝜏 𝑗 = 𝜌(𝜍 𝑗 ) for 1 ≤ 𝑗 ≤ 𝑜 ❑ Permutations of [𝑜] form the symmetric group 𝒯 𝑜 ❑ 𝒯 𝑜 is finitely generated by the exchange permutations 𝜗 𝑗𝑘 s.t. 𝑙 if 𝑙 ≠ 𝑗 and 𝑙 ≠ 𝑘 𝑘 if 𝑙 = 𝑗 𝜗 𝑗𝑘 𝑙 = ൞ 𝑗 if 𝑙 = 𝑘 ❑ Given any 𝜌 ∈ 𝒯 𝑜 , 𝜌 ∘ 𝜗 𝑗𝑘 corresponds to exchanging the items at positions i and j in the permutation 𝜌 VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 8

  9. T HE C AYLEY G RAPH 213 231 Arc Labels 𝜗 12 𝜗 23 123 321 𝜗 13 132 312 VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 9

  10. D IFFERENCES BETWEEN P ERMUTATIONS 213 231 Arc Labels 𝜗 12 𝝇 𝜗 23 123 321 𝜗 13 𝝆 132 312 𝜍 ⊝ 𝜌 = 𝜗 13 ∘ 𝜗 12 VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 10

  11. D IFFERENCES BETWEEN P ERMUTATIONS 213 231 Arc Labels 𝜗 12 𝝇 𝜗 23 123 321 𝜗 13 𝝆 132 312 𝜍 ⊝ 𝜌 = 𝜗 13 ∘ 𝜗 12 = 𝜗 12 ∘ 𝜗 23 VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 11

  12. D IFFERENCES BETWEEN P ERMUTATIONS ❑ All the paths connecting 𝜌 to 𝜍 in the Cayley graph are all the possible factorizations of 𝜍 ⊝ 𝜌 ❑ Given any pair of permutations 𝜌, 𝜍 their difference is 𝜍 ⊝ 𝜌 = 𝜌 −1 ∘ 𝜍 ❑ … but the factorizations of 𝜍 ⊝ 𝜌 indicate the sequences of pairs of positions to exchange … ❑ … while we want the sequences of pairs of items to exchange!!! VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 12

  13. I TEMS T O E XCHANGE ( AND NOT POSITIONS !!!) ❑ A permutation is a bijection from positions to items ❑ We can exchange two generic items 𝑗 and 𝑘 from 𝜌 as follows −1 = 𝜗 𝑗𝑘 ∘ 𝜌 𝜌 −1 ∘ 𝜗 𝑗𝑘 ❑ The sequences of pairs of items to be exchanged for moving from 𝜌 to 𝜍 correspond to all the possible factorizations of 𝜌 −1 ⊝ 𝜍 −1 = 𝜍 ∘ 𝜌 −1 VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 13

  14. C OMPACT R EPRESENTATION OF THE E XCHANGES ❑ Given two permutations, the number of alternative (shortest) paths connecting them is exponential in their distance ❑ We want to identify the pairs of items to exchange independently of where they appear in the factorizations ❑ We use the cycle decomposition of a permutation 12345678 VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 14

  15. W EIGH E XCHANGES BY I MPORTANCE (1/2) ❑ Given two permutations, the exchanges appearing in multiple (shortest) paths between them are more important ❑ If the two permutations are local optima, an exchange appearing in a large number of (shortest) paths connecting them is more useful for escaping a basin of attraction ❑ Let consider that a factorization in terms of exchanges can be obtained by iteratively exchanging two items belonging to the same cycle: ❑ The cycle breaks into two (smaller) cycles ❑ The identity permutation is the only one with n cycles (of length 1) VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 15

  16. W EIGH E XCHANGES BY I MPORTANCE (2/2) ❑ Pair of items in shorter cycles (w.r.t. all the other cycles) appear in a large number of factorizations ❑ Closer are two items in a cycle, more are the factorizations where they appear ❑ Some approximated formulae and tabulations in the paper (obtained by considering a recursive variant of our factorization algorithm) VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 16

  17. T HE E XPERIMENTAL A NALYSIS ❑ LONs of few QAP real-like instances (thanks to Sebastien Verel) ❑ Clustered by means of two community finding algorithms (R package igraph ) ❑ Intra-Community Analysis: are there more relevant exchanges for moving between local optima of the same community? ❑ Inter-Community Anlysis: are there more relevant exchanges for moving between local optima of different communities? VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 17

  18. T HE A NALYZE E XCHANGES A LGORITHM ❑ INPUT : ❑ (Intra-Comm. An.) set of local optima in a same community ❑ (Inter-Comm. An.) set of local optima in different communities ❑ OUTPUT : a (triangular) matrix such that measures the 𝑎 𝑗𝑘 Exchange Importance relevance of 𝜗 𝑗𝑘 as escaping move VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 18

  19. H EATMAPS FOR KC SO 11 RL -1 ( WALKTRAP ) Intra-Community Analysis Inter-Community Analysis VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 19

  20. G INI I NDEXES ON THE Z- VALUES ❑ The Gini Index is a measure of statistical dispersion (popular in economy) ❑ 0 on uniform distributions, 1 on degenerate distributions ❑ in our scenario, 1 is impossible (due to the constraints among permutation items) ❑ 0.5 has been empirically observed to produce a «concentrated» distribution VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 20

  21. C ONCLUSIONS ❑ Real-like QAP instances look to have «preferred» search moves that allow to move across basins of attraction belonging to the same community ❑ The same does not look to be true for basins of attraction belonging to different communities ❑ This analysis shows that the Algebraic Framework for EC can be useful for fitness landscape analyses VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 21

  22. F UTURE W ORKS ❑ Experiment with larger QAP instances and sampled LONs ❑ Consider other permutation problems ❑ Other applications of the Algebraic Framework to FLA: «Vortexity» index to discern the following type of basin of attractions VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 22

  23. THANKS FOR YOUR ATTENTION! VALENTINO SANTUCCI - SEARCH MOVES IN THE LONS OF PERMUTATION SPACE - ECPERM WORKSHOP AT GECCO '19 23

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend