A Hybrid Genetic Algorithm for Integrated Production and Distribution Scheduling Problem with Outsourcing Allowed

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: INTERNATIONAL JOURNAL OF ENGINEERING Year:2020 | Volume:33 | Issue:11 Page(s): 2285-2298

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A Hybrid Genetic Algorithm for Integrated Production and Distribution Scheduling Problem with Outsourcing Allowed

Author(s)

Izadi L. | Ahmadizar F. | Arkat J. | Issue Writer Certificate

Keywords

dominance properties

Hybrid genetic algorithm

Inventory

Outsourcing

Production scheduling

Vehicle routing

Abstract

In this paper, we studied a new integrated production scheduling, vehicle routing, inventory and outsourcing problem. The production phase considers parallel machine scheduling including setup times with outsourcing allowed and the distribution phase considered batch delivery by a fleet of homogenous vehicles with respect to holding cost of completed jobs. The objective of the Mixed Integer Linear Programming (MILP) formulated model is to minimize the total costs including production, outsourcing, holding, tardiness and distribution fixed and variable costs. Due to the nondeterministic polynomial time (Np)-hardness of the problem, we derive a number of dominance properties for the optimal solution and combine them with a Genetic Algorithm (GA) to solve the problem. To assess the efficiency and effectiveness of the proposed hybrid algorithm, we conduct the computational study on randomly generated instances. Sensitivity analyses showed the impacts of the parameters on the objective function were incorporated. In order to evaluate the significance of the differences among the results obtained by GA and GADP one-tailed paired t tests were performed and interval plots were depicted.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans