Browsing Faculty of Engineering by Subject "Tabu search"
Now showing items 1-5 of 5
-
An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
(Elsevier, 2019-11)In this paper, we analyze a variant of the unrelated parallel machine scheduling problem with the objective of minimizing the total tardiness and earliness in the presence of sequence-dependent setups, unequal release ... -
The attractive traveling salesman problem
(Elsevier, 2010-05-16)In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed ... -
A decomposition based metaheuristic approach for solving rapid needs assessment routing problem
(Elsevier, 2021-09)This paper proposes a decomposition based tabu search algorithm for solving multi-cover routing problem in the case of rapid need assessment. Rapid needs assessment aims to evaluate impact of a disaster at different sites ... -
A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
(Springer Nature, 2020-03)In this paper, we introduce a multi-cover routing problem (MCRP), which is motivated by post-disaster rapid needs assessment operations performed to evaluate the impact of the disaster on different affected community groups. ... -
Site selection and vehicle routing for post-disaster rapid needs assessment
(Elsevier, 2017-05)In the immediate aftermath of a disaster, relief agencies perform rapid needs assessment to investigate the effects of the disaster on the affected communities. Since assessments must be performed quickly, visiting all of ...
Share this page