scholarly journals On a generalized problem of bin packing

2015 ◽  
Vol 1 (2) ◽  
pp. 14-21
Author(s):  
Nguyen Trong
Keyword(s):  
Bin Packing ◽  
Heuristic Algorithms ◽  
Case Analysis ◽  
Packing Problem ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Np Completeness ◽  
Bin Packing Problem

A generalization of the bin packing problem, called the DTMR problem is studied. The NP-completeness of  DTMR is proved. Three heuristic algorithms-the CNN, the CHT and the CSX are described and the worst-case analysis of them are given. Some applications of the DTMR are shown.

scholarly journals A-shaped bin packing: Worst case analysis via simulation

2005 ◽  
Vol 1 (3) ◽  
pp. 323-335
Author(s):  
Wenxun Xing ◽  
◽  
Feng Chen ◽  
Keyword(s):  
Bin Packing ◽  
Case Analysis ◽  
Worst Case Analysis ◽  
Worst Case

Heuristic Algorithms

2012 ◽  
pp. 238-267
Author(s):  
Laura Cruz Reyes ◽  
Claudia Gómez Santillán ◽  
Marcela Quiroz ◽  
Adriana Alvim ◽  
Patricia Melin ◽  
...  
Keyword(s):  
Large Scale ◽  
Bin Packing ◽  
Heuristic Algorithms ◽  
Packing Problem ◽  
Transportation System ◽  
Deterministic Algorithm ◽  
Computational Time ◽  
Routing Problem ◽  
Bin Packing Problem ◽  
Truck Loading

This chapter approaches the Truck Loading Problem, which is formulated as a rich problem with the classic one dimensional Bin Packing Problem (BPP) and five variants. The literature review reveals that related work deals with three variants at the most. Besides, few efforts have been done to combine the Bin Packing Problem with the Vehicle Routing Problem. For the solution of this new Rich BPP a heuristic-deterministic algorithm, named DiPro, is proposed. It works together with a metaheuristic algorithm to plan routes, schedules and loads. The objective of the integrated problem, called RoSLoP, consists of optimizing the delivery process of bottled products in a real application. The experiments show the performance of three version of the Transportation System. The best version achieves a total demand satisfaction, an average saving of three vehicles and a reduction of the computational time from 3 hrs to two minutes regarding their manual solution. For the large scale the authors have develop a competitive genetic algorithm for BPP. As future work, it is intended integrate the approximation algorithm to the transportation system.

Worst-case analysis of the subset sum algorithm for bin packing

2004 ◽  
Vol 32 (2) ◽  
pp. 159-166 ◽  
Author(s):  
Alberto Caprara ◽  
Ulrich Pferschy
Keyword(s):  
Bin Packing ◽  
Case Analysis ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Subset Sum

Worst-case analyses, linear programming and the bin-packing problem

1998 ◽  
Vol 83 (1-3) ◽  
pp. 213-227 ◽  
Author(s):  
Lap Mui Ann Chan ◽  
David Simchi-Levi ◽  
Julien Bramel
Keyword(s):  
Linear Programming ◽  
Bin Packing ◽  
Packing Problem ◽  
Worst Case ◽  
Bin Packing Problem
Sign in / Sign up

Export Citation Format

Share Document