Route optimization of Muafakat Johor bus service

Zaitul Marlizawati Zainuddin, Azrul Naim Azhar

Abstract


Muafakat Johor Bus Service is a service provided by the Johor State Government for free to all citizens. The aim of this service is to reduce the cost of living and also to facilitate and improve the quality of public transport services to citizens in the routes that have been identified. Therefore, any reduction in the operation cost of this bus service will be of help to the government. On the other hand, in order to improve the quality of public transport services, the bus is expected to arrive at the respective stops at the time specified by the schedule. It is seen that one way of achieving these goals is through the route design of the bus service. Thus, in this study, Vehicle Routing Problem with Time Window (VRPTW) is used to model the route of Muafakat Johor bus service under consideration. The model was solved by using LINGO which is an efficient software for solving optimization models. The optimal route is obtained with the optimal number of buses is two. By considering the time window constraint, the current practice of one bus covering all the stops is found to be infeasible.


Keywords


Bus Service; Vehicle Routing Problem with Time Window; Route Design

Full Text:

PDF

References


Mazzeo, S., and Loiseau, I. (2004). An ant colony algorithm for the capacitated vehicle routing. Electronic Notes on Discrete Mathematics,18, 181-186.

Kallehauge, B., Larsen, J., Madsen, O.B.G., and Solomon, M.M. (2005). Vehicle Routing Problem with Time Windows. In: Kallehauge, B., Larsen, J., Madsen, O.B.G., and Solomon, M.M. (Eds.), Column Generation, 67-98. US: Springer.

Solomon, M.M., and Desrosiers, J. (1988). Time window constrained routing and scheduling problems. Transportation Science, 22, 1-14.

Braysy, O., and Gendreau, M. (2005). Vehicle Routing Problem with Time Window, Part 1: Route Construction and Local Search Algorithms. Transportation Science, 39, 104-118.

Yeun, L. C., Ismail, W. R., Omar, K., and Zirour, M. (2008). Vehicle Routing Problem : Models and Solutions. Journal of Quality Measurement and Analysis, 4(1), 205-218.

Tas, D., Jabali, O., and Woensel, T. V. (2013). A Vehicle Routing Problem with Flexible Time Windows. Beta Working Paper series, 403, 1-32.

Laporte, G. (1992). The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms. European Journal of Operational Research, 59, 345-358.


Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 eProceedings Chemistry

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Copyright © 2016 Department of Chemistry, Universiti Teknologi Malaysia.

Disclaimer : This website has been updated to the best of our knowledge to be accurate. However, Universiti Teknologi Malaysia shall not be liable for any loss or damage caused by the usage of any information obtained from this web site.
Best viewed: Mozilla Firefox 4.0 & Google Chrome at 1024 × 768 resolution.