constructive heuristic

{{Short description|Type of heuristic method}}

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,{{cite journal|title=Koulamas, Christos. "A new constructive heuristic for the flowshop scheduling problem." European Journal of Operational Research 105.1 (1998): 66-71.}} the vehicle routing problem{{cite journal|last1=Petch|first1=R.J|last2=Salhi|first2=S.|year=2003|title=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.|journal=Discrete Applied Mathematics|volume=133|issue=1–3|pages=69–92|doi=10.1016/S0166-218X(03)00434-7|doi-access=}} and the open shop problem.{{cite journal|title=Bräsel, H., T. Tautenhahn, and F. Werner. "Constructive heuristic algorithms for the open shop problem." Computing 51.2 (1993): 95-110.}}