Solving the Time Dependent Vehicle Routing Problem by Metaheuristic Algorithms
The problem we consider in this study is Time Dependent Vehicle Routing Problem (TDVRP) which has been categorized as non-classical VRP. It is motivated by the fact that multinational companies are currently not only manufacturing the demanded products but also distributing them to the customer loca...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , |
|---|---|
| Format: | Artikel |
| Diterbitkan: |
2015
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/59480/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!