NDLI: A hybrid algorithm for constrained order packing

Content Provider	Springer Nature Link
Author	Furian, Nikolaus Vössner, Siegfried
Copyright Year	2013
Abstract	Constraint order packing, which is an extension to the classical two-dimensional bin packing, adds an additional layer of complexity to known bin packing problems by new additional placement and order constraints. While existing meta heuristics usually produce good results for common bin packing problems in any dimension, they are not able to take advantage of special structures resulting from these constraints in this particular two-dimensional prolbem type. We introduce a hybrid algorithm that is based on greedy search and is nested within a network search algorithm with dynamic node expansion and meta logic, inspired by human intuition, to overrule decisions implied by the greedy search. Due to the design of this algorithm we can control the performance characteristics to lie anywhere between classical network search algorithms and local greedy search. We will present the algorithm, discuss bounds and show that their performance outperforms common approaches on a variety of data sets based on industrial applications. Furthermore, we discuss time complexity and show some ideas to speed up calculations and improve the quality of results.
Starting Page	157
Ending Page	186
Page Count	30
File Format	PDF
ISSN	1435246X
Journal	Central European Journal of Operations Research
Volume Number	22
Issue Number	1
e-ISSN	16139178
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2013-03-16
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Bin packing Constraints Heuristics Shortest path Operations Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Constrained order packing: comparison of heuristic approaches for a new bin packing problem

An exact algorithm for the type-constrained and variable sized bin packing problem

Constructive heuristics for the canister filling problem

A heuristic for solving large bin packing problems in two and three dimensions

A computational study of solution approaches for the resource constrained elementary shortest path problem

An effective heuristic for the two-dimensional irregular bin packing problem

Two heuristics for the one-dimensional bin-packing problem

A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing

Cardinality constrained bin‐packing problems

A hybrid algorithm for constrained order packing

Similar Documents

Constrained order packing: comparison of heuristic approaches for a new bin packing problem

An exact algorithm for the type-constrained and variable sized bin packing problem

Constructive heuristics for the canister filling problem

A heuristic for solving large bin packing problems in two and three dimensions

A computational study of solution approaches for the resource constrained elementary shortest path problem

An effective heuristic for the two-dimensional irregular bin packing problem

Two heuristics for the one-dimensional bin-packing problem

A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing

Cardinality constrained bin‐packing problems

A hybrid algorithm for constrained order packing