A genetic local search approach to the bid evaluation problem in an automated contracting environment
In automated contracting, bid evaluation is a difficult task because finding the optimal set of bids which can be composed into a feasible plan requires taking into account time constraints and risk estimates in addition to price. A simulated annealing-based approach has been implemented to deal wit...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | text |
| اللغة: | English |
| منشور في: |
Animo Repository
2002
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/etd_masteral/2920 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | De La Salle University |
| اللغة: | English |
| الملخص: | In automated contracting, bid evaluation is a difficult task because finding the optimal set of bids which can be composed into a feasible plan requires taking into account time constraints and risk estimates in addition to price. A simulated annealing-based approach has been implemented to deal with evaluating bids of complex plans. This research offers an alternative approach to the bid evaluation problem based on the genetic local search (GLS) method. GLS has been shown to be very effective for several combinatorial optimization problems and for some cases proved to be superior to other search approaches including simulated annealing. |
|---|