Constructive heuristic
A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained. It differs from local search heuristics which start with a complete solution and then try to improve the current solution further via local moves. Examples of some famous problems that are solved using constructive heuristics are the flow shop scheduling,[1] the vehicle routing problem[2] and the open shop problem.[3]
See also[]
- Evolutionary algorithms
- Genetic algorithms
- Local search (optimization)
- Metaheuristics
References[]
- ^ "Koulamas, Christos. "A new constructive heuristic for the flowshop scheduling problem." European Journal of Operational Research 105.1 (1998): 66-71". Cite journal requires
|journal=(help) - ^ Petch, R.J; Salhi, S. (2003). "Petch, Russel J., and Said Salhi. "A multi-phase constructive heuristic for the vehicle routing problem with multiple trips." Discrete Applied Mathematics 133.1 (2003): 69-92". Discrete Applied Mathematics. 133 (1–3): 69–92. doi:10.1016/S0166-218X(03)00434-7.
- ^ "Bräsel, H., T. Tautenhahn, and F. Werner. "Constructive heuristic algorithms for the open shop problem." Computing 51.2 (1993): 95-110". Cite journal requires
|journal=(help)
Categories:
- Optimization algorithms and methods
- Heuristics