SOLVING A STOCHASTIC MULTI-DEPOT MULTI - OBJECTIVE VEHICLE ROUTING PROBLEM BY A SIMULATED ANNEALING

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

HASANPOUR H.A.; MOSADEGHKHAH M.; TAVAKOLI MOGHADAM R.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Advances in Industrial Engineering Year:2009 | Volume:43 | Issue:1 Page(s): 25-36

Download Full-Text

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

Persian Verion

View:

949

Download:

Cites:

Information Journal Paper

Title

SOLVING A STOCHASTIC MULTI-DEPOT MULTI - OBJECTIVE VEHICLE ROUTING PROBLEM BY A SIMULATED ANNEALING

Author(s)

HASANPOUR H.A. | MOSADEGHKHAH M. | TAVAKOLI MOGHADAM R. | Issue Writer Certificate

Keywords

STOCHASTICQ2

MULTI - OBJECTIVEQ3

VEHICLE ROUTING PROBLEMQ3

MULTI-DEPOTSQ3

SIMULATED ANNEALINGQ3

Abstract

In this paper, a STOCHASTIC multi-depot MULTI - OBJECTIVE VEHICLE ROUTING PROBLEM (VRP) is studied. Based on observations in real-world problems, we develop an aspect of the problem, such as STOCHASTIC availability of routes. To solve the problem in this situation, a two - objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs and (2) maximizing probability of delivery to customers. The second objective function, which is nonlinear, has performed to a linear function. Since this problem is NP-hard, to solve it we propose SIMULATED ANNEALING (SA) that is a well - known meta - heuristic algorithm. To show the performance of this algorithm, we compare the related results in terms of run - time and objective function values with the lower bound and Lingo 8 software for different sizes of the given problem.

Cites

SOLVING THE HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM BY A COLUMN GENERATION

References

No record.

Cite

APA: Copy

HASANPOUR, H.A., MOSADEGHKHAH, M., & TAVAKOLI MOGHADAM, R.. (2009). SOLVING A STOCHASTIC MULTI-DEPOT MULTI - OBJECTIVE VEHICLE ROUTING PROBLEM BY A SIMULATED ANNEALING. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 43(1), 25-36. SID. https://sid.ir/paper/166409/en

Vancouver: Copy

HASANPOUR H.A., MOSADEGHKHAH M., TAVAKOLI MOGHADAM R.. SOLVING A STOCHASTIC MULTI-DEPOT MULTI - OBJECTIVE VEHICLE ROUTING PROBLEM BY A SIMULATED ANNEALING. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;43(1):25-36. Available from: https://sid.ir/paper/166409/en

IEEE: Copy

H.A. HASANPOUR, M. MOSADEGHKHAH, and R. TAVAKOLI MOGHADAM, “SOLVING A STOCHASTIC MULTI-DEPOT MULTI - OBJECTIVE VEHICLE ROUTING PROBLEM BY A SIMULATED ANNEALING,” ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 43, no. 1, pp. 25–36, 2009, [Online]. Available: https://sid.ir/paper/166409/en

Related Journal Papers