diff --git a/jsprit-examples/input/algorithmConfig_considerFixedCosts_routeLevel.xml b/jsprit-examples/input/algorithmConfig_considerFixedCosts_routeLevel.xml
new file mode 100755
index 00000000..aa87322e
--- /dev/null
+++ b/jsprit-examples/input/algorithmConfig_considerFixedCosts_routeLevel.xml
@@ -0,0 +1,76 @@
+<?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">
+	
+	<iterations>2000</iterations>
+
+	<construction>
+		<insertion name="bestInsertion">
+			<level forwardLooking="3" memory="2">route</level>
+			<considerFixedCosts weight="1.0">true</considerFixedCosts>
+		</insertion>	
+	</construction>
+	
+	<strategy>
+		<memory>1</memory>
+		<searchStrategies>
+			<searchStrategy name="radialRuinAndRecreate">
+				<selector name="selectBest"/>
+				<acceptor name="schrimpfAcceptance">
+					<alpha>0.05</alpha>
+					<warmup>20</warmup>
+				</acceptor>
+					
+				<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="schrimpfAcceptance"/>
+					
+				<modules>
+					<module name="ruin_and_recreate">
+						<ruin id="1" name="radialRuin">
+							<share>0.3</share>
+						</ruin>
+						<insertion name="bestInsertion"/>					
+					</module>
+					
+				</modules>
+				<probability>0.5</probability>
+			</searchStrategy>
+			
+		</searchStrategies>		
+	</strategy>
+	
+
+</algorithm>
diff --git a/jsprit-examples/src/main/java/jsprit/examples/HVRPBenchmarkExample.java b/jsprit-examples/src/main/java/jsprit/examples/HVRPBenchmarkExample.java
index 8dcfa816..42302f57 100644
--- a/jsprit-examples/src/main/java/jsprit/examples/HVRPBenchmarkExample.java
+++ b/jsprit-examples/src/main/java/jsprit/examples/HVRPBenchmarkExample.java
@@ -38,6 +38,9 @@ public class HVRPBenchmarkExample {
 		vrpBuilder.addPenaltyVehicles(10.0);
 		VehicleRoutingProblem vrp = vrpBuilder.build();
 		
+		//try also input//jsprit-examples/input/algorithmConfig_considerFixedCosts_routeLevel.xml
+		//results might even be a bit better, but it is slower, since it checks insertion on routeLevel
+		//rather than on local level
 		VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(vrp, "input/algorithmConfig_considerFixedCosts.xml");
 		vra.setNuOfIterations(10000);
 //		vra.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(500));