Article
Computer Science, Interdisciplinary Applications
Vivian Nguyen, Vicky Mak-Hau, Bill Moran, Ana Novak
Summary: The algorithm efficiently and accurately schedules and optimally assigns military trainees to classes, respecting domain constraints. It shows significant computational benefit compared to other methods and can handle larger-scale problems effectively.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Computer Science, Artificial Intelligence
Simon Caillard, Laure Brisoux Devendeville, Corinne Lucet
Summary: The paper introduces the Variable Neighborhood Search (VNS) algorithm SimULS to solve a planning problem in the Health Simulation Center SimUSante. The algorithm combines different neighborhood functions and uses a diversification function when trapped in a local optimum. Experimental results show that SimULS is able to schedule all activities without violating constraints, providing solutions close to the optimum.
APPLIED INTELLIGENCE
(2022)
Article
Operations Research & Management Science
Intesar Al-Mudahka, Reem Alhamad
Summary: This paper proposes a mathematical goal program for designing timetables for radiologists, which simplifies the process and promotes efficiency and fairness. The program can be used at both the strategic and operational levels to meet different needs.
RAIRO-OPERATIONS RESEARCH
(2022)
Article
Computer Science, Artificial Intelligence
Simon Caillard, Laure Brisoux Devendeville, Corinne Lucet
Summary: In this paper, two ant algorithms (AS and ACS) are proposed to solve a planning problem in the Health Simulation Center SimUSante. Experimental results show that SimU-TACS outperforms other methods and provides optimal solutions for 31/48 instances.
APPLIED SOFT COMPUTING
(2023)
Article
Operations Research & Management Science
Arjan Akkermans, Gerhard Post, Marc Uetz
Summary: This paper introduces a two-phase approach using integer linear programming to solve the shift and break design problem. The approach creates shifts while considering breaks heuristically in the first phase, and assigns breaks to shifts in the second phase until no improvement is found. Results show that this approach outperforms the current best known method for shift and break design problem on a set of benchmark instances.
ANNALS OF OPERATIONS RESEARCH
(2021)
Article
Operations Research & Management Science
Mohammed Abdelghany, Zakaria Yahia, Amr B. Eltawil
Summary: The nurse rostering problem is a difficult NP-hard problem, usually modeled with soft and hard constraint aiming to minimize violations of soft constraints. In this paper, a new two-stage variable neighborhood search algorithm is proposed, which has been tested to compete with results of a recent heuristic approach in literature.
RAIRO-OPERATIONS RESEARCH
(2021)
Article
Management
Rasul Esmaeilbeigi, Vicky Mak-Hau, John Yearwood, Vivian Nguyen
Summary: This paper investigates the multiphase course timetabling problem and proposes mathematical formulations and effective solution algorithms. The study extends the model by introducing additional constraints and presents an enhanced algorithm. Computational results demonstrate the efficacy of the proposed algorithms.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Ziyi Chen, Yajie Dou, Patrick De Causmaecker
Summary: This study proposes a neural network-assisted method for addressing the complex nurse scheduling problem, and it demonstrates good performance in experiments.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Transportation Science & Technology
Xiaoming Xu, Yanhong Yu, Jiancheng Long
Summary: Vehicle timetabling and scheduling in a public transit system are usually performed separately, resulting in a lack of trade-off between bus timetables and vehicle schedules. This paper proposes an integrated framework for electric bus timetabling and scheduling, considering various factors such as headway times, depot requirements, deadheading, and vehicle battery capacities. A time-space network is constructed with inventory arcs to decrease the network size, and a multi-commodity network flow model is formulated. Through a Lagrangian relaxation heuristic, the proposed method efficiently produces bus timetables and schedules with improved profit and valid bounds.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
(2023)
Article
Operations Research & Management Science
Tommaso Schettini, Michel Gendreau, Ola Jabali, Federico Malucelli
Summary: Metro lines are a crucial part of urban public transport in many cities, offering a greener and more efficient alternative to private transportation. However, these lines are often resource constrained, making it difficult to expand capacity. To make better use of existing resources, researchers and operators are exploring ways to adapt timetables to forecasted demand and limited vehicle capacities.
TRANSPORTATION SCIENCE
(2023)
Article
Management
Marta Monaci, Valerio Agasucci, Giorgio Grani
Summary: In this research, we applied deep reinforcement learning to tackle the job shop scheduling problem. The study showed that a greedy-like heuristic trained on a subset of problems could effectively generalize to unseen instances and be competitive compared to other methods. The experiments demonstrated that this algorithm was able to generate good solutions in a short time, indicating the feasibility of learning-based methodologies in generating new greedy heuristics.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2024)
Article
Computer Science, Artificial Intelligence
Ting Song, Mao Chen, Yulong Xu, Dong Wang, Xuekun Song, Xiangyang Tang
Summary: This study introduces a novel competition-guided multi-neighborhood local search algorithm for solving course timetabling problems, which combines multiple neighborhoods and uses a competition-based restart strategy to improve efficiency.
APPLIED SOFT COMPUTING
(2021)
Article
Engineering, Multidisciplinary
Nancy Maribel Arratia-Martinez, Cristina Maya-Padron, Paulina A. Avila-Torres
Summary: This paper focuses on the university course timetabling problem in an institution in Mexico, particularly on the assignment of professors to courses and time slots. An integer linear programming model was proposed and the optimal solution was obtained with low computational effort using the branch-and-bound algorithm. The effectiveness of the model is demonstrated through a complete timetable.
MATHEMATICAL PROBLEMS IN ENGINEERING
(2021)
Article
Computer Science, Artificial Intelligence
Victor M. Valenzuela-Alcaraz, M. A. Cosio-Leon, A. Danisa Romero-Ocano, Carlos A. Brizuela
Summary: The study proposes a cooperative coevolutionary algorithm for solving the no-wait job shop scheduling problem. The algorithm evolves permutations and binary chains simultaneously to optimize sequencing and timetabling decisions, and includes one-step perturbation mechanisms to improve solution quality. Experimental results show that the proposed algorithm produces competitive results and obtains new best values for some instances.
EXPERT SYSTEMS WITH APPLICATIONS
(2022)
Article
Biology
Asaju La'aro Bolaji, Akeem Femi Bamigbola, Lawrence Bunmi Adewole, Peter Bamidele Shola, Adenrele Afolorunso, Adesoji Abraham Obayomi, Dayo Reuben Aremu, Abdulwahab Ali A. Almazroi
Summary: This paper proposes an Artificial Bee Colony Algorithm (ABC) to solve the Patient Admission Scheduling (PAS) problem. The performance evaluation of the ABC algorithm on the PAS reveals its superiority compared to other methods.
COMPUTERS IN BIOLOGY AND MEDICINE
(2022)
Article
Management
Nelishia Pillay, Rong Qu
Summary: This paper focuses on the assessment of the generality performance of hyper-heuristics, introducing a new taxonomy and performance measure based on generality rather than optimality. Case studies are used to demonstrate the application of the generality performance measure, highlighting the importance of evaluating different types of hyper-heuristics based on their levels of generality.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
(2021)
Article
Multidisciplinary Sciences
Abder-Rahman Ali, Jingpeng Li, Sally Jane O'Shea
Article
Computer Science, Information Systems
Fuhong Song, Huanlai Xing, Shouxi Luo, Dawei Zhan, Penglin Dai, Rong Qu
IEEE INTERNET OF THINGS JOURNAL
(2020)
Article
Computer Science, Artificial Intelligence
Khodakaram Salimifard, Jingpeng Li, Davood Mohammadi, Reza Moghdani
Summary: This paper presents a mathematical model for scheduling parallel machines with splitting jobs and resource constraints, considering two minimization objectives. A new multi-objective optimization algorithm MOVPL is proposed and compared with other algorithms, showing its superiority in experimental results.
APPLIED INTELLIGENCE
(2021)
Article
Computer Science, Artificial Intelligence
Xingxing Hao, Rong Qu, Jing Liu
Summary: Hyper-heuristics and evolutionary multitasking share similarities in search methods, and by combining the advantages of both, the optimization of problems can be accelerated, leading to increased generality.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
(2021)
Article
Computer Science, Artificial Intelligence
Weiyao Meng, Rong Qu
Summary: This paper introduces the AutoGCOP framework for the automated design of local search algorithms, optimizing the composition of algorithmic components and utilizing learning models for enhancement. The Markov chain model demonstrates superior performance in learning algorithmic component compositions.
EXPERT SYSTEMS WITH APPLICATIONS
(2021)
Article
Geochemistry & Geophysics
Yuwei Guo, Licheng Jiao, Rong Qu, Zhuangzhuang Sun, Shuang Wang, Shuo Wang, Fang Liu
Summary: This paper proposes an adaptive fuzzy superpixel (AFS) algorithm based on polarimetric scattering information for PolSAR image classification. AFS utilizes the correlation between pixels' polarimetric scattering information to generate superpixels, and dynamically updates the ratio of undetermined pixels. Experimental results demonstrate the superiority of AFS in PolSAR image classification problems.
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING
(2022)
Editorial Material
Computer Science, Artificial Intelligence
Marco S. Nobile, Luca Manzoni, Daniel A. Ashlock, Rong Qu
Summary: Computational Intelligence (CI) provides powerful tools for complex computational tasks, including global optimization methods, machine learning, and fuzzy reasoning. In addition to algorithm improvement, CI research also focuses on representations and models to simplify optimization problems and reduce computational effort.
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE
(2023)
Article
Computer Science, Artificial Intelligence
Wenjie Yi, Rong Qu, Licheng Jiao
Summary: Automated algorithm design has become a popular research focus in solving complex combinatorial optimization problems. This study applies reinforcement learning to the automated design of metaheuristic algorithms within a general algorithm design framework. Two groups of features, search-dependent and instance-dependent, are identified to support effective reinforcement learning. Experimental results on a benchmark dataset demonstrate the effectiveness of the identified features in assisting automated algorithm design with the proposed reinforcement learning model.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Computer Science, Artificial Intelligence
Jingyi Ding, Tiwen Wang, Ruohui Cheng, Licheng Jiao, Jianshe Wu, Jing Bai
Summary: In this paper, a new community evolution model is developed based on the universality of the timeframe, and a new optimized timeframe partitioning algorithm is proposed. The proposed self-adaptive timeframe partitioning algorithm improves the quality of community tracking and ensures the accuracy of prediction events in real-world networks.
KNOWLEDGE-BASED SYSTEMS
(2023)
Article
Automation & Control Systems
Xiaotong Li, Licheng Jiao, Hao Zhu, Fang Liu, Shuyuan Yang, Xiangrong Zhang, Shuang Wang, Rong Qu
Summary: This article proposes a collaborative learning tracking network for remote sensing videos, which includes CRFPF module, DSCA module, and GCRT strategy. Experimental results demonstrate the accuracy and effectiveness of this method in complex remote sensing scenes.
IEEE TRANSACTIONS ON CYBERNETICS
(2023)
Editorial Material
Computer Science, Artificial Intelligence
Uwe Aickelin, Hadi Akbarzadeh Khorshidi, Rong Qu, Hadi Charkhgard
Summary: This special issue focuses on the application of multiobjective evolutionary optimization in machine learning. Optimization plays a crucial role in many machine-learning techniques, and there is still potential to further utilize optimization in machine learning. Each machine-learning technique has hyperparameters that can be adjusted through evolutionary computation and optimization, considering multiple criteria such as bias, variance, complexity, and fairness in model selection. Multiobjective evolutionary optimization can help meet these criteria for optimizing machine-learning models. Although some existing approaches transform the problem into a single-objective optimization problem, multiobjective optimization models are more effective in contributing to multiple intended objectives or criteria.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
(2023)
Article
Computer Science, Artificial Intelligence
Wenjie Yi, Rong Qu, Licheng Jiao, Ben Niu
Summary: This article proposes a general search framework (GSF) to unify different metaheuristic algorithms. With the established GSF, two reinforcement learning (RL)-based methods are developed to automatically design a new general population-based algorithm. The effectiveness and generalization of the proposed RL-based methods are comprehensively validated.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
(2023)
Article
Computer Science, Artificial Intelligence
Zhiwen Xiao, Huanlai Xing, Bowen Zhao, Rong Qu, Shouxi Luo, Penglin Dai, Ke Li, Zonghai Zhu
Summary: Recently, contrastive learning has emerged as a promising method for learning discriminative representations from time series data. However, existing algorithms mostly focus on high-level semantic information, neglecting the importance of low-level semantic information. In this paper, we propose a novel deep contrastive representation learning with self-distillation (DCRLS) method, which combines data augmentation, deep contrastive learning, and self distillation. Experimental results show that the DCRLS-based structures achieve excellent performance on classification and clustering tasks.
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE
(2023)
Article
Engineering, Electrical & Electronic
Huanlai Xing, Zhiwen Xiao, Rong Qu, Zonghai Zhu, Bowen Zhao
Summary: This article proposes an efficient federated distillation learning system (EFDLS) for multitask time series classification (TSC). It introduces two novel components: a feature-based student-teacher (FBST) framework and a distance-based weights matching (DBWM) scheme. Experimental results demonstrate that EFDLS outperforms other federated learning algorithms in multiple datasets and achieves higher mean accuracy compared to a single-task baseline.
IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT
(2022)