On the Request-Trip-Vehicle Assignment Problem

In this paper, a two-step meta-heuristic approach is proposed for vehicle assignment problem with geometric shape-based clustering and genetic algorithm. First, the geometric shape-based clustering method is used and then the solution of this method is given to the genetic algorithm as initial solution. The solution process is continued by genetic algorithm. There are 282 bus lines in İstanbul European side. Those buses should be assigned to six bus garages. The proposed method is used to determine the minimum distance between the bus lines and garages by assigning buses to garages. According to the computational results, the proposed algorithm has better clustering performance in terms of the distance from each bus-line start point to each bus garage in the cluster. The crossover rate changing method is also applied as a trial in order to improve the algorithm performance. Finally, the outputs that are generated by different crossover rates are compared with the results of the k-Nearest Neighbour algorithm to prove the effectiveness of the study.

Download Full-text

Research of Pareto-Based Multi-Objective Optimization for Multi-Vehicle Assignment Problem Based on MOPSO

Lecture Notes in Computer Science - Advances in Swarm Intelligence ◽

10.1007/978-3-642-21524-7_2 ◽

2011 ◽

pp. 10-16 ◽

Cited By ~ 1

Author(s):

Ai Di-Ming ◽

Zhang Zhe ◽

Zhang Rui ◽

Pan Feng

Keyword(s):

Assignment Problem ◽

Multi Objective Optimization ◽

Multi Objective ◽

Vehicle Assignment

Download Full-text

A FUZZY LOGIC METHOD FOR VEHICLE ASSIGNMENT PROBLEM

Computational Intelligence ◽

10.1142/9789814324700_0057 ◽

2010 ◽

Author(s):

ZHONGWEI WANG ◽

LIXIN LU

Keyword(s):

Fuzzy Logic ◽

Assignment Problem ◽

Vehicle Assignment ◽

Fuzzy Logic Method ◽

Logic Method

Download Full-text

A Programming Method of Vehicle Dispatch for Service Centre

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.121-126.662 ◽

2011 ◽

Vol 121-126 ◽

pp. 662-666 ◽

Cited By ~ 1

Author(s):

Hang Sheng Jia ◽

Fei Cheng

Keyword(s):

Assignment Problem ◽

Large Scale ◽

Simulated Annealing Algorithm ◽

Fitness Function ◽

Optimal Solution ◽

Algorithm Performance ◽

Service Centre ◽

Vehicle Assignment ◽

Annealing Algorithm ◽

Natural Description

This paper combines Genetic Algorithm with Simulated Annealing Algorithm, namely GA-SA，to discuss vehicle paths and take into account the condition of time with respect to multi-spot service combination problem in service centre. The prevalent genetic algorithms easily lose the optimal solution, which affects the entire algorithm performance for reality vehicle assignment problem in the service centre. Based on modelling the vehicle assignment problem with natural description, fitness function, crossover operation and mutation operation are made the improvement in the approach. The process of computation has also considered own characteristics of the service centre to enable the algorithm optimized performance, in order to obtain the large scale enhancement.

Download Full-text