Loading...
Please wait, while we are loading the content...
Similar Documents
A Hybrid Ant Colony System for Vehicle Routing Problem with Time Windows
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chen, Chia-Ho Ting, Ching-Jung |
| Copyright Year | 2005 |
| Abstract | The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem occurring in many logistics systems. The objective of VRPTW is to serve a set of customers within their predefined time windows at minimum cost. Ant Colony System algorithm (ACS) that is capable of searching multiple search areas simultaneously in the solution space is good in diversification. On the other hand, Simulated Annealing algorithm (SA) is a local search technique that has been successfully applied to many NP-hard problems. A hybrid algorithm (IACS-SA) that combines an improved ACS with SA is proposed in this paper. The algorithm has been tested on 56 Solomon benchmark problems. The results show that our IACS-SA is competitive with other meta-heuristic approaches in the literature. The results also indicate that such a hybrid algorithm outperforms the individual heuristic alone. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.easts.info/on-line/journal_06/2822.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | 12 HR Carbamazepine 200 MG Extended Release Oral Capsule Ant colony Benchmark (computing) CNS disorder Computation Diversification (finance) Drug vehicle Feasible region Heuristic Heuristic (computer science) Hybrid algorithm Local search (optimization) Logistics Loss function Microsoft Windows NP-hardness Optimization problem Simulated annealing Software release life cycle Time complexity Vehicle routing problem |
| Content Type | Text |
| Resource Type | Article |