Modification Goal Programming for Solving Multi-Objective De Novo Programming Problems
Abstract
No abstract recorded for this item.
Similar items
Non-linear Goal Programming Using Multi-Objective Genetic Algorithms
Goal programming is a technique often used in engineering design activities primarily to find a compromised solution which will simultaneously satisfy a number of design goals. In solving goal programming problems, classical methods reduce the multiple goal-attainment problem int
Solving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a m
A Decision Support System for Solving Multi-Objective Redundancy Allocation Problems
The Redundancy Allocation Problem (RAP) is a reliability optimization problem in designing series-parallel systems. The reliability optimization process is intended to select multiple components with appropriate levels of redundancy by maximizing the system reliability under some
Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods
This paper presents the investigation of an evolutionary multi-objective simulated annealing algorithm with variable neighborhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive ex
Solving Multi-Objective Network Flow Problems with an Interior Point Method*
In this paper we present a primal-dual interior-point algorithm to solve a class of multi-objective network flow problems. More precisely, our algorithm is an extension of the single-objective primal-dual infeasible and inexact interior point method for multi-objective linear net
Solving Multi-Objective Resource Allocation Problem Using Multi-Objective Binary Artificial Bee Colony Algorithm
Resource allocation is the optimal distribution in a limited number of resources available for certain activities. The large activities requires exponentially multiplying computation cost. Therefore, resource problem known as NP-Hard literature. In this study, multi-objective bin