|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Title:||Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study|
|Citation:||Ochoa G, Veerapen N, Daolio F & Tomassini M (2017) Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study. In: Bin H & Lopez-Ibanez M (eds.) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2017. Lecture Notes in Computer Science, 10197. 17th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP), Amsterdam, The Netherlands, 19.04.2017-21.04.2017. Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55453-2_16|
|Series/Report no.:||Lecture Notes in Computer Science, 10197|
|Conference Name:||17th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP)|
|Conference Dates:||2017-04-19 - 2017-04-21|
|Conference Location:||Amsterdam, The Netherlands|
|Abstract:||Phase transitions play an important role in understanding search difficulty in combinatorial optimisation. However, previous attempts have not revealed a clear link between fitness landscape properties and the phase transition. We explore whether the global landscape structure of the number partitioning problem changes with the phase transition. Using the local optima network model, we analyse a number of instances before, during, and after the phase transition. We compute relevant network and neutrality metrics; and importantly, identify and visualise the funnel structure with an approach (monotonic sequences) inspired by theoretical chemistry. While most metrics remain oblivious to the phase transition, our results reveal that the funnel structure clearly changes. Easy instances feature a single or a small number of dominant funnels leading to global optima; hard instances have a large number of suboptimal funnels attracting the search. Our study brings new insights and tools to the study of phase transitions in combinatorial optimisation.|
|Status:||AM - Accepted Manuscript|
|Rights:||Publisher policy allows this work to be made available in this repository. Published in Hu B., López-Ibáñez M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2017. Lecture Notes in Computer Science, vol 10197; The final publication is available at Springer via https://doi.org/10.1007/978-3-319-55453-2_16|
|understanding_phase_transitions_LON_NPP.pdf||Fulltext - Accepted Version||1.48 MB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.