A Preliminary Study on Score-Based Hyper-heuristics for Solving the Bin Packing Problem
Sign Up to like & getrecommendations! Published in 2020 at "Pattern Recognition"
DOI: 10.1007/978-3-030-49076-8_30
Abstract: The bin packing problem is a widespread combinatorial problem. It aims at packing a set of items by using as few bins as possible. Among the many available solving methods, approximation ones such as heuristics… read more here.
Keywords: preliminary study; bin packing; hyper heuristics; problem ... See more keywords
Bin packing problem with scenarios
Sign Up to like & getrecommendations! Published in 2019 at "Central European Journal of Operations Research"
DOI: 10.1007/s10100-018-0574-3
Abstract: Scheduling over scenarios is one of the latest approaches in modelling scheduling problems including uncertainty. However, to the best of our knowledge, scenarios have never been applied to the bin packing problem, so here we… read more here.
Keywords: problem scenarios; bin packing; scenario; packing problem ... See more keywords
The sphere packing problem into bounded containers in three-dimension non-Euclidean space
Sign Up to like & getrecommendations! Published in 2018 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2018.11.450
Abstract: Abstract This paper deals with the problem of optimal packing a given number of equal spheres into different closed sets. We consider the problem both in three-dimensional Euclidean and non-Euclidean spaces. The special algorithm based… read more here.
Keywords: space; problem bounded; non euclidean; problem ... See more keywords
Applying triple-block patterns in solving the two-dimensional bin packing problem
Sign Up to like & getrecommendations! Published in 2018 at "Journal of the Operational Research Society"
DOI: 10.1057/s41274-016-0148-5
Abstract: This paper presents a heuristic for the guillotine two-dimensional bin packing problem, where a set of rectangular items are packed using guillotine patterns into bins of the same size, such that the number of bins… read more here.
Keywords: triple block; dimensional bin; block patterns; two dimensional ... See more keywords
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Sign Up to like & getrecommendations! Published in 2020 at "Journal of the Operational Research Society"
DOI: 10.1080/01605682.2018.1542959
Abstract: Abstract In this article, we consider a variant of the bandwidth packing problem, in which some demands need to be scheduled within given time windows. The emergence of cloud services has introduced a new challenge… read more here.
Keywords: packing problem; heuristic algorithm; problem; bandwidth packing ... See more keywords
Rectangle Packing Problem for Battery Charging Dispatch Considering Uninterrupted Discrete Charging Rate
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Power Systems"
DOI: 10.1109/tpwrs.2019.2892615
Abstract: A battery charging dispatch model is proposed in this letter for a battery swap station to maximize the total profit over the given time horizon by finding the optimal dispatch of the batteries, while guaranteeing… read more here.
Keywords: packing problem; problem; rectangle packing; battery charging ... See more keywords
Hybridizing Beam Search with Tabu Search for the Irregular Packing Problem
Sign Up to like & getrecommendations! Published in 2021 at "Mathematical Problems in Engineering"
DOI: 10.1155/2021/5054916
Abstract: The irregular packing problem involves arranging all the irregular pieces on a plate with the objective of maximizing the use of material. In this article, the layout is formed by the ordered sequence of the… read more here.
Keywords: irregular packing; search; beam search; packing problem ... See more keywords
A global dichotomous search-based heuristic for the three-dimensional sphere packing problem
Sign Up to like & getrecommendations! Published in 2018 at "International Journal of Operational Research"
DOI: 10.1504/ijor.2018.10016371
Abstract: In this paper, we propose a global dichotomous search-based heuristic for solving the three-dimensional sphere packing problem. In the sphere packing problem, we are given a set of predefined unequal spheres and a large container… read more here.
Keywords: search; global dichotomous; dichotomous search; problem ... See more keywords