Download now Free registration required
An algorithm named MCMF-A has been proposed to find minimum cost maximum flow in transportation network. The MCMF-A algorithm can find the optimal solution to MCMFP and has good performance, which has been validated by numerical experiments. Accordingly, the MCMF-A algorithm is an efficient and robust method to solve MCMFP. Further research may be performed to use the MCMF-A algorithm as a solver and combine it with genetic algorithm to solve specific types of complex optimization problems with network flow structure.
- Format: PDF
- Size: 705.24 KB