Multi-Objective Location Model Research and Application in the City Emergency Logistics Based on Different Product Materials

2011 ◽  
Vol 63-64 ◽  
pp. 277-280 ◽  
Author(s):  
Hong Zhi Liu ◽  
Li Na Liu
Keyword(s):  
Parametric Programming ◽  
Location Model ◽  
Programming Method ◽  
Logistics Center ◽  
Multi Objective ◽  
Emergency Logistics ◽  
Model Research ◽  
Covering Model ◽  
The Cost ◽  
Limited Demand

We build up a multi-objective location model of emergency logistics center location, The model combined the construction cost of emergency logistics center with the point of shortest distance from the emergency needs of the logistics center to the limited demand, so that meet the different deployment strategies. We get satisfactory results in the practical by using parametric programming method for solving multi-objective model and verifying for the analysis of examples of this multi-objective decision. The model take into account the cost, efficiency and fairness, combined with the traditional model of coverage (covering model, gravity model and the P-median model).To meet the city's emergency different deployment strategy, the multi-objective location model solve and verify by the parametric programming method and some examples.

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.

Multi-Objective Fuzzy Linear Programming for Land Allocation under Different Crops in Bhagwanpur Distributary

2019 ◽  
Vol 6 (04) ◽  
Author(s):  
ASHUTOSH UPADHYAYA
Keyword(s):  
Linear Programming ◽  
Crop Production ◽  
Fuzzy Linear Programming ◽  
Programming Method ◽  
Command Area ◽  
Linear Programming Method ◽  
Net Return ◽  
Multi Objective ◽  
Labour Requirement ◽  
Canal Command Area

A study was undertaken in Bhagwanpur distributary of Vaishali Branch Canal in Gandak Canal Command Area, Bihar to optimally allocate land area under different crops (rice and maize in kharif, wheat, lentil, potato in rabi and green gram in summer) in such a manner that maximizes net return, maximizes crop production and minimizes labour requirement employing simplex linear programming method and Multi-Objective Fuzzy Linear Programming (MOFLP) method. Maximum net return, maximum agricultural production, and minimum labour required under defined constraints (including 10% affinity level of farmers to rice and wheat crops) as obtained employing Simplex method were ` 3.7 × 108, 5.06 × 107 Kg and 66,092 man-days, respectively, whereas Multi-Objective Fuzzy Linear Programming (MOFLP) method yielded compromised solution with net return, crop production and labour required as ` 2.4 × 108, 3.3 × 107Kg and 1,79,313 man-days, respectively. As the affinity level of farmers to rice and wheat crops increased from 10% to 40%, maximum net return and maximum production as obtained from simplex linear programming method and MOFLP followed a decreasing trend and minimum labour required followed an increasing trend. MOFLP may be considered as one of the best capable ways of providing a compromised solution, which can fulfill all the objectives at a time.

Pareto Set as a Model for Dispatching Resources in Emergency Centres (Preprint)

2018 ◽  
Author(s):  
Ricardo Guedes ◽  
Vasco Furtado ◽  
Tarcísio Pequeno ◽  
Joel Rodrigues
Keyword(s):  
Operational Research ◽  
Real Data ◽  
Pareto Set ◽  
Multi Objective Optimization ◽  
Pareto Dominance ◽  
Four Dimensions ◽  
Multi Objective ◽  
The Best Approximation ◽  
One Year ◽  
The Cost

UNSTRUCTURED The article investigates policies for helping emergency-centre authorities for dispatching resources aimed at reducing goals such as response time, the number of unattended calls, the attending of priority calls, and the cost of displacement of vehicles. Pareto Set is shown to be the appropriated way to support the representation of policies of dispatch since it naturally fits the challenges of multi-objective optimization. By means of the concept of Pareto dominance a set with objectives may be ordered in a way that guides the dispatch of resources. Instead of manually trying to identify the best dispatching strategy, a multi-objective evolutionary algorithm coupled with an Emergency Call Simulator uncovers automatically the best approximation of the optimal Pareto Set that would be the responsible for indicating the importance of each objective and consequently the order of attendance of the calls. The scenario of validation is a big metropolis in Brazil using one-year of real data from 911 calls. Comparisons with traditional policies proposed in the literature are done as well as other innovative policies inspired from different domains as computer science and operational research. The results show that strategy of ranking the calls from a Pareto Set discovered by the evolutionary method is a good option because it has the second best (lowest) waiting time, serves almost 100% of priority calls, is the second most economical, and is the second in attendance of calls. That is to say, it is a strategy in which the four dimensions are considered without major impairment to any of them.

scholarly journals Mathematical modeling for optimizing the blood supply chain network

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Amir Rahimzadeh Dehaghani ◽  
Muhammad Nawaz ◽  
Rohullah Sultanie ◽  
Tawiah Kwatekwei Quartey-Papafio
Keyword(s):  
Supply Chain ◽  
Blood Supply ◽  
Supply Chain Network ◽  
Distribution Centers ◽  
Nsga Ii ◽  
Content Type ◽  
Supply Chain Networks ◽  
Multi Objective ◽  
Blood Supply Chain ◽  
The Cost

PurposeThis research studies a location-allocation problem considering the m/m/m/k queue model in the blood supply chain network. This supply chain includes three levels of suppliers or donors, main blood centers (laboratories for separation, storage and distribution centers) and demand centers (hospitals and private clinics). Moreover, the proposed model is a multi-objective model including minimizing the total cost of the blood supply chain (the cost of unmet demand and inventory spoilage, the cost of transport between collection centers and the main centers of blood), minimizing the waiting time of donors in blood donating mobile centers, and minimizing the establishment of mobile centers in potential places.Design/methodology/approachSince the problem is multi-objective and NP-Hard, the heuristic algorithm NSGA-II is proposed for Pareto solutions and then the estimation of the parameters of the algorithm is described using the design of experiments. According to the review of the previous research, there are a few pieces of research in the blood supply chain in the field of design queue models and there were few works that tried to use these concepts for designing the blood supply chain networks. Also, in former research, the uncertainty in the number of donors, and also the importance of blood donors has not been considered.FindingsA novel mathematical model guided by the theory of linear programming has been proposed that can help health-care administrators in optimizing the blood supply chain networks.Originality/valueBy building upon solid literature and theory, the current study proposes a novel model for improving the supply chain of blood.

scholarly journals Multi-Objective Pharmaceutical Portfolio Optimization under Uncertainty of Cost and Return

Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2339
Author(s):  
Mahboubeh Farid ◽  
Hampus Hallman ◽  
Mikael Palmblad ◽  
Johannes Vänngård
Keyword(s):  
Portfolio Optimization ◽  
Decision Makers ◽  
Optimization Under Uncertainty ◽  
Product Development Process ◽  
Multi Objective ◽  
Probability Of Success ◽  
Low Probability ◽  
Key Aspects ◽  
The Cost ◽  
Selection Of

This paper presents the study of multi-objective optimization of a pharmaceutical portfolio when both cost and return values are uncertain. Decision makers in the pharmaceutical industry encounter several challenges in deciding the optimal selection of drug projects for their portfolio since they have to consider several key aspects such as a long product-development process split into multiple phases, high cost and low probability of success. Additionally, the optimization often involves more than a single objective (goal) with a non-deterministic nature. The aim of the study is to develop a stochastic multi-objective approach in the frame of chance-constrained goal programming. The application of the results of this study allows pharmaceutical decision makers to handle two goals simultaneously, where one objective is to achieve a target return and another is to keep the cost within a finite annual budget. Finally, the numerical results for portfolio optimization are presented and discussed.

Sign in / Sign up

Export Citation Format

Share Document