مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

270
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

87
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES CONSIDERING THE DRIVER'S SATISFACTION

Pages

  1-6

Abstract

 A VEHICLE ROUTING PROBLEM is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the VEHICLE ROUTING PROBLEM are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the DRIVER'S SATISFACTION level. On the other hand, this satisfaction, which will decrease by increasing the service time, is considered as an important logistic problem for a company. The stochastic time dominated by a probability variable leads to variation of the service time, while it is ignored in classical routing problems. This paper investigates the problem of the increasing service time by using the stochastic time for each tour such that the total traveling time of the vehicles is limited to a specific limit based on a defined probability. Since exact solutions of the VEHICLE ROUTING PROBLEM that belong to the category of NP-hard problems are not practical in a large scale, a hybrid algorithm based on SIMULATED ANNEALING with genetic operators was proposed to obtain an efficient solution with reasonable computational cost and time. Finally, for some small cases, the related results of the proposed algorithm were compared with results obtained by the Lingo 8 software. The obtained results indicate the efficiency of the proposed hybrid SIMULATED ANNEALING algorithm.

Cites

  • No record.

    • References

    Cite

    APA: Copy

    TAVAKKOLI MOGHADDAM, REZA, ALINAGHIAN, MEHDI, SALAMAT BAKHSH, ALIREZA, & NOROUZI, NARGES. (2012). A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES CONSIDERING THE DRIVER'S SATISFACTION. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 8(8), 1-6. SID. https://sid.ir/paper/309933/en

    Vancouver: Copy

    TAVAKKOLI MOGHADDAM REZA, ALINAGHIAN MEHDI, SALAMAT BAKHSH ALIREZA, NOROUZI NARGES. A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES CONSIDERING THE DRIVER'S SATISFACTION. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2012;8(8):1-6. Available from: https://sid.ir/paper/309933/en

    IEEE: Copy

    REZA TAVAKKOLI MOGHADDAM, MEHDI ALINAGHIAN, ALIREZA SALAMAT BAKHSH, and NARGES NOROUZI, “A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES CONSIDERING THE DRIVER'S SATISFACTION,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 8, no. 8, pp. 1–6, 2012, [Online]. Available: https://sid.ir/paper/309933/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button