Rank-based memetic algorithm for capacitated arc routing problems

Rank-based memetic algorithm for capacitated arc routing problems

The Capacitated Arc Routing Problem (CARP) has gathered a lot of interest lately. It has a wide range of applications in real world problems, such as waste collection, winter gritting, postal delivery, etc. A number of different algorithms have been proposed to efficiently solve this problem. As...

תיאור מלא

מידע ביבליוגרפי
מחבר ראשי: Mittal, Sameer.
מחברים אחרים: Ong Yew Soon
פורמט: Final Year Project (FYP)
שפה:English
יצא לאור: 2013
נושאים:
DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
DRNTU::Engineering
גישה מקוונת:http://hdl.handle.net/10356/52085

אינטרנט

http://hdl.handle.net/10356/52085

פריטים דומים