A Multi-Objective Location-Allocation-Routing Optimization With Time Window for Transferring Personnel From Residence to Work: A Case Study of Bistoon Power Plant

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.

Panjehaein Faraz; Bozorgi Amiri Ali; Khalifeh Mozhgan

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

Journal Paper

Paper Information

Journal: INTERDISCIPLINARY JOURNAL OF MANAGEMENT STUDIES Year:2023 | Volume:16 | Issue:1 Page(s): 25-42

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A Multi-Objective Location-Allocation-Routing Optimization With Time Window for Transferring Personnel From Residence to Work: A Case Study of Bistoon Power Plant

Author(s)

Panjehaein Faraz | Bozorgi Amiri Ali | Khalifeh Mozhgan | Issue Writer Certificate

Keywords

location-allocation (LA)

location-routing problem (LRP)

personnel transportation

two-objective optimization

Epsilon constraint method

Abstract

This paper presents a two-phase approach to design an optimal personnel transportation network for the Bistoon Power Plant. In the first phase, a mathematical model of location-allocation for locating bus stops and allocating staff to bus stops has been formulated with the objective of minimizing the total walking distance for staff. For the second phase, a mathematical model of location-allocation-routing with time window for selecting vehicles with the appropriate capacity for each route, locating the parking places (start nodes), vehicle routing, and trip scheduling is discussed with the two objectives of minimizing transportation costs and minimizing the maximum travel time of staff to ensure fairness among staff. One of the features of this study is the consideration of the distance between vehicle parking areas and the first demand nodes on each route in order to locate parking areas. Other expected side benefits of the implementation of this research are decreasing the total travel distances, traffic congestion, and air pollution. Despite the large number of nodes and data of the case study, the proposed mathematical models are solved by the exact solution method. In order to solve the two-objective model, the augmented epsilon constraint method has been used to find the Pareto solution set.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans