{"id":"https://openalex.org/W2091551618","doi":"https://doi.org/10.1080/00207720500282292","title":"Approximate solutions for the maximum benefit chinese postman problem","display_name":"Approximate solutions for the maximum benefit chinese postman problem","publication_year":2005,"publication_date":"2005-10-20","ids":{"openalex":"https://openalex.org/W2091551618","doi":"https://doi.org/10.1080/00207720500282292","mag":"2091551618"},"language":"en","primary_location":{"id":"doi:10.1080/00207720500282292","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207720500282292","pdf_url":null,"source":{"id":"https://openalex.org/S129640837","display_name":"International Journal of Systems Science","issn_l":"0020-7721","issn":["0020-7721","1464-5319"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Systems Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111582791","display_name":"W. L. Pearn","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"W. L. Pearn","raw_affiliation_strings":["National Chiao Tung University","Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, Taiwan, ROC#TAB#"],"affiliations":[{"raw_affiliation_string":"National Chiao Tung University","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, Taiwan, ROC#TAB#","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027098680","display_name":"Wei-Chi Chiu","orcid":"https://orcid.org/0000-0002-6147-9743"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"W. C. Chiu","raw_affiliation_strings":["Institute of Industrial Engineering, National Tsing Hua University","Institute of Industrial Engineering, National Tsing Hua University, Hsinchu, Taiwan, ROC#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute of Industrial Engineering, National Tsing Hua University","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Institute of Industrial Engineering, National Tsing Hua University, Hsinchu, Taiwan, ROC#TAB#","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111582791"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.19374886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"13","first_page":"815","last_page":"822"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7805182933807373},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5660674571990967},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5529770255088806},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5267386436462402},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5206139087677002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5174134969711304},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.48636940121650696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4731284976005554},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44563910365104675},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.41967862844467163},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38814255595207214},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08178499341011047}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7805182933807373},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5660674571990967},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5529770255088806},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5267386436462402},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5206139087677002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5174134969711304},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.48636940121650696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4731284976005554},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44563910365104675},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.41967862844467163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38814255595207214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08178499341011047},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207720500282292","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207720500282292","pdf_url":null,"source":{"id":"https://openalex.org/S129640837","display_name":"International Journal of Systems Science","issn_l":"0020-7721","issn":["0020-7721","1464-5319"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Systems Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1591506270","https://openalex.org/W1986637787","https://openalex.org/W2009546238","https://openalex.org/W2009550050","https://openalex.org/W2017695941","https://openalex.org/W2021646400","https://openalex.org/W2027402259","https://openalex.org/W2028909191","https://openalex.org/W2039011874","https://openalex.org/W2048636140","https://openalex.org/W2064284095","https://openalex.org/W2071463225","https://openalex.org/W2074271250","https://openalex.org/W2075230927","https://openalex.org/W2080994240","https://openalex.org/W2081814459","https://openalex.org/W2094043080","https://openalex.org/W2123789618","https://openalex.org/W2126141749","https://openalex.org/W4236483317"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W2366394613","https://openalex.org/W2152421698","https://openalex.org/W2899869393"],"abstract_inverted_index":{"The":[0,65,96,180],"Maximum":[1],"Benefit":[2],"Chinese":[3,16],"Postman":[4,17,108],"Problem":[5],"(MBCPP)":[6],"is":[7,30,59,63,70,111,117],"an":[8,57,112,135],"interesting":[9],"and":[10,50,140,156,173,185,192],"practical":[11],"generalization":[12,90],"of":[13,53,67,80],"the":[14,27,37,45,68,83,106,126,146,149,157,163,178],"classical":[15],"Problem,":[18,109],"which":[19,110],"has":[20,98],"many":[21],"real-world":[22,92],"applications.":[23],"Each":[24,55],"arc":[25,58],"on":[26],"MBCPP":[28,69,97,164],"network":[29],"associated":[31],"with":[32,39,47,82,152],"a":[33,41,51,61,73,77,89],"service":[34],"cost":[35,43],"for":[36,44],"traversal":[38,46],"service,":[40,49],"deadhead":[42],"no":[48],"set":[52,79],"benefits.":[54],"time":[56],"traversed,":[60],"benefit":[62,86],"generated.":[64],"objective":[66],"to":[71,101,119,124,161,176],"find":[72,120],"postman":[74],"tour":[75],"traversing":[76],"selected":[78],"arcs":[81],"total":[84],"net":[85],"maximized.":[87],"Such":[88],"reflects":[91],"situations":[93],"more":[94,103],"closely.":[95],"been":[99],"shown":[100],"be":[102],"complicated":[104],"than":[105],"Rural":[107],"NP-hard":[113],"problem.":[114],"Therefore,":[115],"it":[116],"difficult":[118],"polynomial-time":[121],"bounded":[122],"algorithms":[123,144,182],"solve":[125,162],"problem":[127],"exactly.":[128],"In":[129],"this":[130],"paper,":[131],"we":[132],"first":[133],"review":[134],"existing":[136],"exact":[137],"solution":[138],"procedure,":[139],"introduce":[141],"several":[142],"heuristic":[143],"including":[145],"Branch-Scan":[147],"algorithm,":[148,160],"Connection":[150],"algorithm":[151],"various":[153],"connection":[154],"strategies,":[155],"Directed":[158],"Tree":[159],"approximately.":[165],"We":[166],"also":[167],"apply":[168],"one-opt,":[169],"two-opt,":[170],"component":[171],"exchange,":[172],"component-drop":[174],"procedures":[175],"improve":[177],"solutions.":[179],"proposed":[181],"are":[183,190],"tested":[184],"compared.":[186],"Extensive":[187],"computational":[188],"results":[189],"provided":[191],"analysed.":[193]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-02-08T09:19:03.324500","created_date":"2025-10-10T00:00:00"}