کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
430678 688111 2015 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Scalability issues in optimal assignment for carpooling
ترجمه فارسی عنوان
مسائل مربوط به مقیاس پذیری در انتساب بهینه برای کارپوپینگ
کلمات کلیدی
نظریه گراف، جنگل ستاره، پارتیشن ستاره، مدل سازی مبتنی بر عامل، مقیاس پذیری، شبکه های پویا، یادگیری، مدل مبتنی بر فعالیت
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی

Carpooling for commuting can save cost and helps in reducing pollution. An automatic Web based Global CarPooling Matching Service (GCPMS) for matching commuting trips has been designed. The service supports carpooling candidates by supplying advice during their exploration for potential partners. Such services collect data about the candidates, and base their advice for each pair of trips to be combined, on an estimate of the probability for successful negotiation between the candidates to carpool. The probability values are calculated by a learning mechanism using, on one hand, the registered person and trip characteristics, and on the other hand, the negotiation feedback. The problem of maximizing the expected value of carpooling negotiation success was formulated and was proved to be NP-hard. In addition, the network characteristics for a realistic case have been analyzed. The carpooling network was established using results predicted by the operational FEATHERS activity based model for Flanders (Belgium).

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computer and System Sciences - Volume 81, Issue 3, May 2015, Pages 568–584
نویسندگان
, , , , , , , ,