A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector

This paper deals with “The Enchanted Journey,” which is a daily event tour booked by Bollywood-film fans. During the tour, the participants visit original sites of famous Bollywood films at various locations in Switzerland; moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour. For operational reasons, however, two or more buses cannot stay at the same location simultaneously. Further operative constraints include time windows for all activities and precedence constraints between some activities. The planning problem is how to compute a feasible schedule for each bus. We implement a two-step hierarchical approach. In the first step, we minimize the total waiting time; in the second step, we minimize the total travel time of all buses. We present a basic formulation of this problem as a mixed-integer linear program. We enhance this basic formulation by symmetry-breaking constraints, which reduces the search space without loss of generality. We report on computational results obtained with the Gurobi Solver. Our numerical results show that all relevant problem instances can be solved using the basic formulation within reasonable CPU time, and that the symmetry-breaking constraints reduce that CPU time considerably.

Serial or Parallel Linear-Assisted Switching Converter as Envelope Amplifier: Optimization and Comparison

This paper presents a theoretical analysis and an optimization method for envelope amplifier. Highly efficient envelope amplifiers based on a switching converter in parallel or series with a linear regulator have been analyzed and optimized. The results of the optimization process have been shown and these two architectures are compared regarding their complexity and efficiency. The optimization method that is proposed is based on the previous knowledge about the transmitted signal type (OFDM, WCDMA...) and it can be applied to any signal type as long as the envelope probability distribution is known. Finally, it is shown that the analyzed architectures have an inherent efficiency limit.

On stable uniqueness in linear semi-infinite optimization

This paper is intended to provide conditions for the stability of the strong uniqueness of the optimal solution of a given linear semi-infinite optimization (LSIO) problem, in the sense of maintaining the strong uniqueness property under sufficiently small perturbations of all the data. We consider LSIO problems such that the family of gradients of all the constraints is unbounded, extending earlier results of Nürnberger for continuous LSIO problems, and of Helbig and Todorov for LSIO problems with bounded set of gradients. To do this we characterize the absolutely (affinely) stable problems, i.e., those LSIO problems whose feasible set (its affine hull, respectively) remains constant under sufficiently small perturbations.

Constraint qualifications in linear vector semi-infinite optimization

Linear vector semi-infinite optimization deals with the simultaneous minimization of finitely many linear scalar functions subject to infinitely many linear constraints. This paper provides characterizations of the weakly efficient, efficient, properly efficient and strongly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The global constraint qualifications are illustrated on a collection of selected applications.

Stability in Linear Optimization Under Perturbations of the Left-Hand Side Coefficients

This paper studies stability properties of linear optimization problems with finitely many variables and an arbitrary number of constraints, when only left hand side coefficients can be perturbed. The coefficients of the constraints are assumed to be continuous functions with respect to an index which ranges on certain compact Hausdorff topological space, and these properties are preserved by the admissible perturbations. More in detail, the paper analyzes the continuity properties of the feasible set, the optimal set and the optimal value, as well as the preservation of desirable properties (boundedness, uniqueness) of the feasible and of the optimal sets, under sufficiently small perturbations.

Optimization of a 42.7 Gb/s wavelength tunable RZ transmitter using a linear spectrogram technique

The optimization of a wavelength tunable RZ transmitter, consisting of an electro-absorption modulator and a SG DBR tunable laser, is carried out using a linear spectrogram based characterization and leads to 1500 km transmission at 42.7 Gb/s independent of the operating wavelength. We demonstrate that, to ensure optimum and consistent transmission performance over a portion of the C-band, the RF drive and bias conditions of the EAM must be varied at each wavelength. The sign and magnitude of the pulse chirp (characterized using the linear spectrographic technique) is therefore tailored to suit the dispersion map of the transmission link. Results achieved show that by optimizing the drive and DC bias applied to the EAM, consistent transmission performance can be achieved over a wide wavelength range. Failure to optimize the EAM drive conditions at each wavelength can lead to serious degradation in system performance.

An Interactive Method of Linear Mixed Integer Multicriteria Optimization

The paper describes a learning-oriented interactive method for solving linear mixed integer problems of multicriteria optimization. The method increases the possibilities of the decision maker (DM) to describe his/her local preferences and at the same time it overcomes some computational difficulties, especially in problems of large dimension. The method is realized in an experimental decision support system for finding the solution of linear mixed integer multicriteria optimization problems.

Optimization Problem in a Class of Linear System. Application to Multiple Drug Administration

2000 Mathematics Subject Classification: 62H15, 62P10.

A non-linear discrete stochastic optimization model for Advanced Access patient appointment scheduling

Access to healthcare is a major problem in which patients are deprived of receiving timely admission to healthcare. Poor access has resulted in significant but avoidable healthcare cost, poor quality of healthcare, and deterioration in the general public health. Advanced Access is a simple and direct approach to appointment scheduling in which the majority of a clinic's appointments slots are kept open in order to provide access for immediate or same day healthcare needs and therefore, alleviate the problem of poor access the healthcare. This research formulates a non-linear discrete stochastic mathematical model of the Advanced Access appointment scheduling policy. The model objective is to maximize the expected profit of the clinic subject to constraints on minimum access to healthcare provided. Patient behavior is characterized with probabilities for no-show, balking, and related patient choices. Structural properties of the model are analyzed to determine whether Advanced Access patient scheduling is feasible. To solve the complex combinatorial optimization problem, a heuristic that combines greedy construction algorithm and neighborhood improvement search was developed. The model and the heuristic were used to evaluate the Advanced Access patient appointment policy compared to existing policies. Trade-off between profit and access to healthcare are established, and parameter analysis of input parameters was performed. The trade-off curve is a characteristic curve and was observed to be concave. This implies that there exists an access level at which at which the clinic can be operated at optimal profit that can be realized. The results also show that, in many scenarios by switching from existing scheduling policy to Advanced Access policy clinics can improve access without any decrease in profit. Further, the success of Advanced Access policy in providing improved access and/or profit depends on the expected value of demand, variation in demand, and the ratio of demand for same day and advanced appointments. The contributions of the dissertation are a model of Advanced Access patient scheduling, a heuristic to solve the model, and the use of the model to understand the scheduling policy trade-offs which healthcare clinic managers must make. ^

RISK-BASED MULTIOBJECTIVE PATH PLANNING AND DESIGN OPTIMIZATION FOR UNMANNED AERIAL VEHICLES

Safe operation of unmanned aerial vehicles (UAVs) over populated areas requires reducing the risk posed by a UAV if it crashed during its operation. We considered several types of UAV risk-based path planning problems and developed techniques for estimating the risk to third parties on the ground. The path planning problem requires making trade-offs between risk and flight time. Four optimization approaches for solving the problem were tested; a network-based approach that used a greedy algorithm to improve the original solution generated the best solutions with the least computational effort. Additionally, an approach for solving a combined design and path planning problems was developed and tested. This approach was extended to solve robust risk-based path planning problem in which uncertainty about wind conditions would affect the risk posed by a UAV.

POSITIVE FILTERED P_N METHOD FOR LINEAR TRANSPORT EQUATIONS AND THE ASSOCIATED OPTIMIZATION ALGORITHM

We propose a positive, accurate moment closure for linear kinetic transport equations based on a filtered spherical harmonic (FP_N) expansion in the angular variable. The FP_N moment equations are accurate approximations to linear kinetic equations, but they are known to suffer from the occurrence of unphysical, negative particle concentrations. The new positive filtered P_N (FP_N+) closure is developed to address this issue. The FP_N+ closure approximates the kinetic distribution by a spherical harmonic expansion that is non-negative on a finite, predetermined set of quadrature points. With an appropriate numerical PDE solver, the FP_N+ closure generates particle concentrations that are guaranteed to be non-negative. Under an additional, mild regularity assumption, we prove that as the moment order tends to infinity, the FP_N+ approximation converges, in the L2 sense, at the same rate as the FP_N approximation; numerical tests suggest that this assumption may not be necessary. By numerical experiments on the challenging line source benchmark problem, we confirm that the FP_N+ method indeed produces accurate and non-negative solutions. To apply the FP_N+ closure on problems at large temporal-spatial scales, we develop a positive asymptotic preserving (AP) numerical PDE solver. We prove that the propose AP scheme maintains stability and accuracy with standard mesh sizes at large temporal-spatial scales, while, for generic numerical schemes, excessive refinements on temporal-spatial meshes are required. We also show that the proposed scheme preserves positivity of the particle concentration, under some time step restriction. Numerical results confirm that the proposed AP scheme is capable for solving linear transport equations at large temporal-spatial scales, for which a generic scheme could fail. Constrained optimization problems are involved in the formulation of the FP_N+ closure to enforce non-negativity of the FP_N+ approximation on the set of quadrature points. These optimization problems can be written as strictly convex quadratic programs (CQPs) with a large number of inequality constraints. To efficiently solve the CQPs, we propose a constraint-reduced variant of a Mehrotra-predictor-corrector algorithm, with a novel constraint selection rule. We prove that, under appropriate assumptions, the proposed optimization algorithm converges globally to the solution at a locally q-quadratic rate. We test the algorithm on randomly generated problems, and the numerical results indicate that the combination of the proposed algorithm and the constraint selection rule outperforms other compared constraint-reduced algorithms, especially for problems with many more inequality constraints than variables.

Modelo de programação linear para otimização econômica do projeto de irrigação Baixo Acaraú - CE

The present work had as objective uses a model of lineal programming algorithm to optimize the use of the water in the District of Irrigation Baixo Acarau-CE proposing the best combination of crop types and areas established of 8,0 ha. The model aim maximize the net benefit of small farmer, incorporating the constraints in water and land availability, and constraints on the market. Considering crop types and the constraints, the study lead to the following conclusions: 1. The water availability in the District was not a limiting resources, while all available land was assigned in six of the seven cultivation plans analyzed. Furthermore, water availability was a restrictive factor as compared with land only when its availability was made to reduce to 60% of its actual value; 2. The combination of soursop and melon plants was the one that presented the largest net benefit, corresponding to R$ 5,250.00/ha/yr. The planting area for each crop made up to 50% of the area of the plot; 3. The plan that suggests the substitution of the cultivation of the soursop, since a decrease in annual net revenue of 5.87%. However, the plan that contemplates the simultaneous substitution of both soursop and melon produced the lowest liquid revenue, with reduction of 33.8%.

Exercise intensity optimization for men with high cardiorespiratory fitness

Exercise intensity is a key parameter for exercise prescription but the optimal range for individuals with high cardiorespiratory fitness is unknown. The aims of this study were (1) to determine optimal heart rate ranges for men with high cardiorespiratory fitness based on percentages of maximal oxygen consumption (%VO(2max)) and reserve oxygen consumption (%VO(2reserve)) corresponding to the ventilatory threshold and respiratory compensation point, and ( 2) to verify the effect of advancing age on the exercise intensities. Maximal cardiorespiratory testing was performed on 210 trained men. Linear regression equations were calculated using paired data points between percentage of maximal heart rate (%HR(max)) and %VO(2max) and between percentage of heart rate reserve (%HRR) and %VO(2reserve) attained at each minute during the test. Values of %VO(2max) and %VO(2reserve) at the ventilatory threshold and respiratory compensation point were used to calculate the corresponding values of %HRmax and %HRR, respectively. The ranges of exercise intensity in relation to the ventilatory threshold and respiratory compensation point were achieved at 78-93% of HR(max) and 70-93% of HRR, respectively. Although absolute heart rate decreased with advancing age, there were no age-related differences in %HR(max) and %HRR at the ventilatory thresholds. Thus, in men with high cardiorespiratory fitness, the ranges of exercise intensity based on %HR(max) and %HRR regarding ventilatory threshold were 78-93% and 70-93% respectively, and were not influenced by advancing age.