In this paper, we present a new approach which is spanning tree-based genetic algorithm for bicriteria transport,ation problem. The transportation problem have the special data structure in solution characterized as a spanning tree. In encoding transportation problem, we introduce one of node encodi
Bicriteria transportation problem by hybrid genetic algorithm
โ Scribed by Mitsuo Gen; Kenichi Ida; Yinzhen Li
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 310 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0360-8352
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper, we present a hybrid genetic algorithm to solve the bicriteria transportation problem, we absorb the concept on spanning tree and adopt the Priifer number as it is capable of equally and uniquely representing all possible basic solutions. We designed the criterion which chromosomes can be always feasibly converted to a transportation tree. In order to improve the efficiency of evolutionary algorithm, the reduced cost for optimality of a solution was hybridized to genetic algorithm. Numerical cxperiments show the effectiveness and efficiency of the proposed algorithm.
๐ SIMILAR VOLUMES
Hybrid Genetic Algorithms are described for a large-size real-life rostering problem (railway workers' job scheduling and roster optimization). The new algorithm uses an order-based representation which encodes as a chromosome the list of job units to schedule. First, a greedy algorithm is considere
All over the world, human resources are used on all kinds of different scheduling problems, many of which are time-consuming and tedious. Scheduling tools are thus very welcome. This paper presents a research project, where Genetic Algorithms (GAs) are used as the basis for solving a timetabling pro