„ Variable Neighborhood Search for the Static Aircraft Sequencing Problem
نویسندگان
چکیده
Ich erkläre an Eides statt, daß ich die vorliegende Arbeit selbständig und ohne fremde Hilfe verfasst, andere als die angegebenen Quellen nicht benützt und die den benutzten Quellen wörtlich oder inhaltlich entnommenen Stellen als solche kenntlich gemacht habe.
منابع مشابه
A Variable Neighborhood Search approach for the aircraft conflict resolution problem
A metaheuristic approach based on Variable Neighborhood Search to tackle the enroute aircraft conflict resolution problem is presented. The three maneuvers (velocity, heading angle and altitude level variations) are allowed to be performed. Based on geometric rules, we can determine if a conflict situation occurs between each pair of aircraft under consideration. As three different maneuvers co...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملMathematical Model and Algorithm for sequencing operations in the machine building industry
In this paper, the problem of sequencing machines in the final assembly line with regard to the supply of parts has been investigated. For this reason, a basic integer linear programming model has been developed and based on this, the problem-solving algorithm is developed in accordance with the reaction-based approach based on the renewal of the sequence of operations. Also, due to the Np-hard...
متن کاملLot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کامل