Sciweavers

6894 search results - page 85 / 1379
» Generation Problems
Sort
View
CEC
2005
IEEE
15 years 12 months ago
Evolving dispatching rules for solving the flexible job-shop problem
We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
Nhu Binh Ho, Joc Cing Tay
CIG
2005
IEEE
15 years 12 months ago
Co-evolutionary Strategies for an Alternating-Offer Bargaining Problem
Abstract- In this paper, we apply an Evolutionary Algorithm (EA) to solve the Rubinstein’s Basic AlternatingOffer Bargaining Problem, and compare our experimental results with it...
Nanlin Jin, Edward P. K. Tsang
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 11 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
WEA
2004
Springer
128views Algorithms» more  WEA 2004»
15 years 11 months ago
GRASP with Path-Relinking for the Quadratic Assignment Problem
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...
ICNC
2009
Springer
15 years 11 months ago
Vehicle Routing Problem with Time Windows: A Hybrid Particle Swarm Optimization Approach
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
Xiaoxiang Liu, Weigang Jiang, Jianwen Xie