An efficient hybrid search algorithm for various optimization problems
dc.contributor.author | Vanhoucke, Mario | |
dc.date.accessioned | 2017-12-02T14:23:29Z | |
dc.date.available | 2017-12-02T14:23:29Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12127/1960 | |
dc.description.abstract | This paper describes a detailed study of a recursive search algorithm for different optimization problems. Although the algorithm has been originally developed for a project scheduling problem with financial objectives, we show that it can be extended to many other application areas and therefore, can serve as a sub-procedure for various optimization problems. The contribution of the paper is threefold. First, we present a hybrid recursive search procedure for the project scheduling problem with net present value maximization and compare it with state-of-the-art procedures by means of computational tests. Second, we show how the procedure can be adapted to two other application areas: project scheduling with work continuity minimization and the open pit mining problem. Last, we highlight some future research areas where this hybrid procedure might bring a promising contribution. | |
dc.language.iso | en | |
dc.subject | Programme & Portfolio Management | |
dc.title | An efficient hybrid search algorithm for various optimization problems | |
dc.source.issue | 7 | |
dc.source.numberofpages | 21 | |
vlerick.knowledgedomain | Operations & Supply Chain Management | |
vlerick.supervisor | ||
vlerick.typecomm | Working paper | |
vlerick.vlerickdepartment | TOM | |
dc.identifier.vperid | 58614 | |
dc.identifier.vpubid | 2197 |