Heuristics for the One-Dimensional Bin Packing Problem with Time Windows
Clicks: 1
ID: 310047
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
0.0
/100
1 views
0 readers
AI Quality Assessment
Not analyzed
Readership in this journal
Ranked #320 of 490 articles by views in Frontiers in surgery
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 490 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Abstract: This paper introduces and studies the One-Dimensional Bin Packing Problem with Time Windows (1DBPP-TW)—a variant of the bin packing problem (BPP) with critical applications in the logistics industry. Despite extensive research on BPP, existing time-constrained BPP studies focus on variable-sized bins (VSBPPTW), while 1DBPP-TW— featuring homogeneous bins and a requirement for a common time point among items in the same bin—remains understudied. Given the NP-completeness of BPP, heuristic and metaheuristic algorithms are preferred for large-scale instances, as exact methods are computationally infeasible. To address this gap, we propose two efficient algorithms: the Greedy on Time Range (GTR) heuristic (optimized for real-time responsiveness, achieving solutions in ≤0.001s for large instances with deterministic, reliable outputs) and the Iterative Local Search (ILS) metaheuristic (enhanced with three neighborhood operators to improve convergence rate, delivering 7.3% average bin reduction over GTR). We first establish a mathematical model for 1DBPP-TW, then generate two benchmark datasets—optimal solution-known instances (opt) and random instances (rand)—for validation. Experimental results show that GTR and ILS efficiently solve 1DBPP-TW: for medium and large instances, they achieve better computational efficiency and comparable or higher solution quality than the linear programming solver CPLEX within a 3600s time limit. Practically, these algorithms address industry pain points such as low loading efficiency and time window conflicts. Theoretically, this work advances combinatorial optimization theory for time-constrained BPP variants and provides a benchmark for future research.
| Reference Key |
imported_1768918447_696f8dafb3be5
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Zheng, Dengheng |
| Journal | Frontiers in surgery |
| Year | Year not found |
| DOI |
10.3389/fams.2026.1741977
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.