diff --git a/README.md b/README.md
index 5b77fca7..bc154757 100644
--- a/README.md
+++ b/README.md
@@ -6,7 +6,6 @@ It is lightweight and easy-to-use, and based on heuristics currently solving
 - <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/multiple-depot-vrp/" target="_blank">Multiple Depot VRP</a>
 - <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-time-windows" target="_blank">VRP with Time Windows</a>
 - <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-backhauls/" target="_blank">VRP with Backhauls</a>
-- <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-pick-up-and-delivering/" target="_blank">VRP with Pickups and Deliveries</a>
 - VRP with Heterogeneous Fleet
 - Time-dependent VRP
 - Various combination of these types
@@ -21,6 +20,8 @@ can be used, and a dynamic and interactive visualiser greatly enhances the analy
 ##In Development
 - continues improvement of code, handling and performance
 - stable API to easily build algorithms from scratch
+- VRP with pickups and deliveries
+- release 1.0.0
 
 ##Documentation