Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (11)
  • Open Access

    ARTICLE

    A Study on Optimizing the Double-Spine Type Flow Path Design for the Overhead Transportation System Using Tabu Search Algorithm

    Nguyen Huu Loc Khuu1,2,3, Thuy Duy Truong1,2,3, Quoc Dien Le1,2,3, Tran Thanh Cong Vu1,2,3, Hoa Binh Tran1,2,3, Tuong Quan Vo1,2,3,*

    Intelligent Automation & Soft Computing, Vol.39, No.2, pp. 255-279, 2024, DOI:10.32604/iasc.2024.043854

    Abstract Optimizing Flow Path Design (FPD) is a popular research area in transportation system design, but its application to Overhead Transportation Systems (OTSs) has been limited. This study focuses on optimizing a double-spine flow path design for OTSs with 10 stations by minimizing the total travel distance for both loaded and empty flows. We employ transportation methods, specifically the North-West Corner and Stepping-Stone methods, to determine empty vehicle travel flows. Additionally, the Tabu Search (TS) algorithm is applied to branch the 10 stations into two main layout branches. The results obtained from our proposed method demonstrate More >

  • Open Access

    ARTICLE

    An Effective Neighborhood Solution Clipping Method for Large-Scale Job Shop Scheduling Problem

    Sihan Wang, Xinyu Li, Qihao Liu*

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1871-1890, 2023, DOI:10.32604/cmes.2023.028339

    Abstract The job shop scheduling problem (JSSP) is a classical combinatorial optimization problem that exists widely in diverse scenarios of manufacturing systems. It is a well-known NP-hard problem, when the number of jobs increases, the difficulty of solving the problem exponentially increases. Therefore, a major challenge is to increase the solving efficiency of current algorithms. Modifying the neighborhood structure of the solutions can effectively improve the local search ability and efficiency. In this paper, a genetic Tabu search algorithm with neighborhood clipping (GTS_NC) is proposed for solving JSSP. A neighborhood solution clipping method is developed and… More >

  • Open Access

    ARTICLE

    Efficient Heuristic Replication Techniques for High Data Availability in Cloud

    H. L. Chandrakala1,*, R. Loganathan2

    Computer Systems Science and Engineering, Vol.45, No.3, pp. 3151-3164, 2023, DOI:10.32604/csse.2022.027873

    Abstract Most social networks allow connections amongst many people based on shared interests. Social networks have to offer shared data like videos, photos with minimum latency to the group, which could be challenging as the storage cost has to be minimized and hence entire data replication is not a solution. The replication of data across a network of read-intensive can potentially lead to increased savings in cost and energy and reduce the end-user’s response time. Though simple and adaptive replication strategies exist, the solution is non-deterministic; the replicas of the data need to be optimized to… More >

  • Open Access

    ARTICLE

    Energy-Efficient Routing Using Novel Optimization with Tabu Techniques for Wireless Sensor Network

    Manar Ahmed Hamza1,2,*, Aisha Hassan Abdalla Hashim1, Dalia H. Elkamchouchi3, Nadhem Nemri4, Jaber S. Alzahrani5, Amira Sayed A. Aziz6, Mnahel Ahmed Ibrahim7, Abdelwahed Motwakel2

    Computer Systems Science and Engineering, Vol.45, No.2, pp. 1711-1726, 2023, DOI:10.32604/csse.2023.031467

    Abstract Wireless Sensor Network (WSN) consists of a group of limited energy source sensors that are installed in a particular region to collect data from the environment. Designing the energy-efficient data collection methods in large-scale wireless sensor networks is considered to be a difficult area in the research. Sensor node clustering is a popular approach for WSN. Moreover, the sensor nodes are grouped to form clusters in a cluster-based WSN environment. The battery performance of the sensor nodes is likewise constrained. As a result, the energy efficiency of WSNs is critical. In specific, the energy usage… More >

  • Open Access

    ARTICLE

    A Truck Scheduling Problem for Multi-Crossdocking System with Metaheuristics

    Phan Nguyen Ky Phuc1, Nguyen Van Thanh2,*, Duong Bao Tram1

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 5165-5178, 2022, DOI:10.32604/cmc.2022.027967

    Abstract The cross-docking is a very important subject in logistics and supply chain managements. According to the definition, cross-docking is a process dealing with transhipping inventory, in which goods and products are unloaded from an inbound truck and process through a flow-center to be directly loaded onto an outbound truck. Cross-docking is favored due to its advantages in reducing the material handing cost, the needs to store the product in warehouse, as well decreasing the labor cost by eliminating packaging, storing, pick-location and order picking. In cross-docking, products can be consolidated and transported as a full… More >

  • Open Access

    ARTICLE

    Design and Validation of a Route Planner for Logistic UAV Swarm

    Meng-Tse Lee1,*, Ying-Chih Lai2, Ming-Lung Chuang1, Bo-Yu Chen1

    Intelligent Automation & Soft Computing, Vol.28, No.1, pp. 227-240, 2021, DOI:10.32604/iasc.2021.015339

    Abstract Unmanned Aerial Vehicles (UAV) are widely used in different fields of aviation today. The efficient delivery of packages by drone may be one of the most promising applications of this technology. In logistic UAV missions, due to the limited capacities of power supplies, such as fuel or batteries, it is almost impossible for one unmanned vehicle to visit multiple wide areas. Thus, multiple unmanned vehicles with well-planned routes become necessary to minimize the unnecessary consumption of time, distance, and energy while carrying out the delivery missions. The aim of the present study was to develop… More >

  • Open Access

    ARTICLE

    Genetic Algorithm and Tabu Search Memory with Course Sandwiching (GATS_CS) for University Examination Timetabling

    Abayomi-Alli A.1, Misra S.2,3, Fernández-Sanz L.4, Abayomi-Alli O.2,*, Edun A. R.1

    Intelligent Automation & Soft Computing, Vol.26, No.3, pp. 385-396, 2020, DOI:10.32604/iasc.2020.013915

    Abstract University timetable scheduling is a complicated constraint problem because educational institutions use timetables to maximize and optimize scarce resources, such as time and space. In this paper, an examination timetable system using Genetic Algorithm and Tabu Search memory with course sandwiching (GAT_CS), was developed for a large public University. The concept of Genetic Algorithm with Selection and Evaluation was implemented while the memory properties of Tabu Search and course sandwiching replaced Crossover and Mutation. The result showed that GAT_CS had hall allocation accuracies of 96.07% and 99.02%, unallocated score of 3.93% and 0.98% for first More >

  • Open Access

    ARTICLE

    Research on Vehicle Routing Problem with Soft Time Windows Based on Hybrid Tabu Search and Scatter Search Algorithm

    Jinhui Ge1, Xiaoliang Liu2, *, Guo Liang3

    CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1945-1958, 2020, DOI:10.32604/cmc.2020.010977

    Abstract With the expansion of the application scope of social computing problems, many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes, cultures, and the emotional needs of customers. The actual soft time window vehicle routing problem, speeding up the response of customer needs, improving distribution efficiency, and reducing operating costs is the focus of current social computing problems. Therefore, designing fast and effective algorithms to solve this problem has certain theoretical and practical significance. In this paper, considering the time delay… More >

  • Open Access

    ARTICLE

    Multi-Objective Optimization of a Fluid Structure Interaction Benchmarking

    M. Razzaq1, C. Tsotskas2, S. Turek1, T. Kipouros2, M. Savill2, J. Hron3

    CMES-Computer Modeling in Engineering & Sciences, Vol.90, No.4, pp. 303-337, 2013, DOI:10.3970/cmes.2013.090.303

    Abstract The integration and application of a new multi-objective tabu search optimization algorithm for Fluid Structure Interaction (FSI) problems are presented. The aim is to enhance the computational design process for real world applications and to achieve higher performance of the whole system for the four considered objectives. The described system combines the optimizer with a well established FSI solver which is based on the fully implicit, monolithic formuFlation of the problem in the Arbitrary Lagrangian-Eulerian FEM approach. The proposed solver resolves the proposed fluid-structure interaction benchmark which describes the self-induced elastic deformation of a beam More >

  • Open Access

    ARTICLE

    The Design of Multi-Element Airfoils Through Multi-Objective Optimization Techniques

    G. Trapani1, T. Kipouros1, A. M. Savill1

    CMES-Computer Modeling in Engineering & Sciences, Vol.88, No.2, pp. 107-140, 2012, DOI:10.3970/cmes.2012.088.107

    Abstract This paper presents the development and the application of a multi-objective optimization framework for the design of two-dimensional multi-element high-lift airfoils. An innovative and efficient optimization algorithm, namely Multi-Objective Tabu Search (MOTS), has been selected as core of the framework. The flow-field around the multi-element configuration is simulated using the commercial computational fluid dynamics (cfd) suite Ansys cfx. Elements shape and deployment settings have been considered as design variables in the optimization of the Garteur A310 airfoil, as presented here. A validation and verification process of the cfd simulation for the Garteur airfoil is performed… More >

Displaying 1-10 on page 1 of 11. Per Page