A HEURISTIC AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM

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.

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

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2009 | Volume:20 | Issue:1 Page(s): 1-14

Download Full-Text

Persian Verion

View:

1,086

Download:

Cites:

Information Journal Paper

Title

A HEURISTIC AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM

Author(s)

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

Keywords

LOCATION-ROUTINGQ2

LOCATIONQ2

ROUTINGQ3

SIMULATED ANNEALINGQ3

MINIMUM SPANNING FORESTQ3

Abstract

During the last three decades, the integrated optimization approach to logistics systems has become one of the most important aspects of the supply chain optimization. This approach simultaneously considers the interdependence of the LOCATION of the facilities, suppliers/customers allocation to the facilities, the structure of transportation routes, and inventory planning and control. ROUTING/fa?page=1&sort=1&ftyp=all&fgrp=all&fyrs=all" target="_blank">LOCATION-ROUTING problem is one of the most important classes of LOCATION problems for considering this approach. In this problem, the number and LOCATION of facilities, size of the transportation fleet, and the route structures are to be found with respect to the LOCATION and characteristics of suppliers and customers. In this study, a mathematical model, an efficient and fast heuristic algorithm, an effective metaheuristic algorithm based on SIMULATED ANNEALING, and a new lower bound for the two-echelon LOCATION ROUTING problem with vehicle fleet capacity and maximum route length constraints are presented. At the end, the computational results show the efficiency of the proposed algorithms using the proposed obtained lower bound.

Cites

No record.

References

No record.

Cite

APA: Copy

ZEGORDI, S.H.A.D., & NIKBAKHSH, E.. (2009). A HEURISTIC AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 20(1), 1-14. SID. https://sid.ir/paper/65691/en

Vancouver: Copy

ZEGORDI S.H.A.D., NIKBAKHSH E.. A HEURISTIC AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2009;20(1):1-14. Available from: https://sid.ir/paper/65691/en

IEEE: Copy

S.H.A.D. ZEGORDI, and E. NIKBAKHSH, “A HEURISTIC AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 20, no. 1, pp. 1–14, 2009, [Online]. Available: https://sid.ir/paper/65691/en

Related Journal Papers