Ograniczanie wyników
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote On the effectiveness of column generation for time constrained routing problems
EN
This paper describes how column generation techniques can be used to solve to optimality the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW). This problem is practically important and computationally challenging. It involves the joint optimization of the fleet mix and the set of delivery routes. The main contribution of this paper is to show, by an appropriate graph transformation, that the approach previously developed for the classical VRPTW, and based upon the use of the set partitioning formulation and the column generation techniques yields very good results for the FSMVRPTW. The proposed approach is the first optimization algorithm developed so far for the FSMVRPTW. Computational results are reported on a set of test problems with up to 80 customers.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.