Loading...
Please wait, while we are loading the content...
Similar Documents
A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Imran, Arif |
| Copyright Year | 2014 |
| Abstract | The multi-depot vehicle routing problem (MDVRP) is addressed using an adaptation of the variable neighborhood search (VNS). The proposed VNS algorithm besides using several neighborhoods and a number of local searches has a number of additional features. These include a scheme for identifying borderline customers, a diversification procedure and a mechanism that aggregates and disaggregates routes between depots. The proposed algorithm is tested on the data instances from the literature and produces competitive results. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://jurnalindustri.petra.ac.id/index.php/ind/article/download/18846/18542 |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Aggregate data Algorithm Dijkstra's algorithm Diversification (finance) Extended Release Depot Dosage Form Heuristic Local search (optimization) Microsoft Windows Numerous Variable neighborhood search Vehicle routing problem |
| Content Type | Text |
| Resource Type | Article |