A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP

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.

RAHIMI AMIR MASOUD; RAJABI VAHID

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

Journal Paper

Paper Information

Journal: AMIRKABIR JOURNAL OF CIVIL ENGINEERING (AMIRKABIR) Year:2017 | Volume:48 | Issue:4 Page(s): 375-385

Download Full-Text

Persian Verion

View:

1,095

Download:

Cites:

Information Journal Paper

Title

A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP

Author(s)

RAHIMI AMIR MASOUD | RAJABI VAHID | Issue Writer Certificate

Keywords

HYBRID METAQ1

HEURISTIC ALGORITHMQ1

VEHICLE ROUTING PROBLEMQ1

SIMULTANEOUS DELIVERY AND PICKQ2

UPQ1

GENETIC ALGURITHMQ1

DETHLOFF PROBLEMSQ1

Abstract

Vehicle Routing Problem (VRP) is an important issue that has much used for productivity and efficiency of transportation systems in recent decades. One of the most popular and widely used developments VRP is the VEHICLE ROUTING PROBLEM with SIMULTANEOUS DELIVERY AND PICK-up (VRPSPD). In other words, each customer simultaneously receives and sends goods. The proposed procedure is a combination of the three heuristic, nearest neighbor algorithm, cheapest insertions, genetic algorithm. The first two algorithms with a random method provided the initial solution for the third algorithms. A probability function have been developed in the nearest neighbors and cheapest insertions, to construct better solutions; as well as operations proposed for the genetic algorithm to increase the search space and avoiding local optimizationis. The proposed algorithms has implemented on 40 different standard examples. After comparing the results by this algorithm and the best solutions by other algorithms, improvement is observed in 3 of the examples.

Cites

No record.

References

No record.

Cite

APA: Copy

RAHIMI, AMIR MASOUD, & RAJABI, VAHID. (2017). A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP. AMIRKABIR JOURNAL OF CIVIL ENGINEERING (AMIRKABIR), 48(4), 375-385. SID. https://sid.ir/paper/165850/en

Vancouver: Copy

RAHIMI AMIR MASOUD, RAJABI VAHID. A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP. AMIRKABIR JOURNAL OF CIVIL ENGINEERING (AMIRKABIR)[Internet]. 2017;48(4):375-385. Available from: https://sid.ir/paper/165850/en

IEEE: Copy

AMIR MASOUD RAHIMI, and VAHID RAJABI, “A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP,” AMIRKABIR JOURNAL OF CIVIL ENGINEERING (AMIRKABIR), vol. 48, no. 4, pp. 375–385, 2017, [Online]. Available: https://sid.ir/paper/165850/en

Related Journal Papers