Application of Hierarchical Facility Location-Routing Problem with Optimization of an Underground Logistic System: A Case Study in China

Facility location problem (FLP) and vehicle routing problem (VRP) are two of the most challenging issues in logistics. This paper presents an exploration of the multinode facility location-routing problem with realistic conditions. The disposal centers, transfer stations, connected collection sites, and unconnected collection sites are built into a new hierarchical model which is solved by Generate Algorithm (GA). Model costs include node construction cost, pipeline construction cost, transport cost, and transfer cost. This paper considers that the transportation is a bidirectional flow not a single flow; each pairs node in the area needs transportation; the dynamic routing selection method is used to determine the routes of unconnected collection sites. FLP and VRP can be both solved in this model. To illustrate the applicability of the model, a case study is presented and the results are discussed. The model in this paper can reduce the cost of the traditional underground logistics system by 6%~8% in experiments.

Download Full-text

Location Routing Problem with Consideration of CO2 Emissions Cost: A Case Study

Jurnal Teknik Industri ◽

10.22219/jtiumm.vol21.no2.225-234 ◽

2020 ◽

Vol 21 (2) ◽

pp. 225-234

Author(s):

Ananda Noor Sholichah ◽

Y Yuniaristanto ◽

I Wayan Suletra

Keyword(s):

Co2 Emissions ◽

Time Windows ◽

Optimal Solution ◽

Mixed Integer ◽

Distribution Centers ◽

Location Routing Problem ◽

Routing Problem ◽

Location Routing ◽

Study Results

Location and routing are the main critical problems investigated in a logistic. Location-Routing Problem (LRP) involves determining the location of facilities and vehicle routes to supply customer's demands. Determination of depots as distribution centers is one of the problems in LRP. In LRP, carbon emissions need to be considered because these problems cause global warming and climate change. In this paper, a new mathematical model for LRP considering CO2 emissions minimization is proposed. This study developed a new Mixed Integer Linear Programming (MILP) model for LRP with time windows and considered the environmental impacts. Finally, a case study was conducted in the province of Central Java, Indonesia. In this case study, there are three depot candidates. The study results indicated that using this method in existing conditions and constraints provides a more optimal solution than the company's actual route. A sensitivity analysis was also carried out in this case study.

Download Full-text

A Two-Phase Meta Heuristic Approach to the Location-Routing Problem for Transportation Network Planning

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.361-363.1900 ◽

2013 ◽

Vol 361-363 ◽

pp. 1900-1905 ◽

Cited By ~ 1

Author(s):

Ji Ung Sun

Keyword(s):

Ant Colony Optimization ◽

Facility Location ◽

Vehicle Routing ◽

Optimization Algorithm ◽

Transportation Network ◽

Ant Colony Optimization Algorithm ◽

Two Phase ◽

Location Routing Problem ◽

Routing Problem ◽

Location Routing

In this paper we consider the location-routing problem which combines the facility location and the vehicle routing decisions. In this type of problem, we have to determine the location of facilities within a set of possible locations and routes of the vehicles to meet the demands of number of customers. Since the location-routing problem is NP-hard, it is difficult to obtain optimal solution within a reasonable computational time. Therefore, a two-phase ant colony optimization algorithm is developed which solves facility location problem and vehicle routing problem hierarchically. Its performance is examined through a comparative study. The experimental results show that the proposed ant colony optimization algorithm can be a viable solution method for the general transportation network planning.

Download Full-text