In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport. This is one deciding a landing time for each plane such that lands within predetermined window and separation criteria between all successive planes are respected. We present mixed-integer zero–one formulation single runway case extend it to multiple case. strengthen linear programming relaxations these formulations by introducing additional constraints. Throughout, discuss how our can be used model...

Hub networks play an important role in many transportation and telecommunications systems. This paper introduces a new model called the hub arc location model. Rather than locate discrete facilities, this locates arcs, which have reduced unit flow costs. Four special cases of general are examined detail. We provide motivation for models, present examples optimal solutions, using data U.S. air passenger traffic. Results used to compare costs, locations, locations with corresponding median...

The problem of locating hub facilities arises in the design transportation and telecommunications networks. p-hub median belongs to a class discrete location-allocation problems which all hubs are fully interconnected. Nonhub nodes may be either uniquely or multiply allocated hubs. uncapacitated total number hubs, p is specified priori. We describe novel exact-solution approach for solving multiple-allocation case show how similar method can adapted more difficult single-allocation case....

A companion paper (Campbell et al. 2005) introduces new hub arc location models and analyzes optimal solutions, with special attention to spatial pattens relationships. This provides integer programming formulations solution algorithms for these problems. We describe two approaches in detail compare their performance, using standard data sets. present implementation details show how can be fine tuned based on characteristics of the data.

After more than a decade of research, there now exist several neural-network techniques for solving NP-hard combinatorial optimization problems. Hopfield networks and self-organizing maps are the two main categories into which most approaches can be divided. Criticism these includes tendency network to produce infeasible solutions, lack generalizability (being only applicable Euclidean problems). This paper proposes new have overcome pitfalls: enables feasibility solutions ensured improved...

The problem of scheduling aircraft landings on one or more runways is an interesting that similar to a machine job with sequence-dependent processing times and earliness tardiness penalties. aim optimally land set planes several in such way separation criteria between all pairs (not just successive ones) are satisfied. Each plane has allowable time window as well target time. There costs associated landing either earlier later than this In paper, we present specialized simplex algorithm...

In modern cloud-native applications, managing communication across multiple Kubernetes clusters can be complex. Service meshes, such as Istio, Linkerd, Kuma, and Consul, help address challenges like service discovery, traffic routing, security, observability in multi-cluster environments. This study compares these leading meshes based on scalability, ease of use, performance, operational complexity. Istio excels scalability advanced management, making it ideal for large-scale, complex...