Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: routing problem

Sortuj według:

Ogranicz wyniki do:

On the effectiveness of column generation for time constrained routing problems

100%

Haouari M.

tom Vol. 26, No. 3

215-224

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.

Overview of shufflenet and its variations in lightwave networks

88%

Bhattacharya U. , Ghassemlooy Z.

tom Vol. 31, No. 3-4

193-220

This paper outlines a review of application of ShuffleNet and its variations as logical topologies in lightwave networks and tries to consolidate the results reported so far. ShuffleNet, a very popular interconnection structure, proposed by Acampora as a logical topology in multihop optical networks has been generalized later with a view to obtaining a network topology for optimal throughput. Bilayered ShuffleNet has been designed to reduce the diameter and average hop distance compared to ShuffleNet. But, absence of any simple bidirectional self-routing scheme in Bilayered ShuffleNet led to design SW-Banyan network, an isornorphic equivalent of the ShuffleNet offering a convenient layout. Bi-directional ShuffleNet facilitates lesser hopping distance between any source-destination pair compared to ShuffleNet. Multistar Implementation of expandable ShuffleNet and GEMNet have been developed to insert flexibility in the structure of ShuffleNet.

Selected multicriteria shortest path problems: an analysis of complexity, models and adaptation of standard algorithms

75%

Tarapata Z.

tom 17

nr 2

269-287

The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness of solving selected MOSP problems defined as mathematical programming problems (using the CPLEX 7.0 solver) and multi-weighted graph problems (using modified Dijkstra's algorithm) is given. Experimental results of using the presented methods for multicriteria path selection in a terrain-based grid network are given.