Study on multi-objective travelling salesman problem for hazardous materials transportation based on improved genetic algorithm (Q391724)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Study on multi-objective travelling salesman problem for hazardous materials transportation based on improved genetic algorithm |
scientific article |
Statements
Study on multi-objective travelling salesman problem for hazardous materials transportation based on improved genetic algorithm (English)
0 references
10 January 2014
0 references
Summary: When selecting an optimal route for hazardous materials transportation, many factors are needed to be considered. Through minimising transportation risk and operation distance, multi-objective travelling salesman problem (MO-TSP) model for hazardous materials transportation route is established. The natural chromosome encoding is used to encode and the roulette and optimal saving strategy are combined for selection, the order crossover is used for crossover operation to improve the traditional genetic algorithm. Then the improved genetic algorithm is used to solve MO-TSP model of hazardous materials transportation route. Finally, the correctness and effectiveness of the model and algorithm are verified with a case. This approach can help decision-makers determine reasonable transportation route for the hazardous materials transportation.
0 references
hazardous materials
0 references
transport route
0 references
multi-objective travelling salesman
0 references
improved genetic algorithm
0 references