research-article

Planning in logistics: a survey

Authors:

Henrik ChristensenAuthors Info & Claims

PerMIS '10: Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop

Pages 48 - 53

https://doi.org/10.1145/2377576.2377586

Published: 28 September 2010 Publication History

Abstract

Planning is an essential part of any logistics system. The paper tries to generalize the view of a logistics planner by framing it as a knapsack problem. We show how the various variants of the knapsack problem compare for different types of industries. We also introduce the pallet stacking problem and survey some of the recent advances made towards this problem.

References

[1]

J. Beasley. Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society, pages 297--306, 1985.

[2]

A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press Cambridge, 1998.

Digital Library

[3]

M. Boschetti, A. Mingozzi, and E. Hadjiconstantinou. New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem. IMA Journal of Management Mathematics, 13(2):95, 2002.

[4]

A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research, 123(2):333--345, 2000.

[5]

T. Cormen. Introduction to algorithms. The MIT press, 2001.

[6]

K. Dowsland and W. Dowsland. Packing problems. European Journal of Operational Research, 56(1):2--14, 1992.

[7]

J. Egeblad and D. Pisinger. Heuristic approaches for the two-and three-dimensional knapsack packing problem. Computers & Operations Research, 36(4):1026--1049, 2009.

Digital Library

[8]

S. Fekete and J. Schepers. A new exact algorithm for general orthogonal d-dimensional knapsack problems. In Algorithms - ESA'97, pages 144--156. Springer, 1997.

Digital Library

[9]

S. Fekete and J. Schepers. On more-dimensional packing III: Exact algorithms. Discrete Applied Mathematics, 1997.

[10]

S. Fekete, J. Schepers, and J. van der Veen. An exact algorithm for higher-dimensional orthogonal packing. Arxiv preprint cs/0604045, 2006.

[11]

A. Fiat and G. Woeginger. Online algorithms: The state of the art. Springer Berlin, 1998.

[12]

C. Guéret and C. Prins. A new lower bound for the open-shop problem. Annals of Operations Research, 92:165--183, 1999.

[13]

E. Hadjiconstantinou and N. Christofides. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research, 83(1):39--56, 1995.

[14]

E. Hopper and B. Turton. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128(1):34--57, 2001.

[15]

O. Ibarra and C. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM (JACM), 22(4):463--468, 1975.

[16]

H. Kellerer and U. Pferschy. A new fully polynomial approximation scheme for the knapsack problem. Approximation Algorithms for Combinatiorial Optimization, pages 123--134, 1998.

Digital Library

[17]

H. Kellerer and U. Pferschy. Improved dynamic programming in connection with an FPTAS for the knapsack problem. Journal of Combinatorial Optimization, 8(1):5--11, 2004.

[18]

H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack problems. Springer Verlag, 2004.

[19]

A. Kleywegt and J. Papastavrou. The dynamic and stochastic knapsack problem. Operations Research, 46(1):17--35, 1998.

Digital Library

[20]

A. Kleywegt and J. Papastavrou. The dynamic and stochastic knapsack problem with random sized items. Operations Research, pages 26--41, 2001.

Digital Library

[21]

E. Lawler. Fast approximation algorithms for knapsack problems. In 18th Annual Symposium on Foundations of Computer Science, 1977., pages 206--213, 1977.

Digital Library

[22]

A. Lodi, S. Martello, and D. Vigo. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11(4):345--357, 1999.

Digital Library

[23]

A. Marchetti-Spaccamela and C. Vercellis. Stochastic on-line knapsack problems. Mathematical Programming, 68(1):73--104, 1995.

Digital Library

[24]

S. Martello, M. Monaci, and D. Vigo. An exact approach to the strip-packing problem. INFORMS Journal on Computing, 15(3):310, 2003.

Digital Library

[25]

S. Martello and P. Toth. Knapsack problems: algorithms and computer implementations. 1990.

[26]

J. Papastavrou, S. Rajagopalan, and A. Kleywegt. The dynamic and stochastic knapsack problem with deadlines. Management Science, 42(12):1706--1718, 1996.

Digital Library

[27]

S. Sahni. Approximate algorithms for the 0/1 knapsack problem. Journal of the ACM (JACM), 22(1):115--124, 1975.

[28]

S. Taboun and S. Bhole. A simulator for an automated warehousing system. Computers & Industrial Engineering, 24(2):281--290, 1993.

Digital Library

[29]

R. Tsai, E. Malstrom, and W. Kuo. A three dimensional dynamic palletizing heuristic. Progress in Material Handling and Logistics, 2:181--201.

[30]

R. Van Slyke and Y. Young. Finite horizon stochastic knapsacks with applications to yield management. Operations Research, 48(1):155--172, 2000.

Digital Library

[31]

H. Yaman and A. Sen. Manufacturer's mixed pallet design problem. European Journal of Operational Research, 186(2):826--840, 2008.

Cited By

Murdivien SUm J(2023)BoxStacker: Deep Reinforcement Learning for 3D Bin Packing Problem in Virtual Environment of Logistics SystemsSensors10.3390/s2315692823:15(6928)Online publication date: 3-Aug-2023
https://doi.org/10.3390/s23156928
Liu YTao XLi XColombo AHu S(2023)Artificial Intelligence in Smart Logistics Cyber-Physical Systems: State-of-The-Arts and Potential ApplicationsIEEE Transactions on Industrial Cyber-Physical Systems10.1109/TICPS.2023.32832301(1-20)Online publication date: 2023
https://doi.org/10.1109/TICPS.2023.3283230
Grzejszczak TGałuszka AŚmieja JHarasny MZalwert M(2023)Prediction of Transportation Orders in Logistics Based on LSTM: Cargo TaxiAdvances in Computational Intelligence10.1007/978-3-031-43078-7_33(403-410)Online publication date: 1-Oct-2023
https://doi.org/10.1007/978-3-031-43078-7_33
Show More Cited By

Recommendations

Model-Based Integrated Planning for Logistics Service Contracts
EDOCW '13: Proceedings of the 2013 17th IEEE International Enterprise Distributed Object Computing Conference Workshops

In the past, logistics used to be a core function of production and trading companies but many of them started to outsource at least parts of their logistics functions to specialized logistics service providers in terms of logistics contracts. With this,...
Domain-independent temporal planning in a planning-graph-based approach

Many planning domains have to deal with temporal features that can be expressed using durations that are associated to actions. This paper presents a temporal planning approach that combines the principles of Graphplan and TGP, and uses the information ...
On modeling planning problems in tabled logic programming
PPDP '15: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming

Current research in planning focuses mainly on so called domain independent models using the Planning Domain Description Language (PDDL) as the domain modeling language. This declarative modeling approach embraces the idea of a physics-only model ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

PerMIS '10: Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop

September 2010

386 pages

ISBN:9781450302906

DOI:10.1145/2377576

General Chair:
Elena Messina
Intelligent Systems Division, NIST
,
Program Chair:
Raj Madhavan
UMD-CP/ISD-NIST

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

NIST: National Institute of Standards & Technology

In-Cooperation

SIGAI: ACM Special Interest Group on Artificial Intelligence

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 September 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PerMIS '10

Sponsor:

NIST

PerMIS '10: Performance Metrics for Intelligent Systems

September 28 - 30, 2010

Maryland, Baltimore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
228
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)4

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Murdivien SUm J(2023)BoxStacker: Deep Reinforcement Learning for 3D Bin Packing Problem in Virtual Environment of Logistics SystemsSensors10.3390/s2315692823:15(6928)Online publication date: 3-Aug-2023
https://doi.org/10.3390/s23156928
Liu YTao XLi XColombo AHu S(2023)Artificial Intelligence in Smart Logistics Cyber-Physical Systems: State-of-The-Arts and Potential ApplicationsIEEE Transactions on Industrial Cyber-Physical Systems10.1109/TICPS.2023.32832301(1-20)Online publication date: 2023
https://doi.org/10.1109/TICPS.2023.3283230
Grzejszczak TGałuszka AŚmieja JHarasny MZalwert M(2023)Prediction of Transportation Orders in Logistics Based on LSTM: Cargo TaxiAdvances in Computational Intelligence10.1007/978-3-031-43078-7_33(403-410)Online publication date: 1-Oct-2023
https://doi.org/10.1007/978-3-031-43078-7_33
Silva VMoresco G(2019)Analysis of Operational Efficiency in Picking Activity on a Pipes and Fittings CompanyAdvances in Manufacturing, Production Management and Process Control10.1007/978-3-030-20494-5_47(495-506)Online publication date: 6-Jun-2019
https://doi.org/10.1007/978-3-030-20494-5_47
Balakirsky SChristensen HKramer TKolhe PProctor FMessina EMadhavan R(2010)Mixed pallet stackingProceedings of the 10th Performance Metrics for Intelligent Systems Workshop10.1145/2377576.2377588(62-68)Online publication date: 28-Sep-2010
https://dl.acm.org/doi/10.1145/2377576.2377588

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents