A VEHICLE ROUTING PROBLEM AND DETERMINATION OF GARBAGE COLLECTORS BY A META-HEURISTIC METHOD: A CASE STUDY

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.

MAHDAVI I.; TAVAKOLI MOGHADAM R.; GHAZIZADEH HASHEMI S.M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2010 | Volume:7 | Issue:1 (22) Page(s): 95-101

Download Full-Text

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

Persian Verion

View:

1,907

Download:

Cites:

Information Journal Paper

Title

A VEHICLE ROUTING PROBLEM AND DETERMINATION OF GARBAGE COLLECTORS BY A META-HEURISTIC METHOD: A CASE STUDY

Author(s)

MAHDAVI I. | TAVAKOLI MOGHADAM R. | GHAZIZADEH HASHEMI S.M. | Issue Writer Certificate

Keywords

CAPACITATED VEHICLE ROUTING PROBLEMQ2

BACKHAULSQ3

TIME WINDOWQ2

WASTE MANAGEMENTQ2

HYBRID SIMULATED ANNEALINGQ3

Abstract

This paper presents a linear integer programming model for a capacitated backhaul vehicle routing problem with TIME WINDOW (CVRPBTW) that minimizes the fleet cost and total traveled or the duration of the tours. We consider a heterogeneous fixed fleet with a fixed number of vehicles for each type (class). It is shown that the presented model enables to establish routes to serve all given customers (i.e., nodes) by the minimum number of vehicles with the maximum capacity used and minimum duration. This model is solved by a HYBRID SIMULATED ANNEALING (HSA) method, in which is able to find very good solutions in a reasonable amount of time. A number of test problems in a small and large size are solved, and the computational results are reported in this paper. We investigate the performance of the proposed method in a real case. The input data are collected from waste and garbage collection industries for specified areas in Tehran.

Cites

References

Cite

APA: Copy

MAHDAVI, I., TAVAKOLI MOGHADAM, R., & GHAZIZADEH HASHEMI, S.M.. (2010). A VEHICLE ROUTING PROBLEM AND DETERMINATION OF GARBAGE COLLECTORS BY A META-HEURISTIC METHOD: A CASE STUDY. JOURNAL OF TRANSPORTATION RESEARCH, 7(1 (22)), 95-101. SID. https://sid.ir/paper/83844/en

Vancouver: Copy

MAHDAVI I., TAVAKOLI MOGHADAM R., GHAZIZADEH HASHEMI S.M.. A VEHICLE ROUTING PROBLEM AND DETERMINATION OF GARBAGE COLLECTORS BY A META-HEURISTIC METHOD: A CASE STUDY. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2010;7(1 (22)):95-101. Available from: https://sid.ir/paper/83844/en

IEEE: Copy

I. MAHDAVI, R. TAVAKOLI MOGHADAM, and S.M. GHAZIZADEH HASHEMI, “A VEHICLE ROUTING PROBLEM AND DETERMINATION OF GARBAGE COLLECTORS BY A META-HEURISTIC METHOD: A CASE STUDY,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 7, no. 1 (22), pp. 95–101, 2010, [Online]. Available: https://sid.ir/paper/83844/en

Related Journal Papers