              1 MARINA YUSOFF, 2 JUNAIDAH ARIFFIN, 1 AZLINAH MOHAMED 1 Faculty of Computer and Mathematical Sciences Universiti Teknologi MARA 40450 Shah Alam, Selangor MALAYSIA {marinay, azlinah}@tmsk.uitm.edu.my 2 Flood3Marine Excellence Centre Faculty of Civil Engineering Universiti Teknologi MARA 40450 Shah Alam, Selangor MALAYSIA junaidahariffin@yahoo.com   During the evacuation process, the most challenging task is to move people to safer locations. As time is the decision factor in the evacuation process, urgent and firmly decisions are required. An evacuation plan should be efficiently constructed by taking into account the routes of vehicle. This paper explored the feasibility of using a discrete particle swarm optimization (DPSO) algorithm to solve evacuation vehicle routing problem (EVRP) problem focusing on a static vehicle routing. A linear mathematical formulation is constructed with the objective to find a minimum total travelling of the capacitated vehicles from vehicle location to various number flooded areas. A solution representation based on a search decomposition procedure is proposed to accommodate the routing process and mapped to the discrete multi3valued particle in DPSO. Computational experiment involves datasets from the event of flash flood. Comparative analyses were carried on both DPSO and GA. The results indicate that the DPSO are highly competitive and showed good performance in both fitness value (total travelling time) and processing time.   Discrete particle swarm optimization, Evacuation planning, Flash flood, Genetic algorithm, Search decomposition   A lot of people have to be safely evacuated at the shortest possible time to avoid loss of lives during disaster. Much effort has been done in producing manual evacuation guideline [132], developing evacuation system [3], developing simulation [435], and developing a wide variety of algorithms [537] to facilitate the evacuation operation for different types of disasters. During the evacuation process, the most challenging task is to move people to safer locations. As time is the decision factor in the evacuation process, urgent and firmly decisions are required. An evacuation plan should be efficiently constructed by taking into consideration the routes of vehicle. This paper addresses the evacuation vehicle routing problem (EVRP) that considers the routing of capacitated vehicles from a vehicle location (single source) to various numbers of potential flooded areas (PFA). This problem is seemed similar to vehicle routing problem (VRP). EVRP is associated with the routing of vehicles to destinations with limitations of vehicle capacity and depends on the standard travelling speed of each vehicle. Commonly, EVRP relies on the same core problem of the vehicle routing problem (VRP). The VRP which was introduced by Dantzig and Ramser in 1959 [8] is customer based oriented and involves the routing of an unlimited number of vehicles from the depot to customer locations and return to depot with the shortest travelling cost [9310]. Recent Researches in Computational Techniques, Non-Linear Systems and Control ISBN: 978-1-61804-011-4 270