An interactive approach for multiobjective decision making

We develop an interactive approach for multiobjective decision-making problems, where the solution space is defined by a set of constraints. We first reduce the solution space by eliminating some undesirable regions. We generate solutions (partition ideals) that dominate portions of the efficient frontier and the decision maker (DM) compares these with feasible solutions. Whenever the decision maker prefers a feasible solution, we eliminate the region dominated by the partition ideal. We then employ an interactive search method on the reduced solution space to help the DM further converge toward a highly preferred solution. We demonstrate our approach and discuss some variations.     

A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage

In this study, we present a bi-objective facility location model that considers both partial coverage and service to uncovered demands. Due to limited number of facilities to be opened, some of the demand nodes may not be within full or partial coverage distance of a facility. However, a demand node that is not within the coverage distance of a facility should get service from the nearest facility within the shortest possible time. In this model, it is assumed that demand nodes within the predefined distance of opened facilities are fully covered, and after that distance the coverage level decreases linearly. The objectives are defined as the maximization of full and partial coverage, and the minimization of the maximum distance between uncovered demand nodes and their nearest facilities. We develop a new multi-objective genetic algorithm (MOGA) called modified SPEA-II (mSPEA-II). In this method, the fitness function of SPEA-II is modified and the crowding distance of NSGA-II is used. The performance of mSPEA-II is tested on randomly generated problems of different sizes. The results are compared with the solutions of the most well-known MOGAs, NSGA-II and SPEA-II. Computational experiments show that mSPEA-II outperforms both NSGA-II and SPEA-II.     

A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine

In this paper, we apply a simulated annealing approach to two bicriteria scheduling problems on a single machine. The first problem is the strongly NP-hard problem of minimizing total flowtime and maximum earliness. The second one is the NP-hard problem of minimizing total flowtime and number of tardy jobs. We experiment on different neighbourhood structures as well as other parameters of the simulated annealing approach to improve its performance. Our computational experiments show that the developed approach yields solutions that are very close to lower bounds and hence very close to the optimal solutions of their corresponding problems for the minimization of total flowtime and maximum earliness. For the minimization of total flowtime and number tardy, our experiments show that the simulated annealing approach yields results that are superior to randomly generated schedules.     

Interactive outranking approaches for multicriteria decision-making problems with imprecise information

PROMETHEE is a powerful method, which can solve many multiple criteria decision making (MCDM) problems. It involves sophisticated preference modelling techniques but requires too much a priori precise information about parameter values (such as criterion weights and thresholds). In this paper, we consider a MCDM problem where alternatives are evaluated on several conflicting criteria, and the criterion weights and/or thresholds are imprecise or unknown to the decision maker (DM). We build robust outranking relations among the alternatives in order to help the DM to rank the alternatives and select the best alternative. We propose interactive approaches based on PROMETHEE method. We develop a decision aid tool called INTOUR, which implements the developed approaches.     

A Novel Molecule: 1-(2,6 Dichlorobenzyl)-4-(2-(2-4-hydroxybenzylidene)hydrazinyl)pyridinium Chloride and its Interaction with DNA

Herein, a novel pyridine derivative, 1-(2,6 dichlorobenzyl)-4-(2-(2-4-hydroxybenzylidene)hydrazinyl)-pyridinium chloride (DHPC), was synthesized as a candidate drug molecule. Interaction of DHPC with DNA was used to explore its effect on DNA via Differential Pulse Voltammetry, Cyclic Voltammetry, and Electrochemical Impedance Spectroscopy. We demonstrated that oxidation signal of guanine bases of DNA decreased significantly while that of DHPC increased after its interaction with one another. Our candidate drug molecule exhibits LOD and LOQ, e.g., 1.5 μg/mL and 4.9 μg/mL, respectively. Toxicity effect value for DHPC (S%) was calculated as %31, demonstrating the candidate drug molecule's toxic effect on DNA.     

New spectrofluorimetric method for the determination of nizatidine in bulk form and in pharmaceutical preparations

Optics and Spectroscopy - A simple, accurate and highly sensitive spectrofluorimetric method has been developed for determination of nizatidine in pure form and in pharmaceutical dosage forms. The...     

An interactive solution approach for a bi-objective semi-desirable location problem

In this study, we consider a semi-desirable facility location problem in a continuous planar region considering the interaction between the facility and the existing demand points. A facility can be defined as semi-desirable if it has both undesirable and desirable effects to the people living in the vicinity. Our aim is to maximize the weighted distance of the facility from the closest demand point as well as to minimize the service cost of the facility. The distance between the facility and the demand points is measured with the rectilinear metric. For the solution of the problem, a three-phase interactive geometrical branch and bound algorithm is suggested to find the most preferred efficient solution. In the first two phases, we aim to eliminate the parts of the feasible region the inefficiency of which can be proved. The third phase has been suggested for an interactive search in the remaining regions with the involvement of a decision maker (DM). In the third phase, the DM is given the opportunity to use either an exact or an approximate procedure to carry out the search. The exact procedure is based on the reference point approach and guarantees to find an efficient point as the most preferred solution. On the other hand, in the approximate procedure, a hybrid methodology is used to increase the efficiency of the reference point approach. The approximate procedure can be used when the DM prefers to see locally efficient solutions so as to save computation time. We demonstrate the performance of the proposed method through example problems.     

Electrochemical Characteristics of a Novel Pyridinium Salt as a Candidate Drug Molecule and Its Interaction with DNA

In this article, for the first time, the electrochemical properties of a novel pyridine derivative, 4‐(2‐(2‐hydroxybenzylidene) hydrazinyl)‐1‐(3‐phenylpropyl) pyridinium bromide (abbreviated as 4‐Pyri), and its interaction with double stranded DNA (dsDNA) was investigated. The interaction between candidate drug molecule (4‐Pyri) and dsDNA was analyzed by examining 4‐Pyri (+0.6 V and +0.8 V) and guanine (+1.0 V) oxidation signal changes with Differential Pulse Voltammetry (DPV) and Cyclic Voltammetry (CV). Electrochemical Impedance Spectroscopy (EIS) was used to show the resistance changes before and after the interaction between 4‐Pyri and dsDNA. We showed that after the interaction with 4‐Pyri, the oxidation currents of guanine decreased dramatically, whereas the intrinsic oxidation currents of 4‐Pyri dramatically increased. 4‐Pyri oxidation current differences before and after the interaction with dsDNA enabled us to determine such interaction separately from guanine oxidation signals. In addition, resistance differences were observed at before and after the interaction with each other that confirmed the possible interaction. In addition, toxicity effect (S%) value, which is an important parameter for electrochemical studies indicated 4‐Pyri's toxicity to dsDNA. Our results demonstrated that 4‐Pyri interacts with dsDNA, and could be used as a potential candidate drug molecule due to its remarkable impact on dsDNA.     

Spectrofluorimetric determination of nateglinide in pure and pharmaceutical preparations through derivatization with 4-chloro-7-nitrobenzo-2-oxa-1,3-diazole

A sensitive method was developed for the determination of nateglinide in pure and pharmaceutical preparations. The proposed method is based on the derivatization reaction between nateglinide and 4-chloro-7-nitrobenzo-2-oxa-1,3-diazole in borate buffer of pH 10. Fluorescent intensity of derivative was measured at 537 nm using an excitation wavelength of 464 nm. The described method was validated and the analytical parameters of linearity, limit of detection, limit of quantification, accuracy, precision (intra- and inter-day) and recovery were evaluated. The assay was linear over the concentration range of 50–500 ng/mL. The proposed method was applied to study of nateglinide in pure and pharmaceutical preparations.     

Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance

In this paper, we study the 1-maximin problem with rectilinear distance. We locate a single undesirable facility in a continuous planar region while considering the interaction between the facility and existing demand points. The distance between facility and demand points is measured in the rectilinear metric. The objective is to maximize the distance of the facility from the closest demand point. The 1-maximin problem has been formulated as an MIP model in the literature. We suggest new bounding schemes to increase the solution efficiency of the model as well as improved branch and bound strategies for implementation. Moreover, we simplify the model by eliminating some redundant integer variables. We propose an efficient solution algorithm called cut and prune method, which splits the feasible region into four equal subregions at each iteration and tries to eliminate subregions depending on the comparison of upper and lower bounds. When the sidelengths of the subregions are smaller than a predetermined value, the improved MIP model is solved to obtain the optimal solution. Computational experiments demonstrate that the solution time of the original MIP model is reduced substantially by the proposed solution approach.