A Heuristic Method to Minimize Total Weighted Number of Tardy Jobs and Transportation Costs for an Integrated Production and Distribution Problem with VRP

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.

Khodabandeh Mahdi; Hejazi Taghanaki Seyed Reza; RASTI BARZOKI MORTEZA

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

Journal Paper

Paper Information

Journal: MODERN RESEARCHES IN DECISION MAKING Year:2018 | Volume:3 | Issue:3 Page(s): 55-78

Download Full-Text

Persian Verion

View:

239

Download:

Cites:

Information Journal Paper

Title

A Heuristic Method to Minimize Total Weighted Number of Tardy Jobs and Transportation Costs for an Integrated Production and Distribution Problem with VRP

Author(s)

Khodabandeh Mahdi | Hejazi Taghanaki Seyed Reza | RASTI BARZOKI MORTEZA | Issue Writer Certificate

Keywords

supply chainQ2

SchedulingQ1

Tardy JobQ1

HeuristicQ1

Abstract

In this paper an integrated production and outbound distribution Scheduling (IPODS) with vehicle routing problem (VRP) for multi customer situation in a supply chain is addressed. There are K orders (jobs) that have to be scheduled on a single machine and delivered to K customers. Each order has its own due date. The manufacturer delivers the orders in batches which have no capacity constraint. Delivering the products in batches reduces the delivery cost but it may increase the number of Tardy Jobs. No other research has been conducted on this problem yet. This problem is strongly NP-Hard. The objective is to minimize the sum of the total weighted number of Tardy Jobs and delivery costs. Also, in this paper, an MILP model and a Heuristic Algorithm (HA) for solving this problem are presented. Full factorial Computational test is performed for evaluation of these two methods. The obtained results on 3840 problems show that the Heuristic algorithm is efficient for solved problem. Also we surveyed parameter's levels effect on CPLEX and Heuristic performance by analysis of variance.

Cites

No record.

References

No record.

Cite

APA: Copy

Khodabandeh, Mahdi, Hejazi Taghanaki, Seyed Reza, & RASTI BARZOKI, MORTEZA. (2018). A Heuristic Method to Minimize Total Weighted Number of Tardy Jobs and Transportation Costs for an Integrated Production and Distribution Problem with VRP. MODERN RESEARCHES IN DECISION MAKING, 3(3 ), 55-78. SID. https://sid.ir/paper/372004/en

Vancouver: Copy

Khodabandeh Mahdi, Hejazi Taghanaki Seyed Reza, RASTI BARZOKI MORTEZA. A Heuristic Method to Minimize Total Weighted Number of Tardy Jobs and Transportation Costs for an Integrated Production and Distribution Problem with VRP. MODERN RESEARCHES IN DECISION MAKING[Internet]. 2018;3(3 ):55-78. Available from: https://sid.ir/paper/372004/en

IEEE: Copy

Mahdi Khodabandeh, Seyed Reza Hejazi Taghanaki, and MORTEZA RASTI BARZOKI, “A Heuristic Method to Minimize Total Weighted Number of Tardy Jobs and Transportation Costs for an Integrated Production and Distribution Problem with VRP,” MODERN RESEARCHES IN DECISION MAKING, vol. 3, no. 3 , pp. 55–78, 2018, [Online]. Available: https://sid.ir/paper/372004/en

Related Journal Papers