scholarly journals A Risk-Based Location-Allocation Approach for Weapon Logistics

Logistics ◽  
2018 ◽  
Vol 2 (2) ◽  
pp. 9
Author(s):  
Cihan Çetinkaya ◽  
Samer Haffar
Keyword(s):  
Location Allocation ◽  
Allocation Approach

Establishing an air pollution monitoring network for intra-urban population exposure assessment: A location-allocation approach

2005 ◽  
Vol 39 (13) ◽  
pp. 2399-2409 ◽  
Author(s):  
Pavlos S. Kanaroglou ◽  
Michael Jerrett ◽  
Jason Morrison ◽  
Bernardo Beckerman ◽  
M. Altaf Arain ◽  
...  
Keyword(s):  
Air Pollution ◽  
Exposure Assessment ◽  
Urban Population ◽  
Monitoring Network ◽  
Pollution Monitoring ◽  
Population Exposure ◽  
Air Pollution Monitoring ◽  
Location Allocation ◽  
Allocation Approach

The design of bus route systems — An interactive location-allocation approach

1987 ◽  
Vol 14 (3) ◽  
pp. 253-270 ◽  
Author(s):  
D. L. Van Oudheusden ◽  
S. Ranjithan ◽  
K. N. Singh
Keyword(s):  
Location Allocation ◽  
Allocation Approach

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Sign in / Sign up

Export Citation Format

Share Document