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ę "bin packing problem" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Multi-Criteria 3-Dimension Bin Packing Problem
Autorzy:
Kacprzak, Ł.
Rudy, J.
Żelazny, D.
Powiązania:
https://bibliotekanauki.pl/articles/409522.pdf
Data publikacji:
2015
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
bin packing problem
multi-criteria
genetic algorithm
simulated annealing
discrete optimization
Pareto efficiency
Opis:
In this paper a multi-criteria approach to the 3-dimensions bin packing problem is considered. The chosen maximization criteria are the number and the total volume of the boxes loaded into the container. Existing solution representation and decoding method are applied to the problem. Next, two metaheuristic algorithms, namely simulated annealing and genetic algorithm are developed using the TOPSIS method for solution evaluation. Both algorithms are then used to obtain approximations of the Pareto front for a set of benchmarks from the literature. Despite the fact that both criteria work in favor of each other, we managed to obtain multiple solutions in many cases, proving that lesser number of boxes can lead to better utilization of the container volume and vice versa. We also observed, that the genetic algorithms performs slightly better in our test both in the terms of hyper-volume indicator and number of non-dominated solutions.
Źródło:
Research in Logistics & Production; 2015, 5, 1; 85-94
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimization of the wood wastes for an industry of furnishing: a two dimensional cutting stock problem
Autorzy:
Bouaine, A.
Lebbar, M.
Ha, M. A.
Powiązania:
https://bibliotekanauki.pl/articles/952864.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
two-dimensional cutting stock problem
industry of furnishing
heuristic in two stages
bin packing problem
generating patterns
Opis:
This paper presents the modeling and the resolution of a two dimensional cutting stock problem for a wooden industry. It is about a real problem of minimization of the wood wastes for an industry of furnishing. The raw material to be cut is a set of beams of various sizes. The purpose of the cut is to supply a list of orders characterized by a set of articles of various sizes. The problem is converted into an integer linear program where the decision variables are the numbers of beams to cut according to a set of feasible “patterns”. The designed solution is a heuristic in two stages: – Generation of the feasible patterns by various classic heuristics of the Bin-packing Problem. – Resolution of the integer linear program with the generated patterns as input variables. Moreover, based on this approach, the “Application Cutting Optimization” is developed to allow the immediate resolution of the problem and widening the stock management horizon. To end, a real case is studied to confirm the effectiveness of this approach.
Źródło:
Management and Production Engineering Review; 2018, 9, 2; 42-51
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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