Here are some VRP papers you might be interested in reading (more links below).
http://logvrp.com/staticcontent/html/NetAkil.Logistics.Vrp/en/VRPTypesAndAlgorithms.html
Please not at the bottom:
VRP Solver Algorithms
In logvrp, VRP Solver Algorithms are sometimes referred as just VRP Solver or just Algorithm. The current version of logvrp has 2 algorithms (VRP Solvers) built-in.
Jan Dethloff's Alg. Modified
This algorithm is a modified version of Jan Dethloff’s work. It has been modified to support heterogeneous vehicles, load types and time windows.
Solves: VRP with Simultaneous Delivery and Pick-up (VRPSDP)
Reference: Jan Dethloff, Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23:79–96
Handles constraints: Heterogeneous vehicle, heterogeneous load, visit station once
Adaptive Large Scale Neighborhood Search (ALNS)
Solves:
VRP with Simultaneous Delivery and Pick-up (VRPSDP)
Vehicle Routing Problem with Time Windows (VRPTW)
Capacitated Vehicle Routing Problem (CVRP)
Site-dependent Vehicle Routing Problem (SDVRP)
Open Vehicle Routing Problem (OVRP)
Multi-Sepot Vehicle Routing Problem (MDVRP)
Reference: David Pisinger and Stefan Røpke. A general heuristic for vehicle routing problems. Technical Report 05/01, DIKU, University of Copenhagen, 2005.
Handles constraints: Heterogeneous vehicle, heterogeneous load, time window
The above looks interesting because of the potential to solve MANY VRP problems with a single algorithm.
This is a filtered list from about 50 articles that I scanned. These look most appropriate to your proposals:
http://www.crema.unimi.it/Biblioteca/Note_pdf/62.pdf
http://www.diku.dk/~sropke/Papers/lns.pdf
https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2011-02.pdf
http://orbit.dtu.dk/fedora/objects/orbit:8676/datastreams/file_3154899/content
http://othes.univie.ac.at/7906/1/2009-12-18_0300375.pdf
http://www.logistikplanung.tu-darmstadt.de/media/logplanung/schneider_vrpis_tr_1_2014.pdf
Probably more than you want. I recommend that you quickly scan these and decide if they warrant a more detailed viewing.
Enjoy,
-Steve