An effective tabu search approach with improved loading algorithms for the 3L-CVRP |
| |
Affiliation: | 1. Aviation Academy, Amsterdam University of Applied Sciences, Amsterdam, Netherlands;2. Opein Inc., Gran Canaria, Canary Islands, Spain;3. IN3 – Computer Science, Multimedia and Telecommunication Dept., Universitat Oberta de Catalunya, Barcelona, Spain;1. School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, Jiangxi, People’s Republic of China;2. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong;3. Department of Computer Science, Xiamen University, Xiamen 361005, China;4. School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371, Singapore;5. International Center of Management Science and Engineering, School of Management and Engineering, Nanjing University, Nanjing 210093, People’s Republic of China;1. School of Information Science and Engineering, Xiamen University, Xiamen, China;2. Department of Computer and Information Science, University of Macau, Macau, China;3. Department of Maritime and Mechanical Engineering, Liverpool John Moores University, Liverpool, England United Kingdom\n;1. Department of Mathematics and Computer Science, University of Hagen, 58097 Hagen, Germany;2. Department of Management Science, Otto von Guericke University, 39106 Magdeburg, Germany |
| |
Abstract: | In this paper, we consider the Three-Dimensional Loading Capacitated Vehicle Routing Problem(3L-CVRP) which combines the routing of a fleet of vehicles and the loading of three-dimensional shaped goods into the vehicles while minimizing the total travel distance incurred. Apparently, 3L-CVRP is a combination of capacitated vehicle routing and three-dimensional bin packing problem and thus of high complexity. Different from most of previous works, we propose an innovative approach, called improved least waste heuristic for solving the loading subproblem, which is iteratively invoked by a simple tabu search algorithm for the routing. The good performance in terms of the solution quality and computational efficiency of our approach is shown through the numerical experiments on the benchmark instances from literature. |
| |
Keywords: | Capacitated vehicle routing Three-dimensional loading Improved least waste heuristic Tabu search |
本文献已被 ScienceDirect 等数据库收录! |
|