Reasearch on efficient algorithms based on the mathematical programming technique for the vehicle routing problems
| Project/Area Number |
23710175
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Nagoya University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2013: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
|
|---|
| Keywords | 組合せ最適化 / メタ戦略 / 配送計画問題 / メタヒューリスティクス / 局所探索法 |
|---|
| Research Abstract |
The vehicle routing problem is the problem of minimizing the total cost of a number of vehicles, under various constraints, where every customer must be visited exactly once by a vehicle. One of the effective algorithms for the problem is a local search. It starts from an initial solution and repeats replacing the solution with a better solution in its neighborhood. Metaheuristic algorithms based on local search have been studied. In this research, we proposed efficient algorithms by combining local search and metaheuristics with mathematical programming technique.
|
Report
(4 results)
Research Products
(32 results)
