Hosny manar (15 resultados)

Condición: New. pp. 176.

Taschenbuch. Condición: Neu. An Adaptive Hybrid Genetic Algorithm - Simulated Annealing Approach | A New Hybridization Technique Applied to Solving the MAP Problem in Bayesian Belief Networks | Manar Hosny | Taschenbuch | 176 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838335292 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.…

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condición: Neu. Vehicle Routing with Pickup and Delivery | Heuristic and Meta-heuristic Solution Algorithms | Manar Hosny | Taschenbuch | Paperback | 272 S. | Englisch | 2012 | LAP Lambert Academic Publishing | EAN 9783659202582 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Genetic algorithms (GAs) and simulated annealing (SA) are important search methods. Combining both may improve the search quality, for example by using SA as a genetic operator. One problem in such technique is to find annealing parameters that work for all stages of the run. In this research, we introduce a new adaptive hybrid GA-SA algorithm, in which SA acts as a mutation. However, the SA will be adaptive in the sense that its parameters are evolved during the search. Adaptation should help guide the search towards optimum solutions with minimum parameter tuning. The algorithm is tested on solving an important NP-hard problem, the MAP (Maximum a-Posteriori) Assignment Problem on BBNs (Bayesian Belief Networks). The results obtained indicate that the adaptive hybrid algorithm provides an improvement of solution quality over that obtained by GA used alone and GA augmented with standard non-adaptive SA. Its effect, however, is more profound for large problems, which are difficult for GA alone to solve. The techniques reported in this book should be of interest to researchers in heuristics and meta-heuristics, and their application to combinatorial optimization problems. 176 pp. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistics planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a customer location, pickup or a delivery. We considered two variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the One-commodity Pickup and Delivery Problem (1-PDP). We investigated heuristic and meta-heuristic approaches for solving the selected PDP variants. Our research focuses on handling the difficult problem constraints in a simple and effective way. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighborhood moves. In general, the findings of the research indicate the success of our approach in devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications. 300 pp. Englisch.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Genetic algorithms (GAs) and simulated annealing (SA) are important search methods. Combining both may improve the search quality, for example by using SA as a genetic operator. One problem in such technique is to find annealing parameters that work for all.…

Condición: New. Print on Demand pp. 176 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Hosny ManarManar I. F. Hosny, PhD: Studied Computer Science at Cardiff University, UK. Assistant Professor at the Computer Science Department, College of Computer and Information Sciences, King Saud University, Riyadh, Kingdom of Sau.…

Condición: New. PRINT ON DEMAND pp. 176.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Genetic algorithms (GAs) and simulated annealing (SA) are important search methods. Combining both may improve the search quality, for example by using SA as a genetic operator. One problem in such technique is to find annealing parameters that work for all stages of the run. In this research, we introduce a new adaptive hybrid GA-SA algorithm, in which SA acts as a mutation. However, the SA will be adaptive in the sense that its parameters are evolved during the search. Adaptation should help guide the search towards optimum solutions with minimum parameter tuning. The algorithm is tested on solving an important NP-hard problem, the MAP (Maximum a-Posteriori) Assignment Problem on BBNs (Bayesian Belief Networks). The results obtained indicate that the adaptive hybrid algorithm provides an improvement of solution quality over that obtained by GA used alone and GA augmented with standard non-adaptive SA. Its effect, however, is more profound for large problems, which are difficult for GA alone to solve. The techniques reported in this book should be of interest to researchers in heuristics and meta-heuristics, and their application to combinatorial optimization problems.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Genetic algorithms (GAs) and simulated annealing (SA) are important search methods. Combining both may improve the search quality, for example by using SA as a genetic operator. One problem in such technique is to find annealing parameters that work for all stages of the run. In this research, we introduce a new adaptive hybrid GA-SA algorithm, in which SA acts as a mutation. However, the SA will be adaptive in the sense that its parameters are evolved during the search. Adaptation should help guide the search towards optimum solutions with minimum parameter tuning. The algorithm is tested on solving an important NP-hard problem, the MAP (Maximum a-Posteriori) Assignment Problem on BBNs (Bayesian Belief Networks). The results obtained indicate that the adaptive hybrid algorithm provides an improvement of solution quality over that obtained by GA used alone and GA augmented with standard non-adaptive SA. Its effect, however, is more profound for large problems, which are difficult for GA alone to solve. The techniques reported in this book should be of interest to researchers in heuristics and meta-heuristics, and their application to combinatorial optimization problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 176 pp. Englisch.…

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistics planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a customer location, pickup or a delivery. We considered two variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the One-commodity Pickup and Delivery Problem (1-PDP). We investigated heuristic and meta-heuristic approaches for solving the selected PDP variants. Our research focuses on handling the difficult problem constraints in a simple and effective way. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighborhood moves. In general, the findings of the research indicate the success of our approach in devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistics planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a customer location, pickup or a delivery. We considered two variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the One-commodity Pickup and Delivery Problem (1-PDP). We investigated heuristic and meta-heuristic approaches for solving the selected PDP variants. Our research focuses on handling the difficult problem constraints in a simple and effective way. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighborhood moves. In general, the findings of the research indicate the success of our approach in devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications.Books on Demand GmbH, Überseering 33, 22297 Hamburg 300 pp. Englisch.…