SOLVING A NEW MATHEMATICAL MODEL FOR A MULTI-OBJECTIVE AND MULTI-DEPOT VEHICLE ROUTING PROBLEM BY A NON-DOMINATED SORTING GENETIC ALGORITHM

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.

TAVAKKOLI MOGHADDAM R.; MASOUDI S.; EGHBALI H.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS) Year:2016 | Volume:3 | Issue:6 Page(s): 167-175

Download Full-Text

Persian Verion

View:

869

Download:

Cites:

Information Journal Paper

Title

SOLVING A NEW MATHEMATICAL MODEL FOR A MULTI-OBJECTIVE AND MULTI-DEPOT VEHICLE ROUTING PROBLEM BY A NON-DOMINATED SORTING GENETIC ALGORITHM

Author(s)

TAVAKKOLI MOGHADDAM R. | MASOUDI S. | EGHBALI H. | Issue Writer Certificate

Keywords

VEHICLE ROUTINGQ2

MULTI DEPOTSQ2

TIME WINDOWSQ1

ε-CONSTRAINTQ2

MULTI-OBJECTIVE OPTIMIZATIONQ2

Abstract

The VEHICLE ROUTING problem (VRP) can be studied in variant cases, in which two related important problems are the VRP with hard TIME WINDOWS and the multi-depot VRP with heterogeneous vehicles. Most problems presented in this field are single-objective problems with the aim of the minimum cost; however, the complexity of real problems usually doubts the use of single objective problems. This paper considers not only the minimum travel cost, but also the distance travelled by the used vehicles and their loads. Since this problem is the NP-hard one, the non-dominated sorted genetic algorithm - II is used. To show its efficiency for solving small-sized problems, the obtained results are evaluated with the results obtained by the e-constraint method. The results show that the obtained gap of the objective function values is less than 4% in all the solved problems indicating the efficiency of the proposed algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKKOLI MOGHADDAM, R., MASOUDI, S., & EGHBALI, H.. (2016). SOLVING A NEW MATHEMATICAL MODEL FOR A MULTI-OBJECTIVE AND MULTI-DEPOT VEHICLE ROUTING PROBLEM BY A NON-DOMINATED SORTING GENETIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), 3(6), 167-175. SID. https://sid.ir/paper/241305/en

Vancouver: Copy

TAVAKKOLI MOGHADDAM R., MASOUDI S., EGHBALI H.. SOLVING A NEW MATHEMATICAL MODEL FOR A MULTI-OBJECTIVE AND MULTI-DEPOT VEHICLE ROUTING PROBLEM BY A NON-DOMINATED SORTING GENETIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS)[Internet]. 2016;3(6):167-175. Available from: https://sid.ir/paper/241305/en

IEEE: Copy

R. TAVAKKOLI MOGHADDAM, S. MASOUDI, and H. EGHBALI, “SOLVING A NEW MATHEMATICAL MODEL FOR A MULTI-OBJECTIVE AND MULTI-DEPOT VEHICLE ROUTING PROBLEM BY A NON-DOMINATED SORTING GENETIC ALGORITHM,” JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), vol. 3, no. 6, pp. 167–175, 2016, [Online]. Available: https://sid.ir/paper/241305/en

Related Journal Papers