A new adaptive multi-start technique for combinatorial global optimizations☆
References (27)
- et al.
Toward a general theory of adaptive walks on rugged landscapes
J. Theoret. Biol.
(1987) - et al.
Evolution algorithms in combinatorial optimization
Parallel Comput.
(1988) A Connectionist Machine for Genetic Hillclimbing
(1987)- et al.
Ultrametricity, frustration and the graph colouring problem
J. Phy. A: Math. General
(1989) Toward practical ‘neural’ computation for combinatorial optimization problems
Fast algorithms for geometric traveling salesman problems
ORSA J. Comput.
(1992)- et al.
Best-so-far vs. where-you-are: implications for optimal finite-time annealing
Systems Control Lett.
(1994) - et al.
On the big valley and adaptive multi-start for discrete global optimizations
Random Graphs
(1985)- et al.
Graph bisection algorithms with good average case behavior
Combinatorica
(1987)
Optimization of globally convex functions
SIAM J. Control Optim.
Local optimization and the traveling salesman problem
Optimization by simulated annealing: an experimental evaluation, Part I, graph partitioning
Oper. Res.
Cited by (260)
A cooperative energy efficient truck platoon lane-changing model preventing platoon decoupling in a mixed traffic environment
2024, Journal of Intelligent Transportation Systems: Technology, Planning, and OperationsSpeedup vs. quality: Asynchronous and cluster-based distributed adaptive genetic algorithms for ordered problems
2021, Parallel ComputingCitation Excerpt :The difficultly of this is highlighted in studies of the fitness landscape. Early works theorised a “big-valley” in the fitness landscape where local optima clustered around a global optimum in both the TSP [12] and scheduling problems [13]. This suggests that there are many local optima that are easy to escape from.
Two-level Tabu-predatory search for schedule risk control of IT outsourcing projects
2019, Information SciencesCitation Excerpt :The involved parameters in TLTPS are the same as those in the original PS. Part of the parameter values should be adjusted, and the other parameter values are retained in accordance with the literature [2,34]. When the variable size of the algorithm is n, all parameter values are designed on the basis of the following statements.
A no-delay single machine scheduling problem to minimize total weighted early and late work
2023, Optimization LettersDirected percolation criticality in eternal inflation
2023, Physical Review DInitialization of metaheuristics: comprehensive review, critical analysis, and research directions
2023, International Transactions in Operational Research
- ☆
Partial support for this work was provided by ARO DAAK-70-92-K-0001, ARO DAAL-03-92-G-0050, NSF MIP-9110696, and NSF Young Investigator Award MIP-9257982.