Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks

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.

Download Full-text

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

EMAJ Emerging Markets Journal ◽

10.5195/emaj.2015.69 ◽

2015 ◽

Vol 5 (1) ◽

pp. 50-59 ◽

Cited By ~ 1

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.

Download Full-text

The Chinese Postman Problem for Mixed Networks

Management Science ◽

10.1287/mnsc.25.7.643 ◽

1979 ◽

Vol 25 (7) ◽

pp. 643-648 ◽

Cited By ~ 55

Author(s):

Edward Minieka

Keyword(s):

Chinese Postman Problem ◽

Chinese Postman ◽

Mixed Networks

Download Full-text

Hybrid genetic algorithm for the open capacitated arc routing problem

Computers & Operations Research ◽

10.1016/j.cor.2017.09.020 ◽

2018 ◽

Vol 90 ◽

pp. 221-231 ◽

Cited By ~ 19

Author(s):

Rafael Kendy Arakaki ◽

Fábio Luiz Usberti

Keyword(s):

Genetic Algorithm ◽

Hybrid Genetic Algorithm ◽

Arc Routing ◽

Routing Problem ◽

Capacitated Arc Routing Problem ◽

Capacitated Arc Routing

Download Full-text

Waste Collection Vehicle Routing Problem: Literature Review

PROMET - Traffic&Transportation ◽

10.7307/ptt.v27i4.1616 ◽

2015 ◽

Vol 27 (4) ◽

pp. 345-358 ◽

Cited By ~ 22

Author(s):

Hui Han ◽

Eva Ponce Cueto

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Research Literature ◽

Arc Routing ◽

Waste Collection ◽

Logistics System ◽

Routing Problems ◽

Routing Problem ◽

Node Routing

Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP) in literature. Based on a classification of waste collection (residential, commercial and industrial), firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems) used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

Download Full-text

Traveling salesman problem: approach to optimality

Przedsiebiorczosc i Zarzadzanie ◽

10.2478/eam-2014-0024 ◽

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.

Download Full-text