Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 226 dari 34194, Total: 341939 data)

An Adaptive Variable Neighborhood Search for a Heterogeneous Fleet Vehicle Routing Problem with Three-Dimensional Loading Constraints

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 4)
Nomor Halaman : 18-30
Abstraksi Narasi : 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

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 4)
Nomor Halaman : 16-17
Abstraksi Narasi : -

A Report on the IEEE World Congress on Computational Intelligence 2014 (IEEE WCCI 2014)

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 4)
Nomor Halaman : 11-14
Abstraksi Narasi : -

I?EE ?IBCB 2014-Computational Intelligence in Bioinformatics and Computational Biology

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 4)
Nomor Halaman : 10-11
Abstraksi Narasi : -

CIS Publication Spotlight

Nama Pengarang : Derong Liu,Chin-Teng Lin,Greenwood, Garry,Lucas, Simon,Zhang, Zhengyou
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 4)
Nomor Halaman : 6-8
Abstraksi Narasi : -

Extracting Urban Occupational Plans Using Cultural Algorithms

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 3)
Nomor Halaman : 66-84
Abstraksi Narasi : 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

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 3)
Nomor Halaman : 54-64
Abstraksi Narasi : 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.

Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 3)
Nomor Halaman : 40-52
Abstraksi Narasi : We introduce an experimentation procedure for evaluating and comparing optimization algorithms based on the Traveling Salesman Problem (TSP). We argue that end-of-run results alone do not give sufficient information about an algorithm's performance, so our approach analyzes the algorithm's progress over time. Comparisons of performance curves in diagrams can be formalized by comparing the areas under them. Algorithms can be ranked according to a performance metric. Rankings based on different metrics can then be aggregated into a global ranking, which provides quick overview of the quality of algorithms in comparison. An open source software framework, the TSP Suite, applies this experimental procedure to the TSP. The framework can support researchers in implementing TSP solvers, unit testing them, and running experiments in a parallel and distributed fashion. It also has an evaluator component, which implements the proposed evaluation process and produces detailed reports. We test the approach by using the TSP Suite to benchmark several local search and evolutionary computation methods. This results in a large set of baseline data, which will be made available to the research community. Our experiments show that the tested pure global optimization algorithms are outperformed by local search, but the best results come from hybrid algorithms.

Computational Intelligence Challenges and Applications on Large-Scale Astronomical Time Series Databases

Nama Pengarang : Huijse, Pablo,Estévez, Pablo A.,Protopapas, Pavlos,Principe, Jose C.,Zegers, Pablo
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 3)
Nomor Halaman : 27-39
Abstraksi Narasi : ime-domain astronomy (TDA) is facing a paradigm shift caused by the exponential growth of the sample size, data complexity and data generation rates of new astronomical sky surveys. For example, the Large Synoptic Survey Telescope (LSST), which will begin operations in northern Chile in 2022, will generate a nearly 150 Petabyte imaging dataset of the southern hemisphere sky. The LSST will stream data at rates of 2 Terabytes per hour, effectively capturing an unprecedented movie of the sky. The LSST is expected not only to improve our understanding of time-varying astrophysical objects, but also to reveal a plethora of yet unknown faint and fast-varying phenomena.To cope with a change of paradigm to data-driven astronomy, the fields of astroinformatics and astrostatistics have been created recently. The new data-oriented paradigms for astronomy combine statistics, data mining, knowledge discovery, machine learning and computational intelligence, in order to provide the automated and robust methods needed for the rapid detection and classification of known astrophysical objects as well as the unsupervised characterization of novel phenomena. In this article we present an overview of machine learning and computational intelligence applications to TDA. Future big data challenges and new lines of research in TDA, focusing on the LSST, are identified and discussed from the viewpoint of computational intelligence/ machine learning. Interdisciplinary collaboration will be required to cope with the challenges posed by the deluge of astronomical data coming from the LSST.

The Emerging "Big Dimensionality"

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 9 (No. 3)
Nomor Halaman : 14-26
Abstraksi Narasi : The world continues to generate quintillion bytes of data daily, leading to the pressing needs for new efforts in dealing with the grand challenges brought by Big Data. Today, there is a growing consensus among the computational intelligence communities that data volume presents an immediate challenge pertaining to the scalability issue. However, when addressing volume in Big Data analytics, researchers in the data analytics community have largely taken a one-sided study of volume, which is the "Big Instance Size" factor of the data. The flip side of volume which is the dimensionality factor of Big Data, on the other hand, has received much lesser attention. This article thus represents an attempt to fill in this gap and places special focus on this relatively under-explored topic of "Big Dimensionality", wherein the explosion of features (variables) brings about new challenges to computational intelligence. We begin with an analysis on the origins of Big Dimensionality. The evolution of feature dimensionality in the last two decades is then studied using popular data repositories considered in the data analytics and computational intelligence research communities. Subsequently, the state-of-the-art feature selection schemes reported in the field of computational intelligence are reviewed to reveal the inadequacies of existing approaches in keeping pace with the emerging phenomenon of Big Dimensionality. Last but not least, the "curse and blessing of Big Dimensionality" are delineated and deliberated.
← Kembali ke Halaman Utama