✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
A mixed integer linear programming based heuristic solution approach is proposed and a numerical study is carried out to assess the performance of the proposed method.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:We present a new variant of vehicle routing problem with a min-max objective function.
📊
Key Findings & Data:The problem has different types of service demands satisfied by a heterogeneous fleet of vehicles.
💡
Conclusion & Impact:A mixed integer linear programming based heuristic solution approach is proposed and a numerical study is carried out to assess the performance of the proposed method.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Vehicle Routing Problem · Heuristic Method · Synchronization
Özet
We present a new variant of vehicle routing problem with a min-max objective function. The problem has different types of service demands satisfied by a heterogeneous fleet of vehicles. Unlimited service capacitated vehicles serve the demand points with multiple time windows and requirement of operation synchronization when demand is split between vehicles. A mixed integer linear programming based heuristic solution approach is proposed and a numerical study is carried out to assess the performance of the proposed method.
🔖
Cite This Article
YAKICI, E. (2016). A RICH MIN-MAX VEHICLE ROUTING PROBLEM. Journal of Naval Sciences and Engineering, Cilt: 12 - Sayı: 1, 19–32. https://ajindex.com/articles/238031