Transportation planning using PDDL
Planning is a category under Artificial Intelligence and the target of the planning is to find reasonable plans to achieve the specific goals from the initial state. PDDL (Planning Domain Definition Language) is a high-level modeling language to standardize artificial intelligence planning language...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2020
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/139042 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Planning is a category under Artificial Intelligence and the target of the planning is to find reasonable plans to achieve the specific goals from the initial state. PDDL (Planning Domain Definition Language) is a high-level modeling language to standardize artificial intelligence planning language and also to express planning models. PDDL is used to solve a series of realistic problems while this report is to get use of PDDL as a method to solve Vehicle Routing Problem. Vehicle Routing Problem (VRP) is defined as “Finding optimal set of routes for a vehicle to traverse in order to collect the packages from a set of customers and eventually return to depot.” This problem is a classical logistics problem and it involves common variables like location (different customers), transport means (number of car, car capacity), load and etc. |
|---|