EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1470. Reducing shipping cost of packages by optimizing the bin set
Invited abstract in session TA-7: Cutting and Packing 5 - related topics, stream Cutting and Packing (ESICUP).
Tuesday, 8:30-10:00Room: 1019 (building: 202)
Authors (first author is the speaker)
| 1. | Leon Binder
|
| Deggendorf Institute of Technology | |
| 2. | Johannes Kuchler
|
| 3. | Michael Scholz
|
| Deggendorf Institute of Technology |
Abstract
With the increasing number of parcels shipped worldwide, new ways to reduce the total shipping costs and CO2 emissions are actively searched. Past research primarily focused on finding bins that minimize the wasted volume for packing orders. Retailers, however, must decide about the bin sizes they will use for packing before any order will be packed. Having many bin sizes on stock will allow a retailer to more often select a bin with only some small wasted volume. Many bin sizes, on the other hand, increase costs for buying and storing bins as well as for selecting the best bin. To the best of our knowledge, the preliminary decision of what bin sizes a retailer should have on stock to minimize the total shipping cost is a yet unexplored optimization problem.
We focus on the NP-hard problem of finding bin sizes (i.e., bin set) that minimize the costs for packing and transporting a given set of orders. More specifically, we i) define the problem of finding cost-minimal bin sets, ii) provide an adapted metaheuristic to identify good solutions to the defined problem and iii) discuss possible extensions of the provided solution.
Keywords
- Metaheuristics
- E-Commerce
Status: accepted
Back to the list of papers