Generalization of the problem of sustainable container distribution by alternatively fueled vehicles

Abstract

We generalize a previously studied container pickup and delivery problem and relax several constraints by introducing heterogeneous vehicle speeds, distinct fuel consumption rates, partial refueling and operational costs, as well as allowing multiple visits to the same node. In some practical cases the earlier existed constraints result in no feasible solution or high transportation cost. A Mixed Integer Linear Programming model is developed for the more general problem. Preliminary computer experiments have shown that, in the same computing environment, the solution time of the new model is slightly shorter than the one of the old model for most of the same instances, and for a few instances it is slightly longer.