benchmark problems
Airline planning benchmark problems-Part I : characterising networks and demand using limited data
... This paper is the first of two papers entitled “Airline Plan- ning Benchmark Problems”. The primary goal in these papers is to stimulate and facilitate further research in airline planning. There has been ...
16
Airline planning benchmark problems—Part II : passenger groups, utility and demand allocation
... Planning Benchmark Problems”, aimed at developing benchmark data that can be used to stimulate innovation in airline planning, in particular, in flight schedule design and fleet ...33 ...
10
Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms
... of benchmark problems for maximum clique search algo- rithms the plain fact is that there are not enough of ...test problems are too easy for the modern solvers as the sizes of these problems ...
10
Parallel Implementation of Desirability Function-Based Scalarization Approach for Multiobjective Optimization Problems
... seven benchmark problems. These problems are selected based on the complexity against execution time on computation ...study, problems from simple calculation to problems with more ...
10
A fourier pseudospectral method for some computational aeroacoustics problems
... some benchmark problems pertinent to computational ...propagation problems, a new algorithm has been developed and ...propagation problems. For general problems with nonlinear terms, ...
16
Extensible Automated Constraint Modelling
... 32 benchmark problems drawn from the literature and refined them with C ONJURE ...the benchmark problems, representing a proof that the current collection of rules, the rewrite rule language, ...
8
Static Learning Particle Swarm Optimization with Enhanced Exploration and Exploitation using Adaptive Swarm Size
... Abstract: In this paper, a novel Static Learning (SL) strategy to adaptively vary swarm size has been proposed and integrated with Particle Swarm Optimization algorithm. Besides, the whole population has been divided ...
8
A Benchmark Program for Evaluation of Methods For Computing Seismic Response of Coupled Building-Piping/Equipment With Non-Classical Damping
... The program participants performed independent analyses for the defined benchmark problems using both the modal superposition time history method and the response spectrum me[r] ...
8
Adaptive Mutation Rate for the Artificial Bee Colony Algorithm: A Case Study on Benchmark Continuous Optimization Problems
... A major problem with the Artificial Bee Colony (ABC) algorithm is its premature convergence to the locally optimal points of the search space, which often originates from the lack of explorative search capability of its ...
7
A fast, effective local search for scheduling independent jobs in heterogeneous computing environments
... NP-hard problems has shown that so- lutions found by heuristic algorithms can often be improved by applying local search procedures to the solution ...on benchmark problems than other so- lution ...
6
Verification of Continuous Time Recurrent Neural Networks (Benchmark Proposal)
... two benchmark problems proposed for veri- ...these problems is a CTRNN with no inputs that captures the vector field dynamics of a fixed point ...of problems in recurrent neural network ...
12
An Enhanced Ant Colony System for Solving Vehicle Routing Problem with Time Window
... In this paper an enhanced EN_ACS is proposed for solving vehicle routing problem with time window constraint. An extensive computation study for 56 Solomon benchmark problems for 100 customers is done to ...
5
A Modified Particle Swarm Optimization Algorithm for Reliability Redundancy Optimization Problem
... four benchmark problems demonstrate that the proposed MPSO has better robustness, effectiveness and efficiency than other algorithms reported in literatures for solving the reliability redundancy ...
8
Multi-Mode Resource-Constrained Project-Scheduling Problem With Renewable Resources: New Solution Approaches
... of benchmark problems from the ...Boctor’s benchmark problems, the non-greedy rules for mode selection were slightly better than their greedy counterparts, the proposed greedy rule for ...
14
8. Completely Informed Artificial Bee Colony for Multimodal Optimization Problems
... Abstract: Complex multimodal optimization problem have been studied for proposing a novel alternative Artificial Bee Colony Algorithm. The alternate is known to be Completely Informed Artificial Bee Colony (CABC) ...
9
Linear and Quadratic Solid-Shell Elements for Quasi-Static and Dynamic Simulations of Thin 3D Structures: Application to a Deep Drawing Process
... dynamic benchmark problems, as well as a simulation of the deep drawing of a cylindrical cup, have been conducted to assess the performance of these SHB ...
10
Numerical study of the square-root conformation tensor formulation for confined and free-surface viscoelastic fluid flows
... tested benchmark problems at high-Weissenberg number flows, such as the lid-driven cavity flow, the flow around a confined cylinder, the cross-slot flow and the impacting drop free surface ...
23
Capacitated Vehicle Routing Problem Solving through Adaptive Sweep Based Clustering plus Swarm Intelligence based Route Optimization
... Table 5 compares CVRP cost for some standard Sweep based existing clustering methods and adaptive Sweep on A-VRP benchmark problems. Bottom of the table shows average and pairwise win/draw/loss summary over ...
15
Particle swarm optimization for the Steiner tree in graph and delay constrained multicast routing problems
... the benchmark datasets ...routing problems and highly competitive results for the Steiner tree benchmark problems considered in this ...
20
Bat Algorithm with Self adaptive Mutation: A Comparative Study on Numerical Optimization Problems
... Over the last few decades, scientists and researchers have applied the analogy from natural and biological systems, which include the cooperative, distributed and intelligent problem solving techniques found in swarms of ...
7