MATHEMATICAL MODELING FOR A VEHICLE ROUTING PROBLEM WITH BACKHAUL SOLVED BY A NEW MULTI-ANT COLONY OPTIMIZATION 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.

JAFARI AZIZOLLAH; TAVAKKOLI MOGHADDAM REZA; FORGHANI MOHSEN; ARAB RAHMAT

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2016 | Volume:7 | Issue:1 (12) Page(s): 215-234

Download Full-Text

Persian Verion

View:

1,659

Download:

Cites:

Information Journal Paper

Title

MATHEMATICAL MODELING FOR A VEHICLE ROUTING PROBLEM WITH BACKHAUL SOLVED BY A NEW MULTI-ANT COLONY OPTIMIZATION ALGORITHM

Author(s)

JAFARI AZIZOLLAH | TAVAKKOLI MOGHADDAM REZA | FORGHANI MOHSEN | ARAB RAHMAT | Issue Writer Certificate

Keywords

VEHICLE ROUTING PROBLEM WITH BACKHAULQ1

HETEROGENEOUS FLEET OF VEHICLESQ1

SPLIT SERVICEQ2

ANT COLONY SYSTEMQ1

LOCAL SEARCHQ2

Abstract

This paper considers the VEHICLE ROUTING PROBLEM WITH BACKHAUL (VRPB) and some applicable constraints, in which a set of costumers are divided into two subsets of linehaul and backhaul costumers. Each linehaul costumer requires its demands to be delivered from the depot. In addition, a specified quantity of products should be picked up from the backhaul nodes to the depot. The main point in this study is that the customer demands, which are over than the maximum of available vehicles, can be divided to different customers. In addition, there is limited vehicle access availability for some costumers. The central depot includes a fleet of vehicles with different capacities, in which the number of vehicles of each type is not limited and customer demands are dynamic and can change in each period. This problem is a wellknown NP-hard one; therefore, a new multi-ant colony optimization algorithm is proposed to solve the given problem. This proposed algorithm contains two phases, namely clustering and routing. Finally, the numerical results of designed test problems have been discussed and analyzed.

Cites

No record.

References

No record.

Cite

APA: Copy

JAFARI, AZIZOLLAH, TAVAKKOLI MOGHADDAM, REZA, FORGHANI, MOHSEN, & ARAB, RAHMAT. (2016). MATHEMATICAL MODELING FOR A VEHICLE ROUTING PROBLEM WITH BACKHAUL SOLVED BY A NEW MULTI-ANT COLONY OPTIMIZATION ALGORITHM. PRODUCTION AND OPERATIONS MANAGEMENT, 7(1 (12) ), 215-234. SID. https://sid.ir/paper/217545/en

Vancouver: Copy

JAFARI AZIZOLLAH, TAVAKKOLI MOGHADDAM REZA, FORGHANI MOHSEN, ARAB RAHMAT. MATHEMATICAL MODELING FOR A VEHICLE ROUTING PROBLEM WITH BACKHAUL SOLVED BY A NEW MULTI-ANT COLONY OPTIMIZATION ALGORITHM. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2016;7(1 (12) ):215-234. Available from: https://sid.ir/paper/217545/en

IEEE: Copy

AZIZOLLAH JAFARI, REZA TAVAKKOLI MOGHADDAM, MOHSEN FORGHANI, and RAHMAT ARAB, “MATHEMATICAL MODELING FOR A VEHICLE ROUTING PROBLEM WITH BACKHAUL SOLVED BY A NEW MULTI-ANT COLONY OPTIMIZATION ALGORITHM,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 7, no. 1 (12) , pp. 215–234, 2016, [Online]. Available: https://sid.ir/paper/217545/en

Related Journal Papers