Temat: time windows - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Sequential simulated annealing for the vehicle routing problem with time windows
Autorzy:: Woch, M.
Łebkowski, P.
Powiązania:: https://bibliotekanauki.pl/articles/375944.pdf
Data publikacji:: 2009
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: simulated annealing
vehicle routing problem with time windows
bi-criterion optimization
Opis:: This article presents a new simulated annealing algorithm that provides very high quality solutions to the vehicle routing problem. The aim of described algorithm is to solve the vehicle routing problem with time windows. The tests were carried out with use of some well known instances of the problem defined by M. Solomon. The empirical evidence indicates that simulated annealing can be successfully applied to bi-criterion optimization problems.
Źródło:: Decision Making in Manufacturing and Services; 2009, 3, 1-2; 87-100
1896-8325
2300-7087
Pojawia się w:: Decision Making in Manufacturing and Services
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Clustering heuristic for time-dependent periodic routing problems with complex constraints
Autorzy:: Śliwiński, Tomasz
Powiązania:: https://bibliotekanauki.pl/articles/2037446.pdf
Data publikacji:: 2020
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: periodic vehicle routing
time windows
assignment problem
okresowe wyznaczanie tras pojazdów
okna czasowe
problem przydziału
Opis:: Periodic routing and scheduling is of utmost importance in many industries with mobile personnel working in the field: sales representatives, service technicians, suppliers, etc. The resulting optimization problems are of large scale and complexity, mostly due to discrete, combinatorial nature of the systems and due to complicated, nonuniform constraints. In many cases the long-term stability of the customer to personnel allocation is required, leading to the decomposition of the major problem into single employee subproblems. The paper deals with building clusters of customers visited by a single salesperson. The procedure takes into account diverse system requirements and constraints, possible traveling schedules and expected operational costs. The difficulty of the problem lies in its large scale and constraints complexity as well as in troublesome objective evaluation for the given solution. The general solution concept is presented. Its usefulness is supported by the results of the computational experiments.
Źródło:: Decision Making in Manufacturing and Services; 2020, 14, 2; 181-192
1896-8325
2300-7087
Pojawia się w:: Decision Making in Manufacturing and Services
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "time windows" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język