Estimating box size from the contents
$begingroup$
I'm currently on week 4 of my Coursera course on ML, so I have much to learn about data science. However, I got the opportunity to apply what I've learned at work, and I'd like some guidance. Our company ships random objects to customers in boxes. We'd like to be able to estimate how big boxes will be, given the random objects inside.
Here's an example of the input data:
box # | contents | box size
----- | --------------------------------- | ---------
1 | a widget, a doodad, and a trinket | 20x12x8
2 | 3 widgets | 12x12x12
However, our list of items has a long tail. I did a count of total items shipped by object type, ordered by count descending. Here's the result:
rank | object count | object type
---- | ------------ | -----------
1 | 500,000 | doodad
2 | 350,000 | trinket
3 | 300,000 | widget
--- | snip | ---
50 | 6,000 | whatyoumacallits
--- | snip | ---
300 | 5 | quarts of blinker fluid
Etc. By item number 340, the count is 1, and there are 360 distinct items. I think one way to approach this at first would be to only consider the top 50 items, and try to do a simple polynomial regression with 50 features to estimate L, W, and H (assuming each variable is less than the previous one).
It won't be 100% accurate, but it will be better than wild guesses. But is there a better way to do this? Any advice is much appreciated.
machine-learning
New contributor
$endgroup$
add a comment |
$begingroup$
I'm currently on week 4 of my Coursera course on ML, so I have much to learn about data science. However, I got the opportunity to apply what I've learned at work, and I'd like some guidance. Our company ships random objects to customers in boxes. We'd like to be able to estimate how big boxes will be, given the random objects inside.
Here's an example of the input data:
box # | contents | box size
----- | --------------------------------- | ---------
1 | a widget, a doodad, and a trinket | 20x12x8
2 | 3 widgets | 12x12x12
However, our list of items has a long tail. I did a count of total items shipped by object type, ordered by count descending. Here's the result:
rank | object count | object type
---- | ------------ | -----------
1 | 500,000 | doodad
2 | 350,000 | trinket
3 | 300,000 | widget
--- | snip | ---
50 | 6,000 | whatyoumacallits
--- | snip | ---
300 | 5 | quarts of blinker fluid
Etc. By item number 340, the count is 1, and there are 360 distinct items. I think one way to approach this at first would be to only consider the top 50 items, and try to do a simple polynomial regression with 50 features to estimate L, W, and H (assuming each variable is less than the previous one).
It won't be 100% accurate, but it will be better than wild guesses. But is there a better way to do this? Any advice is much appreciated.
machine-learning
New contributor
$endgroup$
add a comment |
$begingroup$
I'm currently on week 4 of my Coursera course on ML, so I have much to learn about data science. However, I got the opportunity to apply what I've learned at work, and I'd like some guidance. Our company ships random objects to customers in boxes. We'd like to be able to estimate how big boxes will be, given the random objects inside.
Here's an example of the input data:
box # | contents | box size
----- | --------------------------------- | ---------
1 | a widget, a doodad, and a trinket | 20x12x8
2 | 3 widgets | 12x12x12
However, our list of items has a long tail. I did a count of total items shipped by object type, ordered by count descending. Here's the result:
rank | object count | object type
---- | ------------ | -----------
1 | 500,000 | doodad
2 | 350,000 | trinket
3 | 300,000 | widget
--- | snip | ---
50 | 6,000 | whatyoumacallits
--- | snip | ---
300 | 5 | quarts of blinker fluid
Etc. By item number 340, the count is 1, and there are 360 distinct items. I think one way to approach this at first would be to only consider the top 50 items, and try to do a simple polynomial regression with 50 features to estimate L, W, and H (assuming each variable is less than the previous one).
It won't be 100% accurate, but it will be better than wild guesses. But is there a better way to do this? Any advice is much appreciated.
machine-learning
New contributor
$endgroup$
I'm currently on week 4 of my Coursera course on ML, so I have much to learn about data science. However, I got the opportunity to apply what I've learned at work, and I'd like some guidance. Our company ships random objects to customers in boxes. We'd like to be able to estimate how big boxes will be, given the random objects inside.
Here's an example of the input data:
box # | contents | box size
----- | --------------------------------- | ---------
1 | a widget, a doodad, and a trinket | 20x12x8
2 | 3 widgets | 12x12x12
However, our list of items has a long tail. I did a count of total items shipped by object type, ordered by count descending. Here's the result:
rank | object count | object type
---- | ------------ | -----------
1 | 500,000 | doodad
2 | 350,000 | trinket
3 | 300,000 | widget
--- | snip | ---
50 | 6,000 | whatyoumacallits
--- | snip | ---
300 | 5 | quarts of blinker fluid
Etc. By item number 340, the count is 1, and there are 360 distinct items. I think one way to approach this at first would be to only consider the top 50 items, and try to do a simple polynomial regression with 50 features to estimate L, W, and H (assuming each variable is less than the previous one).
It won't be 100% accurate, but it will be better than wild guesses. But is there a better way to do this? Any advice is much appreciated.
machine-learning
machine-learning
New contributor
New contributor
New contributor
asked 2 days ago
SlotharioSlothario
101
101
New contributor
New contributor
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is known as "3D Bin Packing Problem" in literature.
https://en.wikipedia.org/wiki/Bin_packing_problem
Since this is NP-Hard; Some of the approaches are :
- Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem
- Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930
- Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc
$endgroup$
1
$begingroup$
Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
$endgroup$
– Slothario
2 days ago
$begingroup$
Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
$endgroup$
– Slothario
2 days ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "557"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Slothario is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f46946%2festimating-box-size-from-the-contents%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This is known as "3D Bin Packing Problem" in literature.
https://en.wikipedia.org/wiki/Bin_packing_problem
Since this is NP-Hard; Some of the approaches are :
- Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem
- Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930
- Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc
$endgroup$
1
$begingroup$
Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
$endgroup$
– Slothario
2 days ago
$begingroup$
Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
$endgroup$
– Slothario
2 days ago
add a comment |
$begingroup$
This is known as "3D Bin Packing Problem" in literature.
https://en.wikipedia.org/wiki/Bin_packing_problem
Since this is NP-Hard; Some of the approaches are :
- Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem
- Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930
- Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc
$endgroup$
1
$begingroup$
Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
$endgroup$
– Slothario
2 days ago
$begingroup$
Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
$endgroup$
– Slothario
2 days ago
add a comment |
$begingroup$
This is known as "3D Bin Packing Problem" in literature.
https://en.wikipedia.org/wiki/Bin_packing_problem
Since this is NP-Hard; Some of the approaches are :
- Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem
- Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930
- Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc
$endgroup$
This is known as "3D Bin Packing Problem" in literature.
https://en.wikipedia.org/wiki/Bin_packing_problem
Since this is NP-Hard; Some of the approaches are :
- Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem
- Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930
- Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc
answered 2 days ago
Shamit VermaShamit Verma
78426
78426
1
$begingroup$
Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
$endgroup$
– Slothario
2 days ago
$begingroup$
Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
$endgroup$
– Slothario
2 days ago
add a comment |
1
$begingroup$
Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
$endgroup$
– Slothario
2 days ago
$begingroup$
Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
$endgroup$
– Slothario
2 days ago
1
1
$begingroup$
Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
$endgroup$
– Slothario
2 days ago
$begingroup$
Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
$endgroup$
– Slothario
2 days ago
$begingroup$
Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
$endgroup$
– Slothario
2 days ago
$begingroup$
Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
$endgroup$
– Slothario
2 days ago
add a comment |
Slothario is a new contributor. Be nice, and check out our Code of Conduct.
Slothario is a new contributor. Be nice, and check out our Code of Conduct.
Slothario is a new contributor. Be nice, and check out our Code of Conduct.
Slothario is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Data Science Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f46946%2festimating-box-size-from-the-contents%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown