Skip to main content

Optimization Strategies for Integrated Knapsack and Traveling Salesman Problems

  • Conference paper
  • First Online:
Computer Aided Systems Theory – EUROCAST 2015 (EUROCAST 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9520))

Included in the following conference series:

Abstract

In the optimization of real-world activities the effects of solutions on related activities need to be considered. The use of isolated problem models that do not adequately consider related processes does not allow addressing system-wide consequences. However, sometimes the complexity of the real-world model and its interplay with related activities can be described by a combination of simple, existing, problems. In this work we aim to discuss strategies to combine existing algorithms for simple problems in order to solve a more complex master problem. New challenges arise in such an integrated optimization approach.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: a survey. Eur. J. Oper. Res. 209, 1–10 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Genetic and Evolutionary Computation Conference, GECCO 2014, Vancouver, BC, Canada, pp. 477–484 (2014)

    Google Scholar 

  3. Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits: an overview. Transp. Sci. 39, 188–205 (2001)

    Article  Google Scholar 

  4. Potter, M.A., De Jong, K.A.: A cooperative coevolutionary approach to function optimization. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 249–257. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  5. Pirkwieser, S., Raidl, G.R., Puchinger, J.: Combining lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 176–187. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Chao, I.M., Golden, B.L., Wasil, E.A.: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88, 475–489 (1996)

    Article  MATH  Google Scholar 

  7. Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35, 797–809 (1984)

    Article  Google Scholar 

Download references

Acknowledgments

The work described in this paper was done within the COMET Project Heuristic Optimization in Production and Logistics (HOPL), #843532 funded by the Austrian Research Promotion Agency (FFG).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreas Beham .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Beham, A., Fechter, J., Kommenda, M., Wagner, S., Winkler, S.M., Affenzeller, M. (2015). Optimization Strategies for Integrated Knapsack and Traveling Salesman Problems. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science(), vol 9520. Springer, Cham. https://doi.org/10.1007/978-3-319-27340-2_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27340-2_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27339-6

  • Online ISBN: 978-3-319-27340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics