در هنگام جستجو کلمه در قسمت عنوان میتوانید کلمات مورد جستجو را با کاراکتر (-) جدا کنید.
کاربرد نوع شرط:
- جایگاه : پژوهشی
- مجله: Journal of Optimization in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Genetic Algorithm,Gender separation,School bus routing problem,mixed integer mathematical programming,Mix loading
- چکیده:
- چکیده انگلیسی: In developing countries, whereas the urban bus network is a major part of public transportation system, it is necessary to try to find the best design and routing for bus network. Optimum design of school bus routes is very important. Non-optimal solutions for this problem may increase traveling time, fuel consumption, and depreciation rate of the fleet. A new bus routing problem is presented in this study. A multi-objective mixed integer model is proposed to handle the associated problem. Minimization of transportation cost as well as traveling time is the main objectives. The main contributions of this paper are considering gender separation as well as mixed-loading properties in the school bus routing problem. Moreover, special and handicapped students are considered in this problem. The proposed model is applied in a real case study including 4 schools in Tehran. The results indicate the efficiency of the proposed model in comparison with the existing system. This comparison shows that the students’ travelling time is reduced by 28% for Peyvand middle smart school, 24% for Tehran international school, 13% for Hemmat School and 21% for Nikan High school. A customized Genetic Algorithm (GA) is proposed to solve the model. Penalty functions are used to handle the several constraints of the problem in Genetic Algorithm. The results justify the applicability and efficacy of the both proposed model and solution approach.
- انتشار مقاله: 28-10-1398
- نویسندگان: Alireza Rashidi Komijan,Peiman Ghasemi,Kaveh Khalili-Damghani,Fakhrosadat HashemiYazdi
- مشاهده
- جایگاه : پژوهشی
- مجله: Journal of Industrial Engineering International
- نوع مقاله: Journal Article
- کلمات کلیدی: Mathematical Modeling,Binary programming,Examination timetabling problem
- چکیده:
- چکیده انگلیسی: Examination timetabling problem (ETP) is one of the most important issues in universities. An improper timetable
may result in students' dissatisfaction as it may not let them study enough between two sequential exams. In
addition, the many exams to be scheduled, the large number of students who have taken different courses, the
limited number of rooms, and some constraints such as no conflict in a single student's exams make it very difficult
to schedule experimentally. A mathematical programming model is required to formulate such a sophisticated
problem. In this paper, a new binary model is developed for ETP. The novelty of the paper can be discussed in two
directions. The first one is that a course can be offered more than once in a semester. If a course is requested by a
few students, then it is enough to be offered once. If the number of students requesting a course is more than the
maximum number of students who are allowed to attend a single class, then the course is multi-offered. The
second novelty is that sharing a room for two simultaneous exams is allowed. Also, the model considers some hard
and soft constraints, and the objective function is set in such a way that soft constraints are satisfied as much as
possible. Finally, the model is applied in a sample department and is solved by GAMS- انتشار مقاله: 10-07-1399
- نویسندگان: Alireza Rashidi Komijan,Mehrdad Nouri Koupaei
- مشاهده
- جایگاه : پژوهشی
- مجله: Advances in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Gender separation,Integer linear programming,School bus routing problem,Special students
- چکیده:
- چکیده انگلیسی: In our country, school bus routes are determined by experiments of driver without considering the scientific optimum route and location. Traversing additional routes will always result an increase in vehicle movements and fuel consumption and enormous costs. Hence, this paper will study the school bus routing in Tehran considering special students and a model will be presented to minimize traveling distance and to prevent repetitive crossings through the bus stops and to determine the shortest routes by presenting a way to propel several students to a bus stop. The proposed model will solve via GAMS software. Because the model is NP-Hard, the Genetic algorithm is used to solve the large scale problem. The contribution of this paper is to consider gender separation in schools and buses. To solve this problem, an integer linear programming model is developed. The conclusion indicates a decrease in transportation time.
- انتشار مقاله: 15-09-1394
- نویسندگان: Alireza Rashidi Komijan,Peyman Ghasemi
- مشاهده