Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Sieci logistyczne" wg kryterium: Temat


Wyświetlanie 1-1 z 1
Tytuł:
Reverse Logistics Network Problem using simulated annealing with and without priority-algorithm
Autorzy:
Benaissa, M.
Slama, I.
Dhiaf, M. M.
Powiązania:
https://bibliotekanauki.pl/articles/223903.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
reverse logistics
Logistics Network Problem
mrLNP
priority-based encodin
simulated annealing
logistyka odwrotna
sieci logistyczne
Opis:
In recent years, Reverse Logistics (RL) has become a field of importance for all organizations due to growing environmental concerns, legislation, corporate social responsibility and sustainable competitiveness. In Reverse logistics, the used or returned products are collected after their acquisition and inspected for sorting into the different categories. The next step is to disposition them for repair, remanufacturing, recycling, reuse or final disposal. Manufacturers may adopt reverse logistics by choice or by force, but they have to decide whether performing the activities themselves or outsourcing to a third party (Martin et al., 2010). Lourenço et al., (2003) described three main areas of improvement within the RL process. Firstly, companies can reduce the level of returns through the analysis of their causes. Secondly, they can work on the improvement of the return’s process and, thirdly, they can create value from the returns. This paper considers the multistage reverse Logistics Network Problem (mrLNP) proposed by Lee et al., (2008). With minimizing the total of costs to reverse logistics shipping cost. We will demonstrate the mrLNP model will be formulated as a three-stage logistics network model. Since such network design problems belong to the class of NP-hard problems we propose a Simulated Annealing (SA) and simulated annealing with priority (priSA) with special neighborhood search mechanisms to find the near optimal solution consisting of two stages. Computer simulations show the several numerical examples by using, SA, priSA and priGA(Genetic algorithm with priority-based encoding method) and effectiveness of the proposed method.
Źródło:
Archives of Transport; 2018, 47, 3; 7-17
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-1 z 1

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies