<?xml version="1.0" encoding="UTF-8"?>
<!--
  Copyright (C) 2013  Stefan Schroeder
  
  This program is free software; you can redistribute it and/or
  modify it under the terms of the GNU General Public License
  as published by the Free Software Foundation; either version 2
  of the License, or (at your option) any later version.
  
  This program is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  GNU General Public License for more details.
  
  You should have received a copy of the GNU General Public License
  along with this program; if not, write to the Free Software
  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
  
  Contributors:
      Stefan Schroeder - initial API and implementation
-->
<algorithm xmlns="http://www.w3schools.com"
     xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.w3schools.com algorithm_schema.xsd">

	<construction>
		<insertion name="bestInsertion"/>
	</construction>
	
	<strategy>
		<memory>1</memory>
		<searchStrategies>
			<searchStrategy name="randomRuinAndRecreate">
				<selector name="selectBest"/>
	  			<acceptor name="acceptNewRemoveFirst"/>  		
				<modules>
					<module name="ruin_and_recreate">
						<ruin name="randomRuin">
							<share>0.5</share>
						</ruin>
						<insertion name="bestInsertion"/>						
					</module>
					
				</modules>
				<probability>0.5</probability>
			</searchStrategy>
			
			<searchStrategy name="radialRuinAndRecreate">
				<selector name="selectBest"/>
				<acceptor name="acceptNewRemoveFirst"/>  
				<modules>
					<module name="ruin_and_recreate">
						<ruin name="radialRuin">
							<share>0.3</share>
						</ruin>
						<insertion name="bestInsertion"/>					
					</module>
					
				</modules>
				<probability>0.5</probability>
			</searchStrategy>
			
		</searchStrategies>		
	</strategy>
	

</algorithm>
