The application of metaheuristics in network routing and inventory routing problem / Huda Zuhrah Ab Halim
Metaheuristic methods are widely known as one of the most practical approaches in solving large (or very large) problems in many fields, specifically NP hard Combinatorial Problems. In this thesis, we study two powerful metaheuristics method that are Genetic Algorithm (GA) and Variable Neighborhood...
Saved in:
Internet
http://pendeta.um.edu.my/client/default/search/results?qu=The+application+of+metaheuristics+in+network+routing+and+inventory+routing+problem&te=http://pendeta.um.edu.my/client/default/search/results?qu=The+application+of+metaheuristics+in+network+routing+and+inventory+routing+problem&te=
http://studentsrepo.um.edu.my/3850/1/1._totle_page%2C_abstract%2C_content.pdf
http://studentsrepo.um.edu.my/3850/2/c_1_intro.pdf
http://studentsrepo.um.edu.my/3850/3/c_2__METAHEURISTICS.pdf
http://studentsrepo.um.edu.my/3850/4/c_3_THE_APPLICATIONS_OF_METAHEURISTICS.pdf
http://studentsrepo.um.edu.my/3850/5/c_4_THE_APPLICATIONS_OF_METAHEURISTICS.pdf
http://studentsrepo.um.edu.my/3850/6/c_5_CONCLUSIONS_AND_FUTURE_RESEARCH.pdf
http://studentsrepo.um.edu.my/3850/7/references.pdf
http://studentsrepo.um.edu.my/3850/8/appendices.pdf