A New School Bus Routing Problem Considering Gender Separation, Special Students and Mix Loading: A Genetic Algorithm Approach

Authors

  • Fakhrosadat HashemiYazdi Department of Industrial Management,Faculty of Management and Accounting, Allame Tabatabai University, Tehran, Iran
  • Kaveh Khalili-Damghani Department of Industrial Engineering, South-Tehran Branch, Islamic Azad University, Tehran, Iran
  • Peiman Ghasemi Department of Industrial Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran
Abstract:

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.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

providing a new mathematical model for school service routing with considering gender separation

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

full text

A Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm

Capacitated vehicle routing problem (CVRP) is one of the most well-known and applicable issues in the field of transportation. It has been proved to be an NP-Complete problem. To this end, it is needed to develop a high-performance algorithm to solve the problem, particularly in large scales. This paper develops a novel mathematical model for the CVRP considering the satisfaction level of deman...

full text

A genetic algorithm approach for a dynamic cell formation problem considering machine breakdown and buffer storage

Cell formation problem mainly address how machines should be grouped and parts be processed in cells. In dynamic environments, product mix and demand change in each period of the planning horizon. Incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. In this model, to ensure the reliability of the system in presence of unreliable machine...

full text

A hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center

This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...

full text

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

full text

A genetic algorithm approach for problem

In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 14  issue 2

pages  39- 55

publication date 2021-07-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023