Two meta-heuristic algorithms for two-echelon location-routing problem with vehicle fleet capacity and maximum route length constraints

2012 ◽  
Vol 23 (7-8) ◽  
pp. 2341-2349 ◽  
Author(s):  
Vahid Majazi Dalfard ◽  
Mojtaba Kaveh ◽  
Nassim Ekram Nosratian
Keyword(s):  
Heuristic Algorithms ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Route Length ◽  
Vehicle Fleet

scholarly journals Optimization of Base Location and Patrol Routes for Unmanned Aerial Vehicles in Border Intelligence, Surveillance and Reconnaissance

2018 ◽  
Author(s):  
Yao Liu ◽  
Zhong Liu ◽  
Jianmai Shi ◽  
Guohua Wu ◽  
Chao Chen
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Heuristic Algorithms ◽  
Programming Model ◽  
Base Station ◽  
Base Stations ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Solution Approach ◽  
Location Routing ◽  
Aerial Vehicles

The location routing problem of unmanned aerial vehicles (UAV) in border patrol for intelligence, surveillance and reconnaissance is investigated, where the location of UAV base stations and the UAV flying routes for visiting the targets in border area are jointly optimized. The capacity of the base station and the endurance of the UAV are considered. A binary integer programming model is developed to formulate the problem, and two heuristic algorithms combined with local search strategies are designed for solving the problem. The experiment design for simulating the distribution of stations and targets in border is proposed for generating random test instances. Also, an example based on the Sino-Vietnamese border is presented to illustrate the problem and the solution approach. The performance of the two algorithms are analyzed and compared through randomly generated instances.

scholarly journals Optimization of Base Location and Patrol Routes for Unmanned Aerial Vehicles in Border Intelligence, Surveillance and Reconnaissance

2019 ◽  
Author(s):  
Yao Liu ◽  
Zhong Liu ◽  
Jianmai Shi ◽  
Guohua Wu ◽  
Chao Chen
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Heuristic Algorithms ◽  
Programming Model ◽  
Base Station ◽  
Base Stations ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Solution Approach ◽  
Location Routing ◽  
Aerial Vehicles

The location routing problem of unmanned aerial vehicles (UAV) in border patrol for intelligence, surveillance and reconnaissance is investigated, where the location of UAV base stations and the UAV flying routes for visiting the targets in border area are jointly optimized. The capacity of the base station and the endurance of the UAV are considered. A binary integer programming model is developed to formulate the problem, and two heuristic algorithms combined with local search strategies are designed for solving the problem. The experiment design for simulating the distribution of stations and targets in border is proposed for generating random test instances. Also, an example based on the Sino-Vietnamese border is presented to illustrate the problem and the solution approach. The performance of the two algorithms are analyzed and compared through randomly generated instances.

scholarly journals Optimization of Base Location and Patrol Routes for Unmanned Aerial Vehicles in Border Intelligence, Surveillance, and Reconnaissance

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Yao Liu ◽  
Zhong Liu ◽  
Jianmai Shi ◽  
Guohua Wu ◽  
Chao Chen
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Heuristic Algorithms ◽  
Programming Model ◽  
Base Station ◽  
Base Stations ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Solution Approach ◽  
Location Routing ◽  
Aerial Vehicles

The location-routing problem (LRP) of unmanned aerial vehicles (UAV) in border patrol for Intelligence, Surveillance, and Reconnaissance is investigated, where the locations of UAV base stations and the UAV flying routes for visiting the targets in border area are jointly optimized. The capacity of the base station and the endurance of the UAV are considered. A binary integer programming model is developed to formulate the problem, and two heuristic algorithms combined with local search strategies are designed for solving the problem. The experiment design for simulating the distribution of stations and targets in border is proposed for generating random test instances. Also, an example based on the practical border in Guangxi is presented to illustrate the problem and the solution approach. The performance of the two algorithms is analysed and compared through randomly generated instances.

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 Reliable Fourth Party Logistics Location-routing Problem under the Risk of Disruptions

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Min Huang ◽  
Liwei Dong ◽  
Hanbin Kuang ◽  
Xingwei Wang
Keyword(s):  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Fourth Party Logistics
Sign in / Sign up

Export Citation Format

Share Document