ロード中...
Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows
The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize th...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Hindawi Publishing Corporation
2014
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3958671/ https://ncbi.nlm.nih.gov/pubmed/24723834 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/871242 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|