登入選單
返回Google圖書搜尋
出版CIRRELT, 2014
ISBN28952440309782895244035
URLhttp://books.google.com.hk/books?id=tJlprgEACAAJ&hl=&source=gbs_api
註釋In this paper we introduce the Vehicle Routing Problem with Pauses (VRPP). This problem arises when drivers must make pauses during their shift, for example, for lunch breaks. Drivers breaks have already been considered in long haul transportation when drivers must rest during their travel, but their technical and scientifical aspects have been mostly neglected in the less than truckload and last mile distribution contexts up to date. In this paper we introduce the first mathematical formulation for the VRPP. This linear formulation has the disadvantage of roughly doubling the number of nodes, and thus significantly increasing the size of the distance matrix and the number of variables. Consequently, standard branch-and-bound algorithms are only capable of solving very small-sized instances. In order to tackle large instances, we propose a fast local search-based heuristic tailored for the VRPP, which is shown to be very efficient. Through a series of computational experiments, we show that solving the VRPP without explicitly considering the pauses during the optimization can lead to a number of infeasibilities and to higher solution costs. These results demonstrate the importance of integrating drivers pauses in the resolution process.--Résumé de l'éditeur.