Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/139042
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhou, Huicien_US
dc.date.accessioned2020-05-15T02:44:27Z-
dc.date.available2020-05-15T02:44:27Z-
dc.date.issued2020-
dc.identifier.urihttps://hdl.handle.net/10356/139042-
dc.description.abstractPlanning 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.en_US
dc.language.isoenen_US
dc.publisherNanyang Technological Universityen_US
dc.relationP2016-181en_US
dc.subjectEngineering::Electrical and electronic engineeringen_US
dc.titleTransportation planning using PDDLen_US
dc.typeFinal Year Project (FYP)en_US
dc.contributor.supervisorMeng-Hiot Limen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeBachelor of Engineering (Electrical and Electronic Engineering)en_US
dc.contributor.supervisoremailemhlim@ntu.edu.sgen_US
item.fulltextWith Fulltext-
item.grantfulltextrestricted-
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)
Files in This Item:
File Description SizeFormat 
Project_No_P2016-181_TRANSPORTATION_PLANNING_USING_PDDL.docx.pdf
  Restricted Access
1.62 MBAdobe PDFView/Open

Page view(s) 50

529
Updated on Apr 18, 2025

Download(s)

10
Updated on Apr 18, 2025

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.