scholarly journals Uncertain Programming Model for Chinese Postman Problem with Uncertain Weights

2012 ◽  
Vol 11 (1) ◽  
pp. 18-25 ◽  
Author(s):  
Bo Zhang ◽  
Jin Peng
Keyword(s):  
Programming Model ◽  
Uncertain Programming ◽  
Chinese Postman Problem ◽  
Chinese Postman

scholarly journals On the periodic hierarchical Chinese postman problem

2021 ◽  
Author(s):  
Muhammed Emre Keskin ◽  
Chefi Triki
Keyword(s):  
Integer Programming ◽  
Time Horizon ◽  
Programming Model ◽  
Mathematical Formulation ◽  
General Purpose ◽  
Chinese Postman Problem ◽  
New Variant ◽  
Chinese Postman ◽  
High Level ◽  
First Time

AbstractThis paper presents a mathematical formulation and a heuristic approach for a new variant of the Hierarchical Chinese Postman Problem (HCPP). Indeed, we introduce the concept of periodicity, and we define and solve, for the first time, the Periodic-HCPP, denoted as P-HCPP. Given that the resulting integer programming model makes use of a big number of binary variables and given the extended time horizon considered, 30 days in our case, the problem is characterized by a high level of complexity. However, our developed heuristic is able to solve instances having up to 40 nodes, 520 arcs and 5 hierarchies, whereas a general-purpose solver like Gurobi was not able to provide solutions for instances having more than 10 nodes. While the collected results are very encouraging, we provide at the end of this paper a set of possible future extensions of this work.

Security routing games with multivehicle Chinese postman problem

Networks ◽  
2014 ◽  
Vol 64 (3) ◽  
pp. 181-191 ◽  
Author(s):  
Dorit S. Hochbaum ◽  
Cheng Lyu ◽  
Fernando Ordóñez
Keyword(s):  
Chinese Postman Problem ◽  
Chinese Postman ◽  
Routing Games

Snowplow Route Optimization Using Chinese Postman Problem and Tabu Search Algorithm

2021 ◽  
Author(s):  
Abdullah Rasul ◽  
Jaho Seo ◽  
Shuoyan Xu ◽  
Tae J. Kwon ◽  
Justin MacLean ◽  
...  
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Route Optimization ◽  
Tabu Search Algorithm ◽  
Chinese Postman Problem ◽  
Chinese Postman

On the Maximum Benefit Chinese Postman Problem

Omega ◽  
2003 ◽  
Vol 31 (4) ◽  
pp. 269-273 ◽  
Author(s):  
W.L. Pearn ◽  
K.H. Wang
Keyword(s):  
Chinese Postman Problem ◽  
Maximum Benefit ◽  
Chinese Postman

scholarly journals The inventory replenishment policy in an uncertain production-inventory-routing system

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Chenyin Wang ◽  
Yaodong Ni ◽  
Xiangfeng Yang
Keyword(s):  
Programming Model ◽  
Optimal Solution ◽  
Maximum Level ◽  
Equivalent Model ◽  
Uncertain Programming ◽  
Inventory Routing ◽  
Routing Problem ◽  
Uncertain Variables ◽  
Confidence Levels ◽  
Production Inventory

<p style='text-indent:20px;'>This study introduces an uncertain programming model for the integrated production routing problem (PRP) in an uncertain production-inventory-routing system. Based on uncertainty theory, an uncertain programming model is proposed firstly and then transformed into a deterministic and equivalent model. The study further probes into different types of replenishment policies under the condition of uncertain demands, mainly the uncertain maximum level (UML) policy and the uncertain order-up to level (UOU) policy. Some inequalities are put forward to define the UML policy and the UOU policy under the uncertain environments, and the influences brought by uncertain demands are highlighted. The overall costs with optimal solution of the uncertain decision model grow with the increase of the confidence levels. And they are simultaneously affected by the variances of uncertain variables but rely on the value of confidence levels. Results show that when the confidence levels are not less than 0.5, the cost difference between the two policies begins to narrow along with the increase of the confidence levels and the variances of uncertain variables, eventually being trending to zero. When there are higher confidence levels and relatively large uncertainty in realistic applications, in which the solution scale is escalated, being conducive to its efficiency advantage, the comprehensive advantages of the UOU policy is obvious.</p>

scholarly journals Parameterized complexity of k -Chinese Postman Problem

2013 ◽  
Vol 513 ◽  
pp. 124-128 ◽  
Author(s):  
Gregory Gutin ◽  
Gabriele Muciaccia ◽  
Anders Yeo
Keyword(s):  
Parameterized Complexity ◽  
Chinese Postman Problem ◽  
Chinese Postman

Traversing Graphs

2017 ◽  
Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Chinese Postman Problem ◽  
Round Trip ◽  
Eulerian Graphs ◽  
Bridge Problem ◽  
Chinese Postman ◽  
Leonhard Euler ◽  
The City ◽  
East Prussia

This chapter considers Eulerian graphs, a class of graphs named for the Swiss mathematician Leonhard Euler. It begins with a discussion of the the Königsberg Bridge Problem and its connection to Euler, who presented the first solution of the problem in a 1735 paper. Euler showed that it was impossible to stroll through the city of Königsberg, the capital of German East Prussia, and cross each bridge exactly once. He also mentioned in his paper a problem whose solution uses the geometry of position to which Gottfried Leibniz had referred. The chapter concludes with another problem, the Chinese Postman Problem, which deals with minimizing the length of a round-trip that a letter carrier might take.

Sign in / Sign up

Export Citation Format

Share Document