Skip to main content
SpringerLink
Log in

A Proposal of a Genetic Algorithm for Bicriteria Fixed Charge Transportation Problem

  • Conference paper
Active Media Technology (AMT 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8210))

Included in the following conference series:

  • 1152 Accesses

Abstract

Transportation problem is a typical combinatorial problem. We aim at the search capacity of the solution by using a genetic algorithm with a the Bicriteria fixed Charge Transportation problem, which is an extension of the traditional transportation problem. In this paper, we improve the technique of Teramatu. In particular we propose new crossover operation for the genetic algorithm. Comparison with other methods is performed and the validity of the proposed method is shown.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mitsuo, G., Cheng, R.: Genetic Algorithms and Engineering Optimization. John Wiley and Sons, Inc. (2000)

    Google Scholar 

  2. Kenichi, I., Hiroaki, T., Yusuke, T.C.N.: Application to fixed cherge transportation problem of genetic algorithm. The Institute of Electrical Engineers of Japan OS6_2_1–4 (2004)

    Google Scholar 

  3. Ida, K., Tohyama, H., Teramatu, C., Futatani, Y.: The Proposal of the Genetic Algorithm for Fixed Charge Transportation Problem. In: Proc APIEMS 2004, pp. 32, 1–5 (2004)

    Google Scholar 

  4. Li., Y., Gen, M., Ida, K.: Genetic Algorithms for the Fixed Charge Transportation Problem. Beijing Mathematics 4(2), 239–249 (1998)

    Google Scholar 

  5. Ida, K., Kimura, Y.: The Proposal of an Improved Genetic Algorithm for Floorplan Design with Non-slicing Structure. The IEICE Trans. on Fundamentals of Electro., Comm. and Comput. Sci. J87-A(3), 399–405 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Maebashi Institute of Technology, Maebashi, 371-0861, Japan

    Toshiki Shizuka & Kenichi Ida

Authors
  1. Toshiki Shizuka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenichi Ida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Graduate School of Information Science and Technology, Hokkaido University, N-14 W-9, 060-0814, Sapporo, Japan

    Tetsuya Yoshida

  2. Southwestern University of Finance and Economics, Chengdu, China

    Gang Kou

  3. Institute of Mathematics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

  4. Hong Kong Polytechnic University, Kowloon, Hong Kong

    Jiannong Cao

  5. Bell Labs, Paris, France

    Hakim Hacid

  6. Department of Life Science and Informatics, Maebashi Institute of Technology, 460-1 Kamisadori-cho, 371-0816, Maebashi, Gunma, Japan

    Ning Zhong

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Shizuka, T., Ida, K. (2013). A Proposal of a Genetic Algorithm for Bicriteria Fixed Charge Transportation Problem. In: Yoshida, T., Kou, G., Skowron, A., Cao, J., Hacid, H., Zhong, N. (eds) Active Media Technology. AMT 2013. Lecture Notes in Computer Science, vol 8210. Springer, Cham. https://doi.org/10.1007/978-3-319-02750-0_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02750-0_38

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02749-4

  • Online ISBN: 978-3-319-02750-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation