Results 31 to 40 of about 2,844,778 (299)
Simulated annealing with large-neighborhood search for two-echelon location routing problem
Considering the multi-level distribution network has becoming more and more common, a two-echelon location routing problem (2E-LRP) model was established based on minimum total cost objective function.
LI Xiang, LI Su-jian, LI Hong
doaj +1 more source
Model and solution for the traveling salesman problem with multiple time windows [PDF]
This paper applies the multi-time window traveling salesman problem to not only optimize the logistics cost, but also effectively endow users with multiple discrete idle optional time periods to meet the time requirements of just-in-time production.
Zhang Xiaoling, Ni Yueli
doaj +1 more source
A Phoenix++ Based New Genetic Algorithm Involving Mechanism of Simulated Annealing
Genetic algorithm is easy to fall into local optimal solution. Simulated annealing algorithm may accept nonoptimal solution at a certain probability to jump out of local optimal solution.
Luokai Hu +4 more
doaj +1 more source
Much of the previous work in D-optimal design for regression models with correlated errors focused on polynomial models with a single predictor variable, in large part because of the intractability of an analytic solution.
Chang Li, Daniel C. Coster
doaj +1 more source
Model Retrieval Based on Simulated Annealing Algorithm
In order to retrieve the most similar CAD(Computer Aided Design) model from model library, simulated annealing algorithm is used to retrieve similar models.
GAO Xueyao, TAN Tao, ZHANG Chunxiang
doaj +1 more source
Sensor placement optimization of civil engineering structures using GA–SA algorithm [PDF]
Effectively and accurately obtaining the structure and status information of civil engineering by optimizing the configuration of sensors is the basis for the monitoring of civil engineering structures, and it is also the key content for subsequent ...
Feng Li, Binbin Shi
doaj +1 more source
Simulated Annealing Algorithm for Graph Coloring
The goal of this Random Walks project is to code and experiment the Markov Chain Monte Carlo (MCMC) method for the problem of graph coloring. In this report, we present the plots of cost function \(\mathbf{H}\) by varying the parameters like \(\mathbf{q}\) (Number of colors that can be used in coloring) and \(\mathbf{c}\) (Average node degree).
Alper Köse +2 more
openaire +3 more sources
Algoritma Simulated Annealing untuk Menentukan Rute Kendaraan Heterogen (Studi Kasus)
Permasalahan transportasi dalam supply chain management sangat penting untuk dikaji karena dapat menimbulkan biaya logistik yang sangat besar. Salah satu cara untuk mengurangi biaya transportasi adalah dengan penentuan rute kendaraan atau dikenal dengan
Andriansyah Andriansyah +2 more
doaj +1 more source
Hybrid evolutionary optimization algorithm MPSO-SA [PDF]
This paper proposes a new method for a modified particle swarm optimization algorithm (MPSO) combined with a simulated annealing algorithm (SA). MPSO is known as an efficient approach with a high performance of solving optimization problems in many ...
El Hami N., Ellaia R., Itmi M.
doaj +1 more source
Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem. [PDF]
The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river.
Absalom E Ezugwu +3 more
doaj +1 more source

