首页 | 本学科首页   官方微博 | 高级检索  
     


A particle swarm optimization algorithm for open vehicle routing problem
Authors:SA MirHassani  N Abolghasemi
Affiliation:1. Universidade Federal da Paraíba, Departamento de Engenharia de Produção, Centro de Tecnologia, Campus I - Bloco G, Cidade Universitária, João Pessoa-PB 58051-970, Brazil;2. Universidade Federal Fluminense - Departamento de Engenharia de Produção, Rua Passo da Pátria 156, Bloco E - 4° andar, São Domingos, Niterói-RJ 24210-240, Brazil;3. Universidade Federal Fluminense - Instituto de Computação, Rua Passo da Pátria 156, Bloco E - 3°andar, São Domingos, Niterói-RJ 24210-240, Brazil;1. Department of Industrial Management, National Taiwan University of Science and Technology, No. 43, Section 4, Keelung Road, Taipei 106, Taiwan;2. Department of Industrial Engineering and Management, Bandung Institute of Technology, Ganesha 10, Bandung, West Java 40132, Indonesia;1. Pablo de Olavide University, Ctra. Utrera, Km 1, 41013 Seville, Spain;2. Alma Mater, University of Bologna, DEI “Guglielmo Marconi”, Viale Risorgimento, 2, 40136 Bologna, Italy;3. University of Málaga, Campus El Ejido s/n, 29071 Málaga, Spain;1. Laboratoire L.O.G.I.Q. – ISGIS, Université de Sfax, Route de Tunis, km 11 – B.P: 1164-3018, Sfax Tunisia;2. Laboratoire LMAH – ISEL, Université du Havre, 25 rue Philippe LEBON, B.P. 540-76058, Le Havre Cedex France;3. Institut des Hautes Etudes Commerciales de Sfax, University of Sfax, Route de Sidi Mansour km 10 – B.P. 1170-3018, Sfax Tunisia;1. Dept. of Electrical Power Engineering, Universiti Tenaga Nasional, 43000 Kajang, Selangor, Malaysia;2. Dept. of Civil and Structural Engineering, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia;3. Institute of Climate Change, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia;4. Dept. of Electrical, Electronic and Systems Engineering, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia
Abstract:This paper presents a real-value version of particle swarm optimization (PSO) for solving the open vehicle routing problem (OVRP) that is a well-known combinatorial optimization problem. In OVRP a vehicle does not return to the depot after servicing the last customer on a route. A particular decoding method is proposed for implementing PSO for OVRP. In the decoding method, a vector of the customer’s position is constructed in descending order. Then each customer is assigned to a route with taking into account feasibility conditions. Finally one-point move has been applied on constructed routes that seem promising to result in a better solution. Experimental evaluations on benchmark data sets demonstrate the competitiveness of the proposed algorithm.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号