The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Amid the most widely studied NP-hard combinatorial optimization problems, the Probabilistic Traveling Salesman Problem (PTSP), which is an extension of the well-known Traveling Salesman Problem, offers a fundamental basis for analyzing the stochastic impacts in routing problems. In this paper, a new meta-heuristic approach, Genetic Minimum Matrix Search (GMMS), is introduced for the solution of the...
In this paper, the Permutation Flow Shop Problem (PFSP) with total completion time is studied. In previous papers, we proposed parallel algorithms to solve the PFSP based on load balancing Branch and Bound approach. In this work, we propose other alternatives based on Genetic Algorithms to solve this problem. However, using efficiently genetic algorithm (GA) involves a complex interaction among its...
Some of the engineering applications warrant the solution of Graph Coloring Problem. This paper investigates a new genetic procedure using divide and conquer strategy on some of the intermediate (100 ≤ n ≤ 500) and large scale benchmark graphs (n ≥ 500) to obtain the near optimal chromatic number. Finding the chromatic number is an NP-hard and combinatorial optimization problem. The divide & conquer...
This paper addresses p-processes single processor scheduling problem with a common deadline, to minimize the total execution time and reduce the penalty costs. Process scheduling is one of the most essential factor on which the efficiency and the performance of the work done by the CPU depends. Earliness and tardiness of the processes degrades the efficiency of the processor as they carry penalty...
Nowadays, public transportation has become an essential area for the actual society, which directly affects the quality of life. There are different sort of public transportation systems. One type that receives much attention these days because of its great social interest is the transportation on-demand. Some of the most well-known on-demand transports systems are the Demand Responsive Transit, and...
Combinatorial optimization is a widely studied field within artificial intelligence. There are many problems of this type, and many techniques applied to them can be found in the literature. Especially, population techniques have received much attention in this area, being genetic algorithms (GA) the most famous ones. Although throughout history many studies on GAs have been performed, there is still...
The use of heuristics and metaheuristic approach has grown rapidly in solving combinatorial optimization problems as they provide an optimal or a sub optimal solution in reasonable time. In this paper, we proposed a metaheuristic approach to solve 2D-Strip packing problem. We have also carried out a comparative study with a pool of crossover operators to find the best coupled one with our approach...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.