This paper takes the vehicles scheduling of hazardous materials as the research object. First, considered the four objectives of risk minimization, cost minimization, risk equilibrium value minimization, and duration minimization, the vehicles robust scheduling of hazardous materials in multiple distribution centers with risk balance is constructed. Then, uncertain models are transformed into peer‐to‐peer models through the idea of robust discrete optimization. By introducing the crossover and mutation operators of genetic algorithm into particle swarm algorithm, a hybrid particle swarm algorithm is constructed, and three‐stage coding rules are adopted. Finally, case study is exemplified to prove the feasibility of the model and algorithm. The results show that the obtained scheduling scheme for the vehicles of hazardous materials minimizes the risk value and makes the risk distribution more balanced for the government regulatory department, and the vehicle can avoid certain road sections with relatively large risk values. For transportation enterprises, the vehicle scheduling scheme for transporting hazardous materials minimizes the cost and shortens the task duration at the same time. In the case of risk uncertainty, different robust control parameters are introduced to make the vehicles robust scheduling of hazardous materials have different degrees of stability.


    Zugriff

    Download


    Exportieren, teilen und zitieren




    Hybrid particle swarm optimisation algorithm for image segmentation

    Zhang,J. / Lu,J. / Li,H. et al. | Kraftfahrwesen | 2012


    A hybrid cooperative cuckoo search algorithm with particle swarm optimisation

    Wang, Lijin / Zhong, Yiwen / Yin, Yilong | British Library Online Contents | 2015


    A hybrid cooperative cuckoo search algorithm with particle swarm optimisation

    Wang, Lijin / Zhong, Yiwen / Yin, Yilong | British Library Online Contents | 2015


    A hybrid cooperative cuckoo search algorithm with particle swarm optimisation

    Wang, L. / Zhong, Y. / Yin, Y. | British Library Online Contents | 2015