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


The load-dependent vehicle routing problem and its pick-up and delivery extension
Affiliation:1. Pamukkale University, Faculty of Engineering, Department of Industrial Engineering, Kinikli, 20070 Denizli, Turkey;2. Seoul National University, College of Engineering, Department of Industrial Engineering, Seoul 151-744, Republic of Korea;1. Departamento de Engenharia de Produção, Centro de Tecnologia, Universidade Federal da Paraíba Campus I, Bloco G, Cidade Universitária, 58051-970, João Pessoa–PB, Brazil;2. Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro-RJ, Brazil;3. Departamento de Computação Científica, Centro de Informática, Universidade Federal da Paraíba João Pessoa-PB, Brazil;1. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong;2. School of Information Technology, Jiangxi University of Finance and Economics, Nanchang, Jiangxi 330013, People’s Republic of China;3. International Center of Management Science and Engineering, School of Management and Engineering, Nanjing University, Nanjing 210093, People''s Republic of China;4. Department of Industrial & Systems Engineering, National University of Singapore, Singapore
Abstract:The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet.
Keywords:Vehicle routing  Cargo weight  Energy requirements  Local search
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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