Abstract
This paper examines the use of evolutionary computation (EC) to find optimal solution in vehicle assignment problem (VAP). The VAP refers to the allocation of the expected number of people in a potentially flooded area to various types of available vehicles in evacuation process. A novel discrete particle swarm optimization (DPSO) algorithm and genetic algorithm (GA) are presented to solve this problem. Both of these algorithms employed a discrete solution representation and incorporated a min-max approach for a random initialization of discrete particle position. A min-max approach is based on minimum capacity and maximum capacity of vehicles. We analyzed the performance of the algorithms using evacuation datasets. The quality of solutions were measured based on the objective function which is to find a maximum number of assigned people to vehicles in the potentially flooded areas and central processing unit (CPU) processing time of the algorithms. Overall, DPSO provides an optimal solutions and successfully achieved the objective function whereas GA gives sub optimal solution for the VAP.KeywordsDiscrete Particle Swarm OptimizationEvacuation ProcessEvolutionary ComputationGenetic AlgorithmVehicle Assignment Problem
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
