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...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference or Workshop Item |
Published: |
2015
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/59480/ http://dx.doi.org/10.1063/1.4907523 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Teknologi Malaysia |