NDLI: Branch-and-bound algorithm for the time dependent Chinese Postman Problem

Content Provider	IEEE Xplore Digital Library
Author	Jinghao Sun Guozhen Tan Guangjian Hou
Copyright Year	2011
Description	Author affiliation: School of Computer Science and Technology, Dalian University of Technology Dalian, Chian (Jinghao Sun; Guozhen Tan; Guangjian Hou)
Abstract	This paper studies an extended version of the Chinese Postman Problem involving the added complexity of time dependent travel times, which is motivated from hybrid system testing. In the literature, the conventional Chinese Postman Problems defined on the Euler graph are polynomially solvable. However, we prove that the Chinese Postman Problem defined on the time dependent network is N P-Hard even if it verifies the Eulerian and First-In-First-Out properties. Furthermore, A branch-and-bound algorithm is proposed for the problem with the First-In-First-Out property. Experimental results show that the dominance relation in the branch-and-bound algorithm is more efficient when the network is not Euclidian, and that small to medium-sized instances can be solved to proven optimality.
Starting Page	949
Ending Page	954
File Size	403269
Page Count	6
File Format	PDF
ISBN	9781612847191
e-ISBN	9781612847221
DOI	10.1109/MEC.2011.6025622
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-08-19
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	NP-Hard Mechatronics Chinese Postman Problem Automata Branch-and-Bound Logic gates Time Dependent Educational institutions Polynomials Complexity theory Optimization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An algorithm for Hierarchical Chinese postman problem using minimum spanning tree approach based on Kruskal's algorithm

Hyper-polynomial hierarchies and the NP-jump

A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs

Column Generation Approach for the Time Dependent Chinese Postman Problem

A branch-and-cut algorithm for the maximum benefit Chinese postman problem

Oracle Quantum Computing

A note on k best solutions to the chinese postman problem (1993).

Fast solution of some random NP-hard problems

A 3/2-Approximation Algorithm for the Mixed Postman Problem

Branch-and-bound algorithm for the time dependent Chinese Postman Problem

Similar Documents

An algorithm for Hierarchical Chinese postman problem using minimum spanning tree approach based on Kruskal's algorithm

Hyper-polynomial hierarchies and the NP-jump

A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs

Column Generation Approach for the Time Dependent Chinese Postman Problem

A branch-and-cut algorithm for the maximum benefit Chinese postman problem

Oracle Quantum Computing

A note on k best solutions to the chinese postman problem (1993).

Fast solution of some random NP-hard problems

A 3/2-Approximation Algorithm for the Mixed Postman Problem

Branch-and-bound algorithm for the time dependent Chinese Postman Problem