.png){kind=icon}
.png){kind=icon}
Return
Iterative approaches for solving a multi-objective 2-dimensional vector packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2013.05.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we address a bi-objective 2-dimensional vector packing problem (Mo2-DBPP) that calls for packing a set of items, each having two sizes in two independent dimensions, say, a weight and a height, into the minimum number of bins. The weight corresponds to a hard constraint that cannot be violated while the height is a soft constraint. The objective is to find a trade-off between the number of bins and the maximum height of a bin. This problem has various real-world applications (computer science, production planning and logistics). Based on the special structure of its Pareto front, we propose two iterative resolution approaches for solving the Mo2-DBPP. In each approach, we use several lower bounds, heuristics and metaheuristics. Computational experiments are performed on benchmarks inspired from the literature to compare the effectiveness of the two approaches. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
2-Dimensional vector packing problem
Multi-objective optimization
Lower bounds
Heuristics
Metaheuristics
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W