# A Hybrid Tabu Search and Constraint

نویسندگان

##### چکیده

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 programming algorithm is sometimes able to accept 11 or reject incoming requests, and that the hybrid method outperforms each of the two 12 algorithms when they are executed alone. 13

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنیداگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

ورود##### منابع مشابه

## A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem

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...

متن کامل## A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem

Since their introduction, local search algorithms – and in particular tabu search algorithms – have consistently represented the state-of-the-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a...

متن کامل## Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method

In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...

متن کامل## Combining Constraint Programming and Local Search for Job-Shop Scheduling

Since their introduction, local search algorithms have consistently represented the state-ofthe-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a simple hybrid algorithm for job-shop scheduli...

متن کامل## An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations

Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...

متن کاملافزودن به منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنیداگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

ورود##### عنوان ژورنال:

دوره شماره

صفحات -

تاریخ انتشار 2009