A memetic algorithm for the open capacitated arc routing problem |
| |
| Institution: | 1. Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong;2. Department of Industrial Engineering & Logistics Management, School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, PR China;1. New York University, United States;2. St. Petersburg Department of Steklov Institute of Mathematics, Russian Federation;3. St. Petersburg Academic University and St. Petersburg Department of Steklov Institute of Mathematics, Russian Federation;1. School of Computer Science and Technology, Xidian University, Xi׳an, China;2. School of Software, Xidian University, Xi׳an, China;3. School of Computer Science and Information Technology, RMIT University, Melbourne, Australia;1. School of Geographic and Environmental Sciences, Guizhou Normal University, Guiyang 550001, Guizhou, China;2. School of Architecture and Civil Engineering, Xiamen University, Xiamen 361005, China;3. School of Materials and Architectural Engineering, Guizhou Normal University, Guiyang 550001, Guizhou, China;1. Department of Industrial Engineering, Mazandaran University of Science & Technology, Babol, Iran;2. Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran |
| |
| Abstract: | In this paper, an open capacitated arc routing problem (OCARP) is defined and considered. The OCARP seeks to find a set of minimum-cost open routes that can serve the tasks (i.e., required arcs) of a given graph, subject to the vehicle capacity and travel distance. A mathematical programming formulation and a lower bound are established. An effective memetic algorithm is developed for solving the OCARP. Computational experiments demonstrate that the proposed algorithm can produce high quality solutions within a reasonable computational time span, and the proposed memetic algorithm is superior to the classical genetic algorithm in solution quality. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
