A Hybrid Imperialist Competitive Algorithm for Integrated Scheduling of Production and Distribution with Vehicle Routing

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.

Izadi L.; AHMADIZAR F.; ARKAT J.

مرکز اطلاعات علمی 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:2018 | Volume:6 | Issue:12 Page(s): 63-81

Download Full-Text

Persian Verion

View:

479

Download:

Cites:

Information Journal Paper

Title

A Hybrid Imperialist Competitive Algorithm for Integrated Scheduling of Production and Distribution with Vehicle Routing

Author(s)

Izadi L. | AHMADIZAR F. | ARKAT J. | Issue Writer Certificate

Keywords

Integrated schedulingQ1

Vehicle routingQ2

Batch deliveryQ1

Holding costQ1

Imperialist competitive algorithmQ1

Dominance propertiesQ1

Abstract

In this paper, Integrated scheduling of production and distribution with Vehicle routing problem is considered. A manufacturer with parallel production lines receives customer orders; after producing them, they are then delivered to the customers in batches by a fleet of vehicles. Unlike a direct delivery of products from the manufacturer to each customer, Batch delivery reduces the transportation costs because of the maximum utilization of the vehicle capacities, but it may increase the holding and tardiness costs. The objective is to find an integrated schedule of production and distribution so as to minimize the setup, holding, distribution and tardiness costs. The problem is first formulated as a mixed integer linear programming model. In view of its NP-hardness, a procedure by incorporating Dominance properties with Imperialist competitive algorithm is then proposed to solve large-sized problem instances. To evaluate the performance of the proposed algorithm, several instances are generated and solved. Computational results demonstrate that the algorithm has a good performance for large problems.

Cites

No record.

References

No record.

Cite

Related Journal Papers