Generalized Maximum Benefit Multiple Chinese Postman Problem

This research is focused on a generalization on the Max Benefit Chinese Postman Problem and the multiple vehicle variant of the Chinese Postman Problem. The authors call this generalization, the Generalized Maximum Benefit k-Chinese Postman Problem (GB k-CPP). They present a novel Mixed Integer Programming (MIP) formulation for the GB k-CPP. Four different cases of the model are discussed. The first case, performs arc-routing with profits and assumes that the origin and destination for each vehicle is the same for each cycle and is given by the user. The next case relaxes the assumption that the origin and destination for each vehicle should be the same and allows the users to select possible origins/destinations for vehicles. Case three gets the origin for each vehicle as input and produces a solution based on finding the best destination for each vehicle. The last case, that is very general, allows the optimization model to select possibly different locations for vehicle origin and destination, during each cycle. The different cases are applied to a security patrolling case conducted on the network of University of Maryland at College Park campus and the results are compared.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01565366
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 26 2015 9:53AM