A HEURISTIC ALGORITHM AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM WITH SOFT TIME WINDOW CONSTRAINTS

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.

NIKBAKHSH E.; ZEGORDI S.H.A.D.

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

Journal Paper

Paper Information

Journal: SCIENTIA IRANICA Year:2010 | Volume:17 | Issue:1 (TRANSACTION E: INDUSTRIAL ENGINEERING) Page(s): 36-47

Download Full-Text

View:

452

Download:

407

Cites:

Information Journal Paper

Title

A HEURISTIC ALGORITHM AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM WITH SOFT TIME WINDOW CONSTRAINTS

Author(s)

NIKBAKHSH E. | ZEGORDI S.H.A.D. | Issue Writer Certificate

Keywords

LOCATION-ROUTING

LOCATION

ROUTING

SOFT TIME WINDOW

HEURISTIC ALGORITHM

Abstract

The ROUTING/fa?page=1&sort=1&ftyp=all&fgrp=all&fyrs=all" target="_blank">LOCATION-ROUTING problem is one of the most important LOCATION problems for designing integrated logistics systems. In the last three decades, various types of objective function and constraints have been considered for this problem. However, time window constraints have received little attention, despite their numerous real-life applications. In this article, a new 4-index mathematical model, an efficient and fast heuristic and a lower bound for the two-echelon ROUTING/fa?page=1&sort=1&ftyp=all&fgrp=all&fyrs=all" target="_blank">LOCATION-ROUTING problems with SOFT TIME WINDOW constraints are presented. The proposed heuristic tries to solve the problem via creating an initial solution, then improving it by searching on six neighborhoods of the solution, and using the Or-opt heuristic. At the end, computational results show the efficiency of the proposed heuristic, using the proposed lower bound.

Cites

No record.

References

No record.

Cite

APA: Copy

NIKBAKHSH, E., & ZEGORDI, S.H.A.D.. (2010). A HEURISTIC ALGORITHM AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM WITH SOFT TIME WINDOW CONSTRAINTS. SCIENTIA IRANICA, 17(1 (TRANSACTION E: INDUSTRIAL ENGINEERING)), 36-47. SID. https://sid.ir/paper/289933/en

Vancouver: Copy

NIKBAKHSH E., ZEGORDI S.H.A.D.. A HEURISTIC ALGORITHM AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM WITH SOFT TIME WINDOW CONSTRAINTS. SCIENTIA IRANICA[Internet]. 2010;17(1 (TRANSACTION E: INDUSTRIAL ENGINEERING)):36-47. Available from: https://sid.ir/paper/289933/en

IEEE: Copy

E. NIKBAKHSH, and S.H.A.D. ZEGORDI, “A HEURISTIC ALGORITHM AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM WITH SOFT TIME WINDOW CONSTRAINTS,” SCIENTIA IRANICA, vol. 17, no. 1 (TRANSACTION E: INDUSTRIAL ENGINEERING), pp. 36–47, 2010, [Online]. Available: https://sid.ir/paper/289933/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops