آمار
| تعداد نشریات | 50 |
| تعداد شماره‌ها | 2,232 |
| تعداد مقالات | 20,476 |
| تعداد مشاهده مقاله | 25,274,746 |
| تعداد دریافت فایل اصل مقاله | 22,928,498 |
On the collaboration arc routing problem with time constraint | ||
| Journal of New Researches in Mathematics | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 25 مهر 1402 | ||
| نوع مقاله: research paper | ||
| شناسه دیجیتال (DOI): 10.30495/jnrm.2023.71250.2371 | ||
| نویسندگان | ||
Mohammad Sadegh Shiri   1؛ seyed mostafa khorramizadeh2
| ||
| 1Member of faculty, Department of Mathematics, Arsanjan Branch, Islamic Azad University, Arsanjan, Iran. | ||
| 2تحقیق در عملیات، دانشکده ریاضی، دانشگاه صنعتی شیراز، شیراز، ایران | ||
| چکیده | ||
| In this paper, the collaboration arc routing problem with the time parameter is investigated, which is considered as overtime for carriers and customer service, with the aim of maximizing coalition profits independent of the individual profits of each carrier. In the proposed model, two types of customers are considered as required and shared customers, and serving both is profitable. Service to the first type of customers is mandatory and to the second type of customers according to the amount of profit and time limit is optional. In actual applications, the activity time of the carriers is limited to the carriers' usual working time and can be strictly constrained. In this paper, increasing the activity time of carriers in the form of overtime is considered by considering the related costs, which leads to an increase in the number of customers served and thus makes carriers more profitable. The problem is formulated as an integer linear programming model and is tested on 118 instances of rural postman problem and its results are reported. | ||
| کلیدواژه‌ها | ||
| Arc routing problem؛ Collaboration؛ Overtime؛ profit | ||
|
آمار تعداد مشاهده مقاله: 34 |
||
