About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
WSC 2003
Conference paper
The modal-shift transportation planning problem and its fast steepest descent algorithm
Abstract
The Modal-Shift Transportation Planning Problem (MSTPP) is the problem that finds a feasible schedule for carriers with the minimum total cost when sets of facilities, delivery orders, and carriers are given. In this paper, we propose a fast steepest descent algorithm to solve the MSTPP. Our solution generates a set of candidate routes for each delivery order as a preprocess. Then, it finds a schedule by iteratively updating selections of the candidate routes in descent directions, while computing a configuration of carrier movements at each iteration by a greedy algorithm. Intensive numerical study using artificial data modeled from the manufacturing industry in Japan is also presented.