2018
DOI: 10.1007/s10732-018-9382-0
|View full text |Cite
|
Sign up to set email alerts
|

A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(7 citation statements)
references
References 24 publications
0
7
0
Order By: Relevance
“…In this piece of research, a significant limitation, known as vehicle capacity, is included in the model to give it more significance and bring it closer to the actual world Dell'Amico et al (2020) describe how the researchers solved their model by applying the precise branch and pricing method to their issue and analyzing it under a variety of conditions. Spencer et al (2019) developed a scheme for organizing products into containers intended for cold things. The primary objective of these researchers in this article was to cut down on the number of packages utilized, lower the average beginning temperature of each shipment and reduce the time it took to deliver the product to the consumer.…”
Section: -Literature Reviewmentioning
confidence: 99%
“…In this piece of research, a significant limitation, known as vehicle capacity, is included in the model to give it more significance and bring it closer to the actual world Dell'Amico et al (2020) describe how the researchers solved their model by applying the precise branch and pricing method to their issue and analyzing it under a variety of conditions. Spencer et al (2019) developed a scheme for organizing products into containers intended for cold things. The primary objective of these researchers in this article was to cut down on the number of packages utilized, lower the average beginning temperature of each shipment and reduce the time it took to deliver the product to the consumer.…”
Section: -Literature Reviewmentioning
confidence: 99%
“…This assumes the existence of pairs of items to pack that we should avoid to place together in the same bin. Spencer et al (2019) present a multiobjective bin packing problem with three competing goals for storing cooling objects. Besides minimizing the number of boxes, it minimizes the average initial heat of each box and the time until the boxes can be moved to the storefront.…”
Section: Multiobjective Optimization In Packing Problemsmentioning
confidence: 99%
“…They used the exact branch and price algorithm to solve their model and examined their issue under various problems. Spencer et al (2019) modeled a problem of arranging goods in packages for cold objects. Their main goal in this article was to reduce the number of packages used, reduce the average initial temperature of each package and reduce the minimum delivery time of the package to the customer.…”
Section: Literature Reviewmentioning
confidence: 99%