<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>The problem of packing with items with conflicting time-window dependence on profit considering departure time is studied in the context of consolidation of goods in transport, which is a practical problem in the logistics industry. The objective is to select the loading plan that is most profitable based on the volume and time windows of the items. The time windows of items in the same box must intersect, and the intersection of the items’ time windows affects the box’s departure time and hence the profit-dependent time. The problem is identified as an integer programming model for decision making, and two modeling strategies are proposed to address it by improving the GRASP heuristic. Multi-class examples are used in experiments to confirm that the improved algorithm can solve the problem efficiently, find the near-optimal solution in a shorter time, and enhance customer satisfaction.</p>
</abstract>

The problem of packing with items with conflicting time-window dependence on profit considering departure time is studied in the context of consolidation of goods in transport, which is a practical problem in the logistics industry. The objective is to select the loading plan that is most profitable based on the volume and time windows of the items. The time windows of items in the same box must intersect, and the intersection of the items’ time windows affects the box’s departure time and hence the profit-dependent time. The problem is identified as an integer programming model for decision making, and two modeling strategies are proposed to address it by improving the GRASP heuristic. Multi-class examples are used in experiments to confirm that the improved algorithm can solve the problem efficiently, find the near-optimal solution in a shorter time, and enhance customer satisfaction.

Bin Packing Problem with Item Time Window Conflict Dependent Profits

Applied Mathematics and Nonlinear Sciences

This work is licensed under the Creative Commons Attribution 4.0 International License.

{"article-title":"Bin Packing Problem with Item Time Window Conflict Dependent Profits"}

The problem of packing with items with conflicting time-window dependence on profit considering departure time is studied in the context of consolidation of...

Bin Packing Problem with Item Time Window Conflict Dependent Profits

Pubblicato online: 01 apr 2024

Pagine: -

Ricevuto: 22 gen 2024

Accettato: 29 gen 2024

DOI: https://doi.org/10.2478/amns-2024-0708

Parole chiave
Boxing problem, Time-dependent profit, Time window, GRASP-VND algorithm, Iterative local search

© 2024 Jiayue Ren, published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Bin Packing Problem with Item Time Window Conflict Dependent Profits

Pubblicato online: 01 apr 2024

Pagine: -

Ricevuto: 22 gen 2024

Accettato: 29 gen 2024

DOI: https://doi.org/10.2478/amns-2024-0708

Parole chiaveBoxing problem, Time-dependent profit, Time window, GRASP-VND algorithm, Iterative local search

© 2024 Jiayue Ren, published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Parole chiave
Boxing problem, Time-dependent profit, Time window, GRASP-VND algorithm, Iterative local search