Dear users,
This is our new website
(we are launching the new one in order to improve our communication and provide better services to the editors and authors. So we will upload all data soon).


Please click here to visit our current website, and also to submit your paper
:
 
www.ijsom.com 


 Thanks for your patience during relocation.

Feel free to contact us via info@ijsom.com and ijsom.info@gmail.com

   [Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Contact us::
Site Facilities::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
Indexing Databases

AWT IMAGE
AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

..
:: Accepted articles (In Press) ::
Back to the articles list Back to browse issues page
Iterated Local Search Algorithm with Strategic Oscillation for School Bus Routing Problem with Bus Stop Selection
Mohammad Saied Fallah Niasar * 1, Luca Talarico2 , Mehdi Sajadifar3 , Amir Hosein Tayebi2
1- Department of Engineering Management, Faculty of Applied Economics, University of Antwerp, Belgium , fallah.pasco@gmail.com
2- Department of Engineering Management, Faculty of Applied Economics, University Antwerp, Belgium
3- Department of Industrial Engineering, University of Science and Culture, Tehran, Iran
Abstract:   (16494 Views)
The school bus routing problem (SBRP) represents a variant of the well-known vehicle routing problem. The main goal of this study is to pick up students allocated to some bus stops and generate routes, including the selected stops, in order to carry students to school. In this paper, we have proposed a simple but effective metaheuristic approach that employs two features: first, it utilizes large neighborhood structures for a deeper exploration of the search space; second, the proposed heuristic executes an efficient transition between the feasible and infeasible portions of the search space. Exploration of the infeasible area is controlled by a dynamic penalty function to convert the unfeasible solution into a feasible one. Two metaheuristics, called N-ILS (a variant of the Nearest Neighbourhood with Iterated Local Search algorithm) and I-ILS (a variant of Insertion with Iterated Local Search algorithm) are proposed to solve SBRP. Our experimental procedure is based on the two data sets. The results show that N-ILS is able to obtain better solutions in shorter computing times. Additionally, N-ILS appears to be very competitive in comparison with the best existing metaheuristics suggested for SBRP
Keywords: School Bus Routing Problem, Combinatorial Optimization, Iterated Local Search Algorithm, Strategic Oscillation
     
Type of Study: مقاله پژوهشی |
ePublished: 2017/01/15
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA


XML     Print



Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Back to the articles list Back to browse issues page
International Journal of Supply and Operations Management International Journal of Supply and Operations Management
Persian site map - English site map - Created in 0.09 seconds with 41 queries by YEKTAWEB 4665