Dergiler / Journal of Naval Sciences and Engineering / 2016 / Cilt: 12 - Sayı: 1

A RICH MIN-MAX VEHICLE ROUTING PROBLEM

Sayfa
19–32
Yayın Tarihi
2016-04-24
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

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 Maddede Bu Makale

🎯
Amaç & Hipotez:We present a new variant of vehicle routing problem with a min-max objective function.
📊
Temel Bulgular & Veri:The problem has different types of service demands satisfied by a heterogeneous fleet of vehicles.
💡
Sonuç & Katkı: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.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler: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.

🔖

Bu Makaleye Atıf Yap

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

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...