scholarly journals Using Genetic Algorithm For Winter Maintenance Operations: Multi Depot K-Chinese Postman Problem

2015 ◽  
Vol 5 (1) ◽  
pp. 50-59 ◽  
Author(s):  
İbrahim Zeki Akyurt ◽  
Timur Keskinturk ◽  
Çağatay Kalkancı
Keyword(s):  
Genetic Algorithm ◽  
Arc Routing ◽  
Chinese Postman Problem ◽  
Routing Problem ◽  
Winter Maintenance ◽  
Starting Point ◽  
Sweep Algorithm ◽  
Chinese Postman ◽  
Maintenance Work ◽  
Maintenance Activities

In this study, the assignment and routing problem of one of Istanbul’s winter maintenance activities, salt pouring, was scrutinized. The starting point of the study considers the high cost of winter maintenance work, a shrinking assigned budget, high numbers of vehicles and streets to service that the increase in difficulty to solve the problem due to their high numbers. In this respect, the problem was modeled as multi depot k-Chinese postman problem, a type of arc routing problem. This mathematical model was solved by genetic algorithm. For comparison, the current solution, Clarke and Wright Algorithm and Sweep Algorithm were used.

Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks

2014 ◽  
Vol 701-702 ◽  
pp. 44-49
Author(s):  
Yu Hong Ma ◽  
Gui Long Tian ◽  
Xian Li
Keyword(s):  
Genetic Algorithm ◽  
Load Capacity ◽  
Arc Routing ◽  
Chinese Postman Problem ◽  
Simulation Experiments ◽  
Routing Problem ◽  
Chinese Postman ◽  
Postman Problems ◽  
Mixed Networks ◽  
Node Routing

The genetic algorithm is used to investigate the Chinese postman problem with the constraints of working time span and load capacity for postman on mixed networks. In course of chromosome encoding, the priority-based encoding for serving edges set is used, and the priority and the strategy of “serve while going” in the shortest path is integrated to use in course of decoding. A genetic scheme is designed to solve the capacitated Chinese postman problem without translating arc routing problem into node routing problem. The simulation experiments show that the methods is feasible and efficient, it can easily solve the capacitated Chinese postman problems on all kinds of complex networks.

scholarly journals Traveling salesman problem: approach to optimality

2014 ◽  
Vol 15 (2) ◽  
pp. 157-169
Author(s):  
Radosław Jadczak
Keyword(s):  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Decision Problem ◽  
Mathematical Formulation ◽  
Traveling Salesman ◽  
Chinese Postman Problem ◽  
Routing Problem ◽  
Solution Strategies ◽  
Chinese Postman ◽  
Single Vehicle

Abstract Traveling Salesman Problem (TSP) is a basic and one of the most important transportation problems in operational logistics. It is also known in the literature as a Chinese postman problem or single vehicle routing problem. TSP can be shortly described as follows. Vehicle starting from the selected city must visit a set of another cities exactly once and return to the starting city in such a way that the total distance of the route is minimized. In this paper first mathematical formulation of decision problem is presented. Then solution strategies of TSP are shown with selected algorithms as examples. In the last part of article, a computational results of selected methods are presented.

Arc Routing Problems, Part I: The Chinese Postman Problem

1995 ◽  
Vol 43 (2) ◽  
pp. 231-242 ◽  
Author(s):  
H. A. Eiselt ◽  
Michel Gendreau ◽  
Gilbert Laporte
Keyword(s):  
Arc Routing ◽  
Chinese Postman Problem ◽  
Routing Problems ◽  
Arc Routing Problems ◽  
Chinese Postman

scholarly journals PENYELESAIAN CHINESE POSTMAN PROBLEM PADA GRAF BERARAH DENGAN METODE HEURISTIK

2012 ◽  
Vol 11 (1) ◽  
pp. 41
Author(s):  
A. S. PERMADI ◽  
F. HANUM ◽  
T. BAKHTIAR
Keyword(s):  
Arc Routing ◽  
Chinese Postman Problem ◽  
Chinese Postman

<p>Penelitian ini membahas salah satu masalah penentuan rute optimal yang dapat diformulasikan sebagai masalah <em>arc routing, </em>yaitu <em>Chinese Postman Problem </em>(CPP). Masalah ini mencari rute perjalanan dengan biaya minimum sehingga setiap sisi/jalan harus dilewati minimal satu kali. CPP dapat diterapkan pada graf tak berarah ataupun graf berarah dan dapat diselesaikan dengan beberapa cara. Dalam penelitian ini, CPP diterapkan pada graf berarah dan diselesaikan dengan metode heuristik. Metode ini terdiri atas beberapa tahap dan menggunakan beberapa algoritme. Dalam penelitian ini, CPP diimplementasikan dalam masalah pembuangan sampah.</p>

scholarly journals The Winter Maintenance Optimization by Graph Theory

2018 ◽  
Vol 47 (2) ◽  
pp. 106-110
Author(s):  
Jiri Cejka ◽  
Rudolf Kampf
Keyword(s):  
Graph Theory ◽  
Present State ◽  
Maintenance Optimization ◽  
Road Maintenance ◽  
Chinese Postman Problem ◽  
Winter Maintenance ◽  
Chinese Postman ◽  
Winter Road ◽  
Winter Road Maintenance

The article is concerned with optimization of the winter maintenance of the selected stretch of roads within the Strakonice district by applying the graph theory. The graph theory and the Chinese postman problem are applied in case of the winter maintenance of the specific selected section of roads. The article also includes the evaluation of performing the winter road maintenance so far. The results of optimization are compared with the present state and economically evaluated at the end.

Sign in / Sign up

Export Citation Format

Share Document