Study on VRPTW based on Improved Particle Swarm Optimization
Vehicle routing problem with time windows (VRPTW) is a typical non-deterministic polynomial hard (NP-hard) optimization problem. In order to overcome PSO's slow astringe and premature convergence, an improved particle swarm optimization (IPSO) is put forward. In the algorithm, it uses the popul...
Saved in:
| Main Author: | |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2014-06-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |