Lower Bounds For Hierarchical Chinese Postman Problem

Authors

  • Purushothaman Damodaran Florida International University
  • Murali Krishnamurthi Northern Illinois University
  • Krishnaswami Srihari SUNY Binghamton

DOI:

https://doi.org/10.23055/ijietap.2008.15.1.60

Keywords:

Arc routing problems, Chinese Postman Problem, Hierarchical Chinese Postman Problem, Snow removal planning, Lower bounds

Abstract

Arc routing problems aim at finding a least cost traversal on a network with or without additional constraints. The Hierarchical Chinese Postman Problem (HCPP) is an arc routing problem. HCPP is NP-hard and several heuristics have been developed to solve this problem. The Chinese Postman Problem (CPP) tour solution is a known lower bound for the HCPP. This paper presents a heuristic that will prescribe improved lower bounds for the HCPP when compared to the CPP solutions. Better lower bounds aid exact search methods, such as branch-and-bound, to find an optimal solution in a shorter run time. It can also be used to determine the quality of a heuristic solution. Several problem instances were generated to evaluate the proposed heuristic. Experimental results indicate that our lower bounds are better than the CPP solution for all the sample problems chosen.

Author Biographies

Purushothaman Damodaran, Florida International University

P

Murali Krishnamurthi, Northern Illinois University

Murali Krishnamurthi is Associate Professor of Industrial and Systems Engineering at Northern Illinois University. He received his B.E. in Mechanical Engineering from University of Madras (India), M.S. in Industrial and Systems Engineering from Ohio University and Ph.D. in Industrial Engineering from Texas A&M University. His teaching and research interests include optimization techniques, system simulation, information systems, project management, engineering ethics, environmental management systems, and expert systems. He has received more than $2 million in sponsored project funding from federal, state, industry and professional society sources. He currently serves also as the Director of Faculty Development and Instructional Design Center at Northern Illinois University.

Krishnaswami Srihari, SUNY Binghamton

Krishnaswami (Hari) Srihari joined the State University of New York at Binghamton, New York in August 1988. He received his M.S. (1985) and Ph.D. (1988) in Industrial Engineering and Operations Research from Virginia Polytechnic and State University, Blacksburg, Virginia. Dr.Srihari's research is focused on the electronics manufacturing domain. A recent review of his group indicated that he had received over 16 million dollars in external research funding for the past few years, has published over 325 research papers, and authored over 950 technical reports.Dr. Srihari is the Director of Watson Institute for Systems Excellence (WISE).

Downloads

Published

2022-02-24

How to Cite

Damodaran, P., Krishnamurthi, M., & Srihari, K. (2022). Lower Bounds For Hierarchical Chinese Postman Problem. International Journal of Industrial Engineering: Theory, Applications and Practice, 15(1), 36–44. https://doi.org/10.23055/ijietap.2008.15.1.60

Issue

Vol. 15 No. 1 (2008)

Section

Operations Research

License

The Author(s) must formally transfer each article's copyright before publication in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING. Such transfer enables the Journal to defend itself against plagiarism and other forms of copyright infringement. Your cooperation is appreciated.

You agree that the copyright of your article to be published in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE is hereby transferred, throughout the World and for the full term and all extensions and renewals thereof, to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE.

The Author(s) reserve(s): (a) the trademark rights and patent rights, if any, and (b) the right to use all or part of the information contained in this article in future, non-commercial works of the Author's own, or, if the article is a "work-for-hire" and made within the scope of the Author's employment, the employer may use all or part of the information contained in this article for intra-company use, provided the usual acknowledgments are given regarding copyright notice and reference to the original publication.

The Author(s) warrant(s) that the article is Author's original work and has not been published before. If excerpts from copyrighted works are included, the Author will obtain written permission from the copyright owners and credit the article's sources.

The author also warrants that the article contains no libelous or unlawful statements and does not infringe on the rights of others. If the article was prepared jointly with other Author(s), the Author agrees to inform the co-Author(s) of the terms of the copyright transfer and to sign on their behalf; or in the case of a "work-for-hire," the employer or an authorized representative of the employer.

The journal does not provide the author copy of the final paper when it is published. The author(s) can make(s) a subscription to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE if they want to get the final paper that has already been published.

The journal is registered with the Library of Congress (ISSN # 1943-670X). All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the journal.

The author reserves patent and trademark rights and the right to use all or part of the information contained in the article in future non-commercial works.