TRB Pubsindex
Text Size:

Title:

School Bus Routing Problem in Large-Scale Networks: New Approach Utilizing Tabu Search on a Case Study in Developing Countries

Accession Number:

01123177

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States
Order URL: http://www.trb.org/Main/Blurbs/Safety_...mergencies_Management_and_Sc_162995.aspx

Find a library where document is available


Order URL: http://worldcat.org/isbn/9780309142700

Abstract:

The vehicle routing problem (VRP) is one of the most complicated optimization mathematical models; the school bus routing problem (SBRP) is an important and practical branch of this problem. Because the number of variables and equations is vast, finding the exact solution for this problem under real conditions is difficult; only heuristic and metaheuristic algorithms can be used to solve it. Recently, the ejection chain method (ECM) has been introduced as a heuristic algorithm that efficiently finds a new neighbor solution. In a case study in developing countries, efficiency of several heuristic algorithms including ECM along with one metaheuristic algorithm—tabu search algorithm (TSA)—is verified for solving large-scale problems. Additionally, capacity limitation, which is usually ignored in VRP and SBRP algorithms such as ECM, is considered as a restricting condition in this study’s models. This study will show that neither the ECM used individually nor its combination with TSA produces feasible solutions for real-life scenarios. The authors have developed two innovative heuristic algorithms, the construction feasible solutions and the changing algorithm, that—when used in combination with TSA and ECM—generate a practical and efficient procedure called the mixed algorithm (MA). Addressing vehicles’ capacity is mainly performed by the construction of feasible solutions (solutions satisfying capacity limitations as well) from the infeasible solutions that might result from the TSA and ECM. The changing algorithm is responsible for generating a local optimum for every resulting feasible solution. Data from bus routing of a middle school were used to show the effectiveness of the MA.

Monograph Accession #:

01149179

Report/Paper Numbers:

09-0660

Language:

English

Authors:

Rashidi, Taha H
Zokaei-Aashtiani, Hedayat
Mohammadian, Abolfazl (Kouros)

Pagination:

pp 140-147

Publication Date:

2009

Serial:

Transportation Research Record: Journal of the Transportation Research Board

Issue Number: 2137
Publisher: Transportation Research Board
ISSN: 0361-1981

ISBN:

9780309142700

Media Type:

Print

Features:

Figures (5) ; References (14) ; Tables (1)

Uncontrolled Terms:

Subject Areas:

Highways; Planning and Forecasting; I72: Traffic and Transport Planning

Files:

TRIS, TRB, ATRI

Created Date:

Jan 30 2009 4:54PM

More Articles from this Serial Issue: