Results 21 to 30 of about 715 (165)

Multiobjective Green Time‐Dependent Location‐Routing Problem and Algorithms

open access: yesAdvances in Operations Research, Volume 2022, Issue 1, 2022., 2022
To reduce the logistic cost and carbon emission and improve customer satisfaction, this study proposes a multiobjective green time‐dependent location routing problem (MOGTDLRP) model in which the objectives are to minimize the distribution total cost, delivery time, and fuel consumption.
Hua-Xin Zhang   +2 more
wiley   +1 more source

Intelligent Warehouse Robot Scheduling System Using a Modified Nondominated Sorting Algorithm

open access: yesDiscrete Dynamics in Nature and Society, Volume 2022, Issue 1, 2022., 2022
In intelligent warehouse, the problem of transporting goods in intelligent warehouse is becoming increasingly complex, and the traditional way of automatically guiding vehicles (AGVs) is inefficient, so automated robot systems are introduced into intelligent warehouses.
Jia Ma, Shujun Yang, Hao Jing, Shi Cheng
wiley   +1 more source

A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems

open access: yesIEEE Access, 2020
Hyper-heuristics aim at interchanging different solvers while solving a problem. The idea is to determine the best approach for solving a problem at its current state. This way, every time we make a move it gets us closer to a solution.
Melissa Sanchez   +5 more
doaj   +1 more source

Application of Multi-Objective Hyper-Heuristics to Solve the Multi-Objective Software Module Clustering Problem

open access: yesApplied Sciences, 2022
Software maintenance is an important step in the software lifecycle. Software module clustering is a HHMO_CF_GDA optimization problem involving several targets that require minimization of module coupling and maximization of software cohesion.
Haya Alshareef, Mashael Maashi
doaj   +1 more source

Comparison of Two Algorithms for Multiline Bus Dynamic Dispatching

open access: yesDiscrete Dynamics in Nature and Society, Volume 2022, Issue 1, 2022., 2022
Dynamic bus scheduling refers to adjusting the departure time according to the latest time‐varying information or adjusting bus speed in the process of operation. These control strategies can prevent bus bunching and alleviate traffic pressure. The paper studies the multiline bus dynamic scheduling with consideration of departure time and speed ...
Yingxin Liu   +6 more
wiley   +1 more source

Hyperheuristics: Recent Developments [PDF]

open access: yes, 2008
Yes We present a thorough review of hyperheuristic research to date, and analyse/compare hyperheuristic papers based on the methods used.
Chakhlevitch, K., Cowling, Peter I.
openaire   +2 more sources

Equalized Grey Wolf Optimizer with Refraction Opposite Learning

open access: yesComputational Intelligence and Neuroscience, Volume 2022, Issue 1, 2022., 2022
Grey wolf optimizer (GWO) is a global search algorithm based on grey wolf hunting activity. However, the traditional GWO is prone to fall into local optimum, affecting the performance of the algorithm. Therefore, to solve this problem, an equalized grey wolf optimizer with refraction opposite learning (REGWO) is proposed in this study.
Lijun Sun   +5 more
wiley   +1 more source

On Neighborhood Tree Search [PDF]

open access: yes, 2012
We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by exploring different ...
Derbel, Bilel, Derbel, Houda
core   +5 more sources

Intelligent System Design Using Hyper-Heuristics

open access: yesSouth African Computer Journal, 2015
Determining the most appropriate search method or artificial intelligence technique to solve a problem is not always evident and usually requires implementation of the different approaches to ascertain this. In some instances a single approach may not be
Nelishia Pillay
doaj   +1 more source

Hyper-heuristik untuk Penyelesaian Masalah Optimasi Lintas Domain dengan Seleksi Heuristik berdasarkan Variable Neighborhood Search

open access: yesKhazanah Informatika, 2019
State-of-the-art dari metode yang digunakan untuk menyelesaikan permasalahan optimasi kombinatorik, yang diketahui sebagai permasalahan NP-hard, adalah meta-heuristics.
Arif Djunaidy   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy