A tabu search heuristic for the local container drayage problem under a new operation mode |
| |
Affiliation: | 1. Department of Business Administration, University of Vienna, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria;2. Chair in Logistics and Transportation, HEC Montréal, 3000, chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada |
| |
Abstract: | This paper examines the Local Container Drayage Problem (LCDP) under an operation mode in which a tractor can be detached from its companion trailer and assigned to a new task. We have incorporated a set of temporal constraints into the classical VRP to realize this operation by utilizing the idle time available to tractors and coordinating the empty containers moving between customers. A tabu search algorithm is proposed. Some numerical experiments are conducted to assess the performance of the proposed algorithm, quantify the benefit of the new operation mode, and identify the conditions under which the mode is effective. |
| |
Keywords: | Local container drayage Tractor and trailer separation Vehicle routing and scheduling Temporal constraints Tabu search |
本文献已被 ScienceDirect 等数据库收录! |
|