A heuristic for multi-objective Chinese postman problem

Transportation systems can be represented by graphs with travel weights accorded to each of the edges that represent the roads to be travelled. This paper gives brief introduction of the Euler's path and the description of Chinese postman problem. The said problem is then extended to multi-obje...

Full description

Saved in:
Bibliographic Details
Main Authors: Prakash, S., Sharma, M.K., Singh, A.
Format: Conference Proceeding
Language:English
Subjects:
Bridge circuits
Chinese postman problem
Cities and towns
Costs
Educational institutions
Euler circuit
Floods
Heuristics
Legged locomotion
Multiple objective programming
Postal services
Rivers
Road transportation
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Transportation systems can be represented by graphs with travel weights accorded to each of the edges that represent the roads to be travelled. This paper gives brief introduction of the Euler's path and the description of Chinese postman problem. The said problem is then extended to multi-objective problem by considering multiple weights for each edge. Finally, this paper presents an algorithm to solve this multi-objective problem and implements the same on a biobjective Chinese postman problem.
DOI:10.1109/ICCIE.2009.5223529