scholarly journals A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study

2016 ◽  
Vol 250 (2) ◽  
pp. 279-308 ◽  
Author(s):  
Nasrin Asgari ◽  
Mohsen Rajabi ◽  
Masoumeh Jamshidi ◽  
Maryam Khatami ◽  
Reza Zanjirani Farahani
Keyword(s):  
Memetic Algorithm ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Multi Objective ◽  
Location Routing

scholarly journals A memetic algorithm for location-routing problem with time windows for the attention of seismic disasters: a case study from Bucaramanga, Colombia

Inge CUC ◽  
2018 ◽  
Vol 14 (1) ◽  
pp. 75-86 ◽  
Author(s):  
Henry Lamos Díaz ◽  
Karin Aguilar Imitola ◽  
Melissa Barreto Robles ◽  
Paula Niño Niño ◽  
Daniel Martínez Quezada
Keyword(s):  
Memetic Algorithm ◽  
Time Windows ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

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.

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

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.

Solving a multi-objective multi-depot stochastic location-routing problem by a hybrid simulated annealing algorithm

2009 ◽  
Vol 223 (8) ◽  
pp. 1045-1054 ◽  
Author(s):  
H A Hassan-Pour ◽  
M Mosadegh-Khah ◽  
R Tavakkoli-Moghaddam
Keyword(s):  
Simulated Annealing ◽  
Large Scale ◽  
Simulated Annealing Algorithm ◽  
Genetic Operators ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Multi Objective ◽  
Location Routing ◽  
Proposed Model ◽  
Stochastic Location

This paper presents a novel mathematical model for a stochastic location-routing problem (SLRP) that minimizes the facilities establishing cost and transportation cost, and maximizes the probability of delivery to customers. In this proposed model, new aspects of a location-routing problem (LRP), such as stochastic availability of facilities and routes, are developed that are similar to real-word problems. The proposed model is solved in two stages: (i) solving the facility location problem (FLP) by a mathematical algorithm and (ii) solving the multi-objective multi-depot vehicle routing problem (MO-MDVRP) by a simulated annealing (SA) algorithm hybridized by genetic operators, namely mutation and crossover. The proposed SA can find good solutions in a reasonable time. It solves the proposed model in large-scale problems with acceptable results. Finally, a trade-off curve is used to depict and discuss a large-sized problem. The associated results are compared with the results obtained by the lower bound and Lingo 8.0 software.

scholarly journals A multi-objective model for the green capacitated location-routing problem considering environmental impact

2017 ◽  
Vol 110 ◽  
pp. 114-125 ◽  
Author(s):  
Eliana M. Toro ◽  
John F. Franco ◽  
Mauricio Granada Echeverri ◽  
Frederico Gadelha Guimarães
Keyword(s):  
Environmental Impact ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Multi Objective ◽  
Location Routing ◽  
Objective Model ◽  
Capacitated Location
Sign in / Sign up

Export Citation Format

Share Document