Operational research project
One of the most significant challenges facing optimization models for the demand-side management (DSM) is obtaining feasible solutions in a shorter time. This method was reported in the literature and has been applied successfully to solve topological design problems in civil and mechanical engineering. The mathematical model developed to solve this problem is a combination of a gradient method with random perturbations, and a hybrid genetic algorithm. A continuous approach, however, provides more accurate results and reduces the data preparing effort. In a previous work (Novaes and Graciolli, European Journal of Operational Research, forthcoming) the region under analysis was represented by a rectangular grid structure. Each district is related to a characteristic function that takes into account distribution costs, time and capacity constraints, distribution effort, and shape considerations (district slenderness). Both vehicle time and vehicle load are treated probabilistically. The optimization model presented in this paper sets the district boundaries and seeks the best fleet of vehicles as to minimize total daily transport costs. Heracleous and Johnston (2009) illustrate using two case studies in Singapore that there are examples of public and not-for-profit or. Having established that there is a long tradition between religion and hospitality, the paper goes on to pose the question of whether it is possible to be 'hospitable' at the same time as being efficient and commercially successful. The paper discusses previous research conducted at the property and reported in academic journals (SD, 2002 Pun and Ho, 2001) and explores the historical links between religion and hospitality or hospitable-ness, including literature on the Rule of St Benedict (Morrison and O'Gorman, 2008). It was stimulated by the experiences of academic faculty members over almost a decade who stayed in the property being researched, the YMCA Salisbury hotel in Kowloon, Hong Kong. This paper is an investigation of the impact of an explicitly Christian culture and ethos on the operational management of a hospitality facility. Some of these networks are effective in solving this problem as shown in significant tests.The connectionist approach is compared with a standard Linear Programming (LP) procedure, and with a more recent hybrid LP technique.A performance summary and final comments show the usefulness of the neural network proposal. It depends just on the number of clauses and the number of variables, but not on the structure of the clauses.The structure of the integer program allows to solve it by means of standard linear programming techniques.Then we describe several connectionist network paradigms to solve the second optimization problem. The resulting matrix has a regular structure and is no longer problem-specific.
ABSTRACT Linear programming (LP) has sparked great interest among scientists due to its practical and theoretical importance.LP plays a special role in optimization theory: in one sense, it is a continuous optimization problem (first optimization problem) because the decision variables are real numbers, but it also may be considered a combinatorial optimization problem to identify an optimal basis containing certain columns from the constraint matrix (second optimization problem).As a case study, we describe a novel transformation from clausal form Conjunctive Normal Form Satisfaction problem (CNF-SAT) to an integer linear programming model.