scholarly journals Study on coloring method of airport flight-gate allocation problem

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Hongyan Li ◽  
Xianfeng Ding ◽  
Jiang Lin ◽  
Jingyu Zhou
Keyword(s):  
Graph Coloring ◽  
Programming Model ◽  
Weight Vector ◽  
Multi Objective ◽  
Average Value ◽  
Two Factors ◽  
Minimum Number ◽  
First Come First Serve ◽  
Airport Terminals ◽  
Single Objective

Abstract With the development of economy, more and more people travel by plane. Many airports have added satellite halls to relieve the pressure of insufficient boarding gates in airport terminals. However, the addition of satellite halls will have a certain impact on connecting flights of transit passengers and increase the difficulty of reasonable allocation of flight and gate in airports. Based on the requirements and data of question F of the 2018 postgraduate mathematical contest in modeling, this paper studies the flight-gate allocation of additional satellite halls at airports. Firstly, match the seven types of flights with the ten types of gates. Secondly, considering the number of gates used and the least number of flights not allocated to the gate, and adding the two factors of the overall tension of passengers and the minimum number of passengers who failed to transfer, the multi-objective 0–1 programming model was established. Determine the weight vector $w=(0.112,0.097,0.496,0.395)$ w = ( 0.112 , 0.097 , 0.496 , 0.395 ) of objective function by entropy value method based on personal preference, then the multi-objective 0–1 programming model is transformed into single-objective 0–1 programming model. Finally, a graph coloring algorithm based on parameter adjustment is used to solve the transformed model. The concept of time slice was used to determine the set of time conflicts of flight slots, and the vertex sequences were colored by applying the principle of “first come first serve”. Applying the model and algorithm proposed in this paper, it can be obtained that the average value of the overall tension degree of passengers minimized in question F is 35.179%, the number of flights successfully allocated to the gate maximized is 262, and the number of gates used is minimized to be 60. The corresponding flight-gate difficulty allocation weight is $\alpha =0.32$ α = 0.32 and $\beta =0.40$ β = 0.40 , and the proportion of flights successfully assigned to the gate is 86.469%. The number of passengers who failed to transfer was 642, with a failure rate of 23.337%.

Multi-Objective Pricing Optimization for a High-Speed Rail Network Under Competition

2019 ◽  
Vol 2673 (7) ◽  
pp. 215-226 ◽  
Author(s):  
Huizhuo Cao ◽  
Xuemei Li ◽  
Vikrant Vaze ◽  
Xueyan Li
Keyword(s):  
High Speed ◽  
Programming Model ◽  
Pareto Frontier ◽  
Multiple Objectives ◽  
Multi Objective Optimization ◽  
High Speed Rail ◽  
Multi Objective ◽  
Trade Offs ◽  
Conflicting Objectives ◽  
Single Objective

Multi-objective pricing of high-speed rail (HSR) passenger fares becomes a challenge when the HSR operator needs to deal with multiple conflicting objectives. Although many studies have tackled the challenge of calculating the optimal fares over railway networks, none of them focused on characterizing the trade-offs between multiple objectives under multi-modal competition. We formulate the multi-objective HSR fare optimization problem over a linear network by introducing the epsilon-constraint method within a bi-level programming model and develop an iterative algorithm to solve this model. This is the first HSR pricing study to use an epsilon-constraint methodology. We obtain two single-objective solutions and four multi-objective solutions and compare them on a variety of metrics. We also derive the Pareto frontier between the objectives of profit and passenger welfare to enable the operator to choose the best trade-off. Our results based on computational experiments with Beijing–Shanghai regional network provide several new insights. First, we find that small changes in fares can lead to a significant improvement in passenger welfare with no reduction in profitability under multi-objective optimization. Second, multi-objective optimization solutions show considerable improvements over the single-objective optimization solutions. Third, Pareto frontier enables decision-makers to make more informed decisions about choosing the best trade-offs. Overall, the explicit modeling of multiple objectives leads to better pricing solutions, which have the potential to guide pricing decisions for the HSR operators.

scholarly journals Multiobjective Interaction Programming Problem with Interaction Constraint for Two Players

2012 ◽  
Vol 2012 ◽  
pp. 1-14
Author(s):  
Min Jiang ◽  
Zhiqing Meng ◽  
Xinsheng Xu ◽  
Rui Shen ◽  
Gengui Zhou
Keyword(s):  
Mathematical Programming ◽  
Programming Problem ◽  
Programming Model ◽  
Weight Vector ◽  
Mathematical Programming Problem ◽  
Pricing Model ◽  
Multi Objective ◽  
Joint Solution ◽  
Joint Pricing ◽  
Better Than

This paper extends an existing cooperative multi-objective interaction programming problem with interaction constraint for two players (or two agents). First, we define ans-optimal joint solution with weight vector to multi-objective interaction programming problem with interaction constraint for two players and get some properties of it. It is proved that thes-optimal joint solution with weight vector to the multi-objective interaction programming problem can be obtained by solving a corresponding mathematical programming problem. Then, we define anothers-optimal joint solution with weight value to multi-objective interaction programming problem with interaction constraint for two players and get some of its properties. It is proved that thes-optimal joint solution with weight vector to multi-objective interaction programming problem can be obtained by solving a corresponding mathematical programming problem. Finally, we build a pricing multi-objective interaction programming model for a bi-level supply chain. Numerical results show that the interaction programming pricing model is better than Stackelberg pricing model and the joint pricing model.

scholarly journals An Adaptive Evolutionary Multi-Objective Approach Based on Simulated Annealing

2011 ◽  
Vol 19 (4) ◽  
pp. 561-595 ◽  
Author(s):  
H. Li ◽  
D. Landa-Silva
Keyword(s):  
Simulated Annealing ◽  
Optimization Problem ◽  
Weight Vector ◽  
Metaheuristic Algorithms ◽  
Search Performance ◽  
Multi Objective Optimization ◽  
Search Technique ◽  
Multi Objective ◽  
Initial Setting ◽  
Single Objective

A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA/D is an evolutionary multi-objective optimization (EMO) algorithm that attempts to optimize multiple subproblems simultaneously by evolving a population of solutions. However, the performance of MOEA/D highly depends on the initial setting and diversity of the weight vectors. In this paper, we present an improved version of MOEA/D, called EMOSA, which incorporates an advanced local search technique (simulated annealing) and adapts the search directions (weight vectors) corresponding to various subproblems. In EMOSA, the weight vector of each subproblem is adaptively modified at the lowest temperature in order to diversify the search toward the unexplored parts of the Pareto-optimal front. Our computational results show that EMOSA outperforms six other well established multi-objective metaheuristic algorithms on both the (constrained) multi-objective knapsack problem and the (unconstrained) multi-objective traveling salesman problem. Moreover, the effects of the main algorithmic components and parameter sensitivities on the search performance of EMOSA are experimentally investigated.

Multi-objective TMA management optimization using the point merge system

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Ramazan Kursat Cecen
Keyword(s):  
Mathematical Model ◽  
Mixed Integer ◽  
Optimization Approach ◽  
Multi Objective Optimization ◽  
Content Type ◽  
Multi Objective ◽  
First Come First Serve ◽  
Management Optimization ◽  
The Mathematical Model ◽  
Single Objective

Purpose The purpose of this study is to provide conflict-free operations in terminal manoeuvre areas (TMA) using the point merge system (PMS), airspeed reduction (ASR) and ground holding (GH) techniques. The objective is to minimize both total aircraft delay (TD) and the total number of the conflict resolution manoeuvres (CRM). Design/methodology/approach The mixed integer linear programming (MILP) is used for both single and multi-objective optimization approaches to solve aircraft sequencing and scheduling problem (ASSP). Compromise programming and ε-constraint methods were included in the methodology. The results of the single objective optimization approach results were compared with baseline results, which were obtained using the first come first serve approach, in terms of the total number of the CRM, TD, the number of aircraft using PMS manoeuvres, ASR manoeuvres, GH manoeuvres, departure time updates and on-time performance. Findings The proposed single-objective optimization approach reduced both the CRM and TD considerably. For the traffic flow rates of 15, 20 and 25 aircraft, the improvement of CRM was 53.08%, 41.12% and 32.6%, the enhancement of TD was 54.2%, 48.8% and 31.06% and the average number of Pareto-optimal solutions were 1.26, 2.22 and 3.87, respectively. The multi-objective optimization approach also exposed the relationship between the TD and the total number of CRM. Practical implications The proposed mathematical model can be implemented considering the objectives of air traffic controllers (ATCOs) and airlines operators. Also, the mathematical model is able to create conflict-free TMA operations and, therefore, it brings an opportunity for ATCOs to reduce frequency occupancy time. Originality/value The mathematical model presents the total number of CRM as an objective function in the ASSP using the MILP approach. The mathematical model integrates ATCOs’ and airline operators’ perspective together with new objective functions.

scholarly journals Rank-Based Solution Methods and their Applications in Determination of Non-Dominated Points Set For A Multi-Objective Integer Programming Model

2020 ◽  
Vol 5 (6) ◽  
pp. 1249-1269
Author(s):  
Ali Al-Hasani ◽  
Masar Al-Rabeeah ◽  
Santosh Kumar ◽  
Andrew Eberhard
Keyword(s):  
Integer Programming ◽  
Mathematical Programming ◽  
Programming Model ◽  
Optimal Solution ◽  
Optimal Solutions ◽  
Mathematical Programming Model ◽  
Integer Programming Model ◽  
Multi Objective ◽  
Solution Methods ◽  
Single Objective

For any single-objective mathematical programming model, rank-based optimal solutions are computationally difficult to find compared to an optimal solution to the same single-objective mathematical programming model. In this paper, several methods have been presented to find these rank-based optimal solutions and based on them a new rank-based solution method (RBSM) is outlined to identify non-dominated points set of a multi-objective integer programming model. Each method is illustrated by a numerical example, and for each approach, we have discussed its limitations, advantages and computational complexity.

A two-sided matching decision-making approach based on regret theory under intuitionistic fuzzy environment

2021 ◽  
pp. 1-18
Author(s):  
Xiang Jia ◽  
Xinfan Wang ◽  
Yuanfang Zhu ◽  
Lang Zhou ◽  
Huan Zhou
Keyword(s):  
Decision Making ◽  
Hamming Distance ◽  
Optimal Solution ◽  
Intuitionistic Fuzzy Sets ◽  
Regret Theory ◽  
Multi Objective ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Environment ◽  
Objective Model ◽  
Single Objective

This study proposes a two-sided matching decision-making (TSMDM) approach by combining the regret theory under the intuitionistic fuzzy environment. At first, according to the Hamming distance of intuitionistic fuzzy sets and regret theory, superior and inferior flows are defined to describe the comparative preference of subjects. Hereafter, the satisfaction degrees are obtained by integrating the superior and inferior flows of the subjects. The comprehensive satisfaction degrees are calculated by aggregating the satisfaction degrees, based on which, a multi-objective TSMDM model is built. Furthermore, the multi-objective TSMDM model is converted to a single-objective model, the optimal solution of the latter is derived. Finally, an illustrative example and several analyses are provided to verify the feasibility and the effectiveness of the proposed approach.

scholarly journals Healthcare Facility Location-Allocation Optimization for China’s Developing Cities Utilizing a Multi-Objective Decision Support Approach

2018 ◽  
Vol 10 (12) ◽  
pp. 4580 ◽  
Author(s):  
Li Wang ◽  
Huan Shi ◽  
Lu Gan
Keyword(s):  
Heuristic Algorithms ◽  
Programming Model ◽  
Rapid Development ◽  
Supply And Demand ◽  
Healthcare Facility ◽  
Allocation Model ◽  
Location Allocation ◽  
Multi Objective ◽  
Conflicting Objectives ◽  
Allocation Problems

With rapid development of the healthcare network, the location-allocation problems of public facilities under increased integration and aggregation needs have been widely researched in China’s developing cites. Since strategic formulation involves multiple conflicting objectives and stakeholders, this paper presents a practicable hierarchical location-allocation model from the perspective of supply and demand to characterize the trade-off between social, economical and environmental factors. Due to the difficulties of rationally describing and the efficient calculation of location-allocation problems as a typical Non-deterministic Polynomial-Hard (NP-hard) problem with uncertainty, there are three crucial challenges for this study: (1) combining continuous location model with discrete potential positions; (2) introducing reasonable multiple conflicting objectives; (3) adapting and modifying appropriate meta-heuristic algorithms. First, we set up a hierarchical programming model, which incorporates four objective functions based on the actual backgrounds. Second, a bi-level multi-objective particle swarm optimization (BLMOPSO) algorithm is designed to deal with the binary location decision and capacity adjustment simultaneously. Finally, a realistic case study contains sixteen patient points with maximum of six open treatment units is tested to validate the availability and applicability of the whole approach. The results demonstrate that the proposed model is suitable to be applied as an extensive planning tool for decision makers (DMs) to generate policies and strategies in healthcare and design other facility projects.

Sign in / Sign up

Export Citation Format

Share Document