Distribution problems deal with distribution from a number of sources to a number of destinations. Each source offers amounts of goods, while each destination demands quantities of these goods. The object is to find the cheapest transporting schedule that satisfies demand without violating supply restraints. In this paper we propose the use of fuzzy sets to represent the provisional information related to costs, demands and other variables. Moreover, we suggest including the problem of shortest route for the distribution vehicles. Finally, to solve this complex problem we propose using a genetic algorithm with a fuzzy fitness function.
http://fiordiliji.emeraldinsight.com/vl=3470079/cl=32/nw=1/rpsv/~1077/v30n7/s7/p681 (local filename p681.pdf)
Uses a GA to massage matrices to solve a more complex than standard TSP. Also uses fuzzy sets. Representation is just numbers, however the mutation is quite domain specific.