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 constructive heuristics developed for famous problems are: flow shop scheduling,^[1] vehicle routing problem,^[2] open shop problem.^[3]

References

^ "Koulamas, Christos. "A new constructive heuristic for the flowshop scheduling problem." European Journal of Operational Research 105.1 (1998): 66-71". {{cite journal}}: Cite journal requires |journal= (help)
^ "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". {{cite journal}}: Cite journal requires |journal= (help)
^ "Bräsel, H., T. Tautenhahn, and F. Werner. "Constructive heuristic algorithms for the open shop problem." Computing 51.2 (1993): 95-110". {{cite journal}}: Cite journal requires |journal= (help)

[1] "Koulamas, Christos. "A new constructive heuristic for the flowshop scheduling problem." European Journal of Operational Research 105.1 (1998): 66-71". {{cite journal}}: Cite journal requires |journal= (help)

[2] "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". {{cite journal}}: Cite journal requires |journal= (help)

[3] "Bräsel, H., T. Tautenhahn, and F. Werner. "Constructive heuristic algorithms for the open shop problem." Computing 51.2 (1993): 95-110". {{cite journal}}: Cite journal requires |journal= (help)

[1]

[2]

[3]

See also

References