Models and algorithms for the covering tour problem
| Project/Area Number |
25750128
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Kansai University (2016)
Aoyama Gakuin University (2013-2015) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2013-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | 組合せ最適化 / アルゴリズム / モデル化 / 最適化問題 |
|---|
| Outline of Final Research Achievements |
The covering tour problem can be applied to real-world problems. An example of the CTP would be to locate a number of regional distribution centers among a set of candidate sites in such a way that all customers are within reasonable distance from at least one regional distribution center and that the cost of delivery and pick-up routes is minimized. We introduced several realistic constraints into the original CTP, and proposed heuristic algorithms for the CTP. Our algorithm could find a good solution.
|
Report
(5 results)
Research Products
(15 results)
