OPAC - Pencarian Artikel Jurnal & Majalah Library USD
Menampilkan semua artikel (Halaman 194 dari 34169, Total: 341690 data)
Big Data Opportunities and Challenges: Discussions from Data Analytics Perspectives
klik untuk membaca file PDF
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 4) |
| Halaman | : | 62-74 |
| Abstrak | : | "Big Data" as a term has been Bamong the biggest trends of the last three years, leading to an upsurge of research, as well as industry and government applications. Data is deemed a powerful raw material that can impact multidisciplinary research endeavors as well as government and business performance. The goal of this discussion paper is to share the data analytics opinions and perspectives of the authors relating to the new opportunities and challenges brought forth by the big data movement. The authors bring together diverse perspectives, coming from different geographical locations with different core research expertise and different affiliations and work experiences. The aim of this paper is to evoke discussion rather than to provide a comprehensive survey of big data research. |
A Hybrid Metaheuristic Optimization Algorithm for Strategic Planning of 4D Aircraft Trajectoriesat the Continental Scale
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 4) |
| Halaman | : | 46-61 |
| Abstrak | : | Global air-traffic demand is continuously increasing. To handle such a tremendous traffic volume while maintaining at least the same level of safety, a more efficient strategic trajectory planning is necessary. In this work, we present a strategic trajectory planning methodology which aims to minimize interaction between aircraft at the European-continent scale. In addition, we propose a preliminary study that takes into account uncertainties of aircraft positions in the horizontal plane. The proposed methodology separates aircraft by modifying their trajectories and departure times. This route/departuretime assignment problem is modeled as a mixed-integer optimization problem. Due to the very high combinatorics involved in the continent-scale context (involving more than 30,000 flights), we develop and implement a hybrid-metaheuristic optimization algorithm. In addition, we present a computationallyefficient interaction detection method for large trajectory sets. The proposed methodology is successfully implemented and tested on a full-day simulated air traffic over the European airspace, yielding to an interaction-free trajectory plan. |
A Metaheuristic-Based Approach for the Capacitated Supply Chain Network Design Problem Including Imperfect Quality and Rework
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 4) |
| Halaman | : | 31-45 |
| Abstrak | : | A growing number of organizations have realized the importance of quan- tifying costs associated to product quality and optimizing their supply chains based not only on operational and logistics costs but also onn quality-related costs or Cost of Quality (COQ). This paper presents a novel capacitated Supply Chain Network Design (SCND) model, known as the SCND-COQ model, which quantifies the overall economic profit of the supply chain while accounting for quality-related costs. Quality-related costs are computed from analytical expressions for tracking the Supply Chain (SC) quality level and quantifying the prevention, inspection, rework, failure and opportunity costs, which, in turn, depend on the internal operational decisions within the manufacturing plants. Two metaheuristic solution procedures, based on the Simulated Annealing (SA) and the Genetic Algorithm (GA), with calls to a nonlinear solver are proposed for identifying near-optimal SCNDs since maximizing the output of the SCNDCOQ model can be classified as an NPO-complete problem. The effectiveness of the proposed solution procedures is demonstrated through comprehensive numerical experiments. Based on computational results, the GA-based procedure outperformed the SA-based procedure for all the tested instances in terms of solution quality. The results show that quality-related costs may account up to 11% of the overall profit and the selected business entities differ when including quality-related costs in the SCND decision-making process. |
An Adaptive Variable Neighborhood Search for a Heterogeneous Fleet Vehicle Routing Problem with Three-Dimensional Loading Constraints
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 4) |
| Halaman | : | 18-30 |
| Abstrak | : | The paper addresses the heterogeneous fleet vehicle routing problem with three-dimensional (3D) loading constraints (3L-HFVRP), a new practical variant of the combined routing and loading problem. In this problem, the loads consist of a set of three-dimensional, rectangular shaped items. The fleet is composed of heterogeneous vehicles with different weight and space capacities. The objective is to serve all customers by selecting a set of vehicles such that the total transportation cost is minimized.The cost consists of the fixed cost of the selected vehicles and their travel cost. In addition, loading sequence related constraints frequently encountered in realistic applications are respected when loading and unloading the items. To solve this challenging problem, we develop an adaptive variable neighborhood search (AVNS) which utilizes an extreme point based first fit heuristic to find a feasible loading pattern for each route. We design two strategies to accelerate the loading and routing processes. The Trie data structure is used to record the loading information of routes already visited and to control the computational effort spent for each route. The Fibonacci heap data structure is used to maintain all ofthe possible moves and vehicle type assignments, which avoids the duplicated evaluation of some moves and unnecessary loading check of unpromising solutions. The robustness and effectiveness of the proposed algorithm is validated by computational tests performed both on some newly generated 3L-HFVRP instances and well-known benchmark instances from the literature for two simplified VRP variants: the capacitated vehicle routing problem with 3D loading constraints (3L-CVRP) and the pure heterogeneous fleet vehicle routing problem (HFVRP). The numerical experiments show that the proposed AVNS outperforms other algorithms in 3L-CVRP and improves several best known solutions reported in the literature. The results obtained for the pure HFVRP are very close to the best known solutions. |
Computational Intelligence in Production and Logistics Systems: Solving Vehicle Routing, Supply Chain Network, and Air-Traffic Trajectory Planning Problems
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 4) |
| Halaman | : | 16-17 |
| Abstrak | : | - |
A Report on the IEEE World Congress on Computational Intelligence 2014 (IEEE WCCI 2014)
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 4) |
| Halaman | : | 11-14 |
| Abstrak | : | - |
I?EE ?IBCB 2014-Computational Intelligence in Bioinformatics and Computational Biology
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 4) |
| Halaman | : | 10-11 |
| Abstrak | : | - |
CIS Publication Spotlight
| Pengarang | : | Derong Liu,Chin-Teng Lin,Greenwood, Garry,Lucas, Simon,Zhang, Zhengyou |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 4) |
| Halaman | : | 6-8 |
| Abstrak | : | - |
Extracting Urban Occupational Plans Using Cultural Algorithms
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 3) |
| Halaman | : | 66-84 |
| Abstrak | : | Cultural Algorithms can be used to evolve structural functional models of urban centers. The population of the Cultural Algorithm is a set of urban planning agents, each of whom competes to build up a high level model of the site from a set of building blocks. These building blocks are produced through the use of techniques from Data Mining and Complex Systems. The best model is compared with existing models of modern cities in order to identify the similarities and differences between ancient and modern cities. The resultant comparison suggests that early Monte Albán exhibited a sector-based model that is characteristic of some modern cities. In addition, the plan generated by the Cultural Algorithm is able to add insight into the plan generated by a site expert. This suggests that such an approach can be generalized to other urban sites and foster a new understanding of the urbanization process |
The Next Technological Wave: Intelligence Technology for Intelligence Super Agent
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 9 (No. 3) |
| Halaman | : | 54-64 |
| Abstrak | : | Since the industrial revolution, tech- S nological evolution has been the defining aspect of societal progress. Among all the technologies that have emerged over the years, information technology is the one that truly revolutionized the modern lifestyle. To take information technology beyond information mining and communication, intelligence technology (InT) is required to manipulate the information and knowledge with human-like intelligence. However, transforming InT into the next technological wave requires a medium to actualize InT with all its potential. Therefore, in this paper, we propose an intelligence super agent (iSA) as an autonomous entity equipped with all categories of intelligence, i.e. cognitive, social, behavioral, ambient, collective, and genetic intelligences. To realize the iSA, we also present a modular architecture, named intelligence operating architecture (iOA), capable of implementing all aspects of InT along with a biologically-inspired thought process. As a novel implementation platform for the iSA, we present user-centered development of robots enacted through agent based modularization (UDREAM). The effectiveness of UDREAM is shown through some application-specific experiments with individual robots. Although the current iSA is for a limited number of services with a standalone robot, it can be extended to a more complex iSA. |