Scatter Search
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Analysis of new variable selection methods for discriminant analysis
- A survey on metaheuristics for stochastic combinatorial optimization
- Improved scatter search for the global optimization of computationally expensive dynamic models
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
- GRASP and path relinking for the max-min diversity problem
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Hyperheuristics
- PSPLIB
- openCFS
- LVB
- TSPLIB
- GRASP
- PERL
- xQx
- GraphBase
- DAGEN
- LSSPER
- RAMP
- J-MEANS
- EVE-OPT
- CLOVES
- PROMETHEE-MD
- COMPASS
- Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- GALib
- OR-Library
- PAES
- Making a state-of-the-art heuristic faster with data mining
- A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem
- NOMADm
- Intelligent-guided adaptive search for the maximum covering location problem
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- Heuristics for the capacitated modular hub location problem
- Design of sensor networks for chemical plants based on meta-heuristics
- An efficient algorithm for unconstrained optimization
- Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- BoneRoute
- GRASP_QAP
- Genocop
- Knapsack
- LKH
- Variable neighborhood scatter search for the incremental graph drawing problem
- CirCut
- JOBSHOP
- MIPTS
- A DE-based scatter search for global optimization problems
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- The scatter search based algorithm for beam angle optimization in intensity-modulated radiation therapy
- VRP
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
- The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
- A comparison of algorithms for finding an efficient theme park tour
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Capital- and resource-constrained project scheduling with net present value optimization
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- An effective heuristic for project scheduling with resource availability cost
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
- Methods to compare expensive stochastic optimization algorithms with random restarts
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- Scatter search for the cutwidth minimization problem
- Multiobjective scatter search for a commercial territory design problem
- A knapsack problem as a tool to solve the production planning problem in small foundries
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Solving the vehicle routing problem with adaptive memory programming methodology
- About extracting dynamic information of unknown complex systems by neural networks
- METSlib
- An evolutionary heuristic for quadratic 0-1 programming
- MACS-VRPTW
- OptQuest
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Multilayer neural networks: an experimental evaluation of on-line training methods
- Coupling ant colony systems with strong local searches
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- The single row facility layout problem: state of the art
- SSPMO
- SITATION
- MOD-DIST
- MENU-OKF
- SDP_S
- TTTPLOTS
- On the performance of scatter search for post-enrolment course timetabling problems
- A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions
- Tabu search
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem
- Scatter search for the minimum leaf spanning tree problem
- GPLAB
- Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- Robust min-max regret covering problems
- AbYSS
- An improved method of particle swarm optimization for path planning of mobile robot
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- RELAX4
- City-courier routing and scheduling problems
- Path relinking for unconstrained binary quadratic programming
This page was built for software: Scatter Search
