• Greedy Random: A Novel Algorithm for Vehicle Routing Optimization
• Heuristics
• Experimental Ideas
• Metrics
• Research Paper
• Research Plan
• Statistical Analyzer
• Research Timeline
• Possible Titles
• Experimental Procedures
• Greedy Random Abstract

Timeline

Todo

Items that still need to be done, with computation time in parentheses.

• Multi-move Greedy Random: GR with 1, 2, 5, 10, 25 inital moves (40 hours)
• Greedy Random Low, Medium vs. High (24 hours)
• More precise logging will substitute GR Change Analysis
• We will observe the consistency of the data sets in the first two runs

Dates

• All enhanced logged must be finished by the 14^th
• MMGR must be finished by 16^th
• GR Low, Medium vs. High must be finished by the 18^th
• Paper Draft I (all data, organization & analysis) must be finished by the 20^th
• Paper Draft II (near perfection) must be finished by November 24^th
• Paper Final (perfection) must be finished by November 27^th

Return to Research Home

Comments

• Add a Comment