• No results found

combinatorial optimization problem solution

The ‘Engaged’ Interaction: Important Considerations for the HCI Design and Development of a Web Application for Solving a Complex Combinatorial Optimization Problem

The ‘Engaged’ Interaction: Important Considerations for the HCI Design and Development of a Web Application for Solving a Complex Combinatorial Optimization Problem

... developer’s problem was centred on the user being able to specify the weights Wu,v by indicating whether pairs of guests (and their companions) should be (a) definitely apart, (b) preferably apart, (c) preferably ...

8

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

... Eventually, the TSP gained notoriety as the prototype of a hard problem in the combinatorial optimization. Nowadays as the vast field of artificial intelligence has thrived, many algorithms are ...

22

Automatic Class Timetable Generation using a Hybrid Genetic and Tabu Algorithm

Automatic Class Timetable Generation using a Hybrid Genetic and Tabu Algorithm

... of optimization problem to get near optimal or optimal solution to the problem [17] ...the combinatorial optimization problem of timetable ...

7

Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem

Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem

... Swarm Optimization (PSO) measurement process, every particle estimates the global ...the solution during the search ...numerical optimization problem. In order to solve discrete ...

8

Combinatorial optimization model for railway engine assignment problem

Combinatorial optimization model for railway engine assignment problem

... the solution of the problem with the original ...the problem with a minimum number of locomotives or minimizing the total energy consumption of the locomotives used in the assignment or minimizing ...

12

A Location Problem with the A-distance in a Competitive Environment

A Location Problem with the A-distance in a Competitive Environment

... optimal solution of the problem directly, we have shown that the CFLP can be reformulated as a combinatorial optimization prob- ...the combinatorial optimization problem ...

6

A Genetic Algorithm for Resource Contrained Project Scheduling Problem

A Genetic Algorithm for Resource Contrained Project Scheduling Problem

... solve combinatorial and hard optimization problem, It starts by generating an initial population of individual (solution) of some finite size, the individual are encoded by various ...

6

Tuned Simulated Annealing Based on Boltzmann and Bose-Einstein Distribution Applied to Maxsat Problem

Tuned Simulated Annealing Based on Boltzmann and Bose-Einstein Distribution Applied to Maxsat Problem

... the combinatorial optimization area by Kirkpatrick [15], and Cerny ...specific combinatorial optimization ...the solution space of a specific instance, while an objective function is ...

13

A Continuous Approach to Binary Quadratic Problems

A Continuous Approach to Binary Quadratic Problems

... original problem is converted into an equiva- lent continuous optimization problem by using NCP (Nonlinear Comple- mentarity Problem) function, which can be further carry on the smoothing ...

13

IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM

IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM

... Colony Optimization (ACO) is a population-based, general search technique for the solution of difficult combinatorial problems which is inspired by the pheromone trail laying behaviour of real ant ...

12

Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm

Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm

... Assignment Problem (QAP) is one of combinatorial optimization problems that, in many firms have done various researches in order to devote some facilities to some ...of optimization problems ...

5

Combinatorial optimization and metaheuristics

Combinatorial optimization and metaheuristics

... Trajectory methods are so called because the search process designs a trajectory in the search space, starting from an initial state and dynamically adding a new better solution to the curve in each discrete ...

47

Implementing Discrete Cuckoo Search Algorithm for TSP using MPI and Beowulf Cluster

Implementing Discrete Cuckoo Search Algorithm for TSP using MPI and Beowulf Cluster

... Search Optimization is chosen to find the optimum solution in this proposed ...Salesman Problem is a combinatorial optimization problem and Cuckoo Search Optimization is ...

7

Effects of approximation on an iterative combinatorial auction

Effects of approximation on an iterative combinatorial auction

... the solution produced, hence affecting the solution of the ...approximation solution will necessarily be worse than the optimal solution when the optimal allocation allocates a bundle to every ...

57

Service Networks Topological Design

Service Networks Topological Design

... solving combinatorial problem of optimal design based on binary partitioning, a parametric search and dynamic programming optimization of a binary tree are described and demonstrated in numeric ...

5

Metaheuristic research: a comprehensive survey

Metaheuristic research: a comprehensive survey

... colony optimization (ACO) [30], and GA have been extensively applied by majority of ...based optimization (TLBO) [38], biogeography- based optimization (BBO) [39], and bacterial foraging ...

35

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

... optimization, semidefinite programming had been in widespread use. In the resent years development of efficient algorithms brought it into the realm of tractability [1,3,6]. Today it is one of the basic modeling ...

9

Distribution Feeder Reconfiguration for minimum losses using Genetic Algorithms

Distribution Feeder Reconfiguration for minimum losses using Genetic Algorithms

... which solution time can be ...global solution to reconfiguration problem but the number of power flow solutions required is very ...if solution is obtained in a single generation, the number ...

7

Optimization of Service Operations Sequence in a Four-Wheeler Service Center

Optimization of Service Operations Sequence in a Four-Wheeler Service Center

... This problem is of practical interest in situations where such changeover time is quite considerable compared to operation ...design problem of a service line, the vehicle parts to be serviced are analogous ...

7

Optimal Power Allocation with Channel Inversion Regularization-Based Precoding for MIMO Broadcast Channels

Optimal Power Allocation with Channel Inversion Regularization-Based Precoding for MIMO Broadcast Channels

... Zero-forcing (ZF) precoding scheme can achieve the asymptotic sum capacity as dirty-paper coding (DPC) in multiple-input multiple-output broadcast (MIMO-BC) channel when the number of users, K, approaches infinity. ...

8

Show all 10000 documents...

Related subjects