Skip to main content

Optimal Algorithm for Maintaining Equipment Loading

  • Conference paper
Information Computing and Applications (ICICA 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 308))

Included in the following conference series:

  • 1583 Accesses

Abstract

The problem of weapon maintenance material packing is essentially a multi-constraints optimization problem. Firstly, the multi-constraints of weapon maintenance material packing were discussed. Secondly, the packing strategies were provided, such as space partitioning, hierarchical assembly and optimal choices. Then, the weapon maintenance material packing Algorithm based on heuristics was put forward.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alex, S.F., Richard, E.K.: Bin-Completion for Multicontainer Packing and Covering Problems. In: IJCAI. Morgan Kaufmann, San Francisco (2005)

    Google Scholar 

  2. Seiden, S.S.: On the Online Bin Packing Problem. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 237–248. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Wang, H.: Overview of Military Packaging. Packaging Engineering 19, 23–26 (1998)

    Google Scholar 

  4. Cheng, X.: Discussion on Implementing Integrated Packaging of Military Supplies. Packaging Engineering 27, 229–230 (2006)

    Google Scholar 

  5. Huang, L.: Research on the Calculation Method for Loading of Carbonless Copy Paper in Container. Packaging Engineering 27, 133–135 (2006)

    Google Scholar 

  6. Yu, S.: An Optimal Algorithm for the Loading of Maintaining Components for Radar. Computer Emulation 24, 275–278 (2007)

    Google Scholar 

  7. Giorgio, G.B., Alberto, P.G., Maurizio, T.L.: Algorithms for the relaxed online bin-packing model. Slam Computer, 1532–1551 (2000)

    Google Scholar 

  8. Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. on Systems, 656–667 (1994)

    Google Scholar 

  9. Yang, C.: Excellent Turn of Mix Gather Packing for Cube Wrappage. Packaging Engineering 21, 43–45 (2000)

    MATH  Google Scholar 

  10. Chen, Z., He, J., Lin, K.: Constrained Hybrid Genetic Algorithm of Multi-Dimensional Packing Problem. Modern Computer 1, 16–18 (2011)

    Google Scholar 

  11. Yu, S.: An Algorithm for Eigen-structure Parallel Extraction Based on Neural Networks Computer simulation. Computer Simulation 26, 322–323 (2009)

    Google Scholar 

  12. Chen, D., Chen, Z.-Y.: Mixed Integer Programming Model of Three-Dimensional Bin-Packing Problem and Improved Genetic Algorithms. Mathematics in Practice and Theory 40, 143–147 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yan, S., Yan, P., Sun, J., Zhang, L., Wang, S. (2012). Optimal Algorithm for Maintaining Equipment Loading. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34041-3_93

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34041-3_93

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34040-6

  • Online ISBN: 978-3-642-34041-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics