6 This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which 7 service requests arrive in real time. The hybrid algorithm combines an exact constraint 8 programming algorithm and a tabu search heuristic. An important component of the tabu 9 search heuristic consists of three scheduling procedures which are executed sequentially. 10 Experiments show that the constraint...

In this research, we have developed a new efficient heuristic algorithm for the dynamic facility layout problem with budget constraint (DFLPB). This heuristic algorithm combines two mathematical programming methods such as discrete event simulation and linear integer programming (IP) to obtain a near optimum solution. In the proposed algorithm, the non-linear model of the DFLP has been changed ...

This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which service requests arrive in real time. The hybrid algorithm combines an exact constraint programming algorithm and a tabu search heuristic. An important component of the tabu search heuristic consists of three scheduling procedures which are executed sequentially. Experiments show that the constraint programmin...

We investigated the problem of constructing the maximum consensus tree from rooted triples. We showed the NP-hardness of the problem and developed exact and heuristic algorithms. The exact algorithm is based on the dynamic programming strategy and runs in O((m + n2)3n) time and O(2n) space. The heuristic algorithms run in polynomial time and their performances are tested and shown by comparing ...

LAO* is a heuristic search algorithm for Markov decision problems that is derived from the classic heuristic search algorithm AO* (Hansen & Zilberstein 1998). It shares the advantage heuristic search has over dynamic programming for simpler classes of problems: it can nd optimal solutions without evaluating all problem states. In this paper , we show that the derivation of LAO* from AO* makes i...

Due to the great importance of operating rooms in hospitals, this paper studies an operating room scheduling problem with open scheduling strategy. According to this strategy, no time slot is reserved for a particular surgeon. The surgeons can use all available time slots. Based on Fei et al.’s model which is considered to be close to reality, we develop a heuristic algorithm to solve it. The i...

This paper considers the multi-item dynamic lot size model where joint business volume discount is applied for all items purchased whenever the total dollar value of an order reaches a certain level. Multi-item discounts are prevalent in practical applications, yet the literature has only considered limited instances of single-item models. We establish the mathematical formulation and design an...