Skip to main content

Comparison of Crossover Operators for Rural Postman Problem with Time Windows

  • Conference paper
Soft Computing in Engineering Design and Manufacturing

Abstract

In this paper, we describe a genetic algorithm and compare three crossover operators for Rural Postman Problem with Time Windows (RPPTW). The RPPTW which is a multiobjective optimization problem, is an extension of Rural Postman Problem (RPP) in which some service places (located at edge) require service time windows that consist of earliest time and latest time. To solve the RPPTW which is a multiobjective optimization problem, we obtain a Pareto-optimal set that the superiority of each objective can not be compared. We perform experiments using three crossovers for 12 randomly generated test problems and compare the results. The crossovers using in this paper are Partially Matched Exchange (PMX), Order Exchange (OX), and Modified Order Exchange (MOX) which has been modified from the OX. For each test problem, the results show the efficacy of MOX method for RPPTW.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Azevedo, J. A. & Martins, E. Q. V., 1991, An Algorithm for the Multiobjective Shortest Path Problem on Acyclic Networks, Investigacao Operational, Vol. 11, No. 1.

    Google Scholar 

  2. Fonseca, C. M. and Fleming, P. J., 1993, Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization, Proceedings of the Fifth International Conference.

    Google Scholar 

  3. Goldberg, D. E., 1989, GENETIC ALGORITHMS in Search, Optimization & Machine Learning, Addison Wesley.

    Google Scholar 

  4. Kang, M. J. and Han, C. G., 199G, A Genetic Algorithm for the Rural Postman Problem with Time Windows, Proceedings of 20th International Conference on Computer & Industrial Engineering, pp. 321-324.

    Google Scholar 

  5. Lenstra, J. K. and Rinooy Kan, A. H. G., 1976, On General Routing Problems, Network, Vol. 6, pp. 273–280.

    Article  MATH  Google Scholar 

  6. Makowski, M., Somlyody, L. & Watkins, D., Multiple, 1995, Criteria Analysis for Regional Water Quality Management: The Nitra River Case, IIASA.

    Google Scholar 

  7. Michalewicz, Z., 1994, Genetic Algorithms + Data Structures = Evolution Programs, 2rd rev. and extended ed. Springer-Verlag, Berlin, Heidelberg.

    MATH  Google Scholar 

  8. Thangiah, S. R., 1995, Vehicle Routing with Time Windows using Genetic Algorithms, Practical Handbook of GENETIC vol. 2, ALGORITHMS, CRC Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag London

About this paper

Cite this paper

Kang, MJ., Han, CG. (1998). Comparison of Crossover Operators for Rural Postman Problem with Time Windows. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds) Soft Computing in Engineering Design and Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-0427-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0427-8_28

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-76214-0

  • Online ISBN: 978-1-4471-0427-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics