scholarly journals An MIP formulation for the open location‐routing problem considering the topological characteristic of the solution‐paths

Networks ◽  
2019 ◽  
Vol 74 (4) ◽  
pp. 374-388
Author(s):  
Mauricio Granada ◽  
Eliana M. Toro ◽  
Ramón Gallego
Keyword(s):  
Topological Characteristic ◽  
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 Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 45
Author(s):  
Rafael D. Tordecilla ◽  
Pedro J. Copado-Méndez ◽  
Javier Panadero ◽  
Carlos L. Quintero-Araujo ◽  
Jairo R. Montoya-Torres ◽  
...  
Keyword(s):  
Fuzzy Logic ◽  
Local Search ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Iterated Local Search ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Fuzzy Pattern ◽  
Reasonable Computing

The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers’ demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm.

Multiobjective location-routing problem of relief commodities with reliability

2021 ◽  
Author(s):  
Hossein Beiki ◽  
Seyed M. Seyedhosseini ◽  
Leonardus W. W. Mihardjo ◽  
Seyed M. Seyedaliakbar
Keyword(s):  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

scholarly journals A review on the electric vehicle routing problems: Variants and algorithms

2021 ◽  
Author(s):  
Hu Qin ◽  
Xinxin Su ◽  
Teng Ren ◽  
Zhixing Luo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Location Routing Problem ◽  
Routing Problems ◽  
Routing Problem ◽  
Delivery Problem ◽  
Pickup And Delivery Problem ◽  
The Past ◽  
Location Routing ◽  
Comprehensive Survey

AbstractOver the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents a comprehensive survey of EV routing problems and their many variants. We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip. The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP, electric dial-a-ride problem, electric two-echelon VRP, and electric pickup and delivery problem. For each of these nine classes, we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.

Interactive Spatial Decision-Support System for Multiobjective Hazardous Materials Location-Routing Problems

1997 ◽  
Vol 1602 (1) ◽  
pp. 101-109 ◽  
Author(s):  
João Coutinho-Rodrigues ◽  
John Current ◽  
João Climaco ◽  
Samuel Ratick
Keyword(s):  
Decision Support ◽  
Decision Support System ◽  
Support System ◽  
Hazardous Materials ◽  
Spatial Decision Support System ◽  
Spatial Decision Support ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Selection Of

Hazardous materials (hazmat) logistics management has received increased attention in the past two decades. Important decisions in such management include the selection of sites for hazmat processing and storage, the selection of transportation routes from sources to processing facilities, and the determination of quantities of hazmat shipped over these routes. These decisions are frequently based on multiple criteria (e.g., cost, risk, equity). A personal computer–based, interactive spatial decision-support system was designed to assist decision makers with such problems. Although presented within the framework of a hazmat problem, the system’s components can be modified to analyse any multiobjective location, routing, or location-routing problem.

Sign in / Sign up

Export Citation Format

Share Document