AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR THE GREEN VEHICLE ROUTING PROBLEM WITH SIMULTANEOUSLY PICKUP AND

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.

MAJIDI S.; HOSSEINI MOTLAGH S.M.; Yaghobi S.; JOKAR A.

مرکز اطلاعات علمی 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): 149-165

Download Full-Text

Persian Verion

View:

1,212

Download:

Cites:

Information Journal Paper

Title

AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR THE GREEN VEHICLE ROUTING PROBLEM WITH SIMULTANEOUSLY PICKUP AND

Author(s)

MAJIDI S. | HOSSEINI MOTLAGH S.M. | Yaghobi S. | JOKAR A. | Issue Writer Certificate

Keywords

GREEN VEHICLE ROUTINGQ2

PROBLEMQ2

FUEL CONSUMPTIONQ2

SIMULTANEOUSLY PICKUP AND DELIVERYQ2

ADAPTIVE LARGE NEIGHBORHOOD SEARCHQ2

Abstract

The classical models of vehicle routing generally focused on minimizing total distance and travel time, however in GREEN VEHICLE ROUTING PROBLEM the main objective is minimizing total emissions and FUEL CONSUMPTION besides the other objects.In this paper, extension of GVRP with minimizing fuel and emission costs presented that considered pickup and delivery constraints with hard time windows. Travel time in this model is not constant and speed of vehicles would be determined in regards to customers’ time widows. In this paper, a heuristic based ADAPTIVE LARGE NEIGHBORHOOD SEARCH proposed for solving the model. Construction algorithm in this method is heuristic based algorithm with proposed criterion according to pick up and delivery constrains and time windows with assumption of variable speed. Computational results confirms efficiency of this algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

MAJIDI, S., HOSSEINI MOTLAGH, S.M., Yaghobi, S., & JOKAR, A.. (2016). AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR THE GREEN VEHICLE ROUTING PROBLEM WITH SIMULTANEOUSLY PICKUP AND. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), 3(6), 149-165. SID. https://sid.ir/paper/241307/en

Vancouver: Copy

MAJIDI S., HOSSEINI MOTLAGH S.M., Yaghobi S., JOKAR A.. AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR THE GREEN VEHICLE ROUTING PROBLEM WITH SIMULTANEOUSLY PICKUP AND. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS)[Internet]. 2016;3(6):149-165. Available from: https://sid.ir/paper/241307/en

IEEE: Copy

S. MAJIDI, S.M. HOSSEINI MOTLAGH, S. Yaghobi, and A. JOKAR, “AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR THE GREEN VEHICLE ROUTING PROBLEM WITH SIMULTANEOUSLY PICKUP AND,” JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), vol. 3, no. 6, pp. 149–165, 2016, [Online]. Available: https://sid.ir/paper/241307/en

Related Journal Papers