Presentation of the dynamic capacitated location-routing problem with considering price-sensitive demand

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.

etebari farhad; Torbati Niloufar

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES Year:2019 | Volume:17 | Issue:52 Page(s): 89-124

Download Full-Text

Persian Verion

View:

558

Download:

Cites:

Information Journal Paper

Title

Presentation of the dynamic capacitated location-routing problem with considering price-sensitive demand

Author(s)

etebari farhad | Torbati Niloufar | Issue Writer Certificate

Keywords

routingQ1

locationQ2

price dependent demandQ1

heuristic algorithmQ2

meta-heuristic algorithmQ1

Abstract

One of the most important problems of logistic networks is designing and analyzing of the distribution network. The design of distribution systems raises hard combinatorial optimization problems. In recent years, two main problems in the design of distribution networks that are location of distribution centres and routing of distributors are considered together and created the location-routing problem. The location-routing problem (LRP), integrates the two kinds of decisions. The classical LRP, consists in opening a subset of depots, assigning customers to them and determining vehicle routes, to minimize total cost of the problem. In this paper, a dynamic capacitated location-routing problem is considered that there are a number of potential depot locations and customers with specific demand and locations, and some vehicles with a certain capacity. Decisions concerning facility locations are permitted to be made only in the first time period of the planning horizon but, the routing decisions may be changed in each time period. In this study, customer demands depend on the products offering prices. The corresponding model and presented results related to the implementation of the model by different solution methods have been analysed by different methods. A hybrid heuristic algorithm based on particle swarm optimization is proposed to solve the problem. To evaluate the performance of the proposed algorithm, the proposed algorithm results are compared with exact algorithm optimal value and lower bounds. The comparison between hybrid proposed algorithm and exact solutions are performed and computational experiments show the effectiveness of the proposed algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

etebari, farhad, & Torbati, Niloufar. (2019). Presentation of the dynamic capacitated location-routing problem with considering price-sensitive demand. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, 17(52 ), 89-124. SID. https://sid.ir/paper/213264/en

Vancouver: Copy

etebari farhad, Torbati Niloufar. Presentation of the dynamic capacitated location-routing problem with considering price-sensitive demand. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES[Internet]. 2019;17(52 ):89-124. Available from: https://sid.ir/paper/213264/en

IEEE: Copy

farhad etebari, and Niloufar Torbati, “Presentation of the dynamic capacitated location-routing problem with considering price-sensitive demand,” JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, vol. 17, no. 52 , pp. 89–124, 2019, [Online]. Available: https://sid.ir/paper/213264/en

Related Journal Papers