Let's Connect
Follow Us
Watch Us
(+385) 1 2380 262
journal.prometfpz.unizg.hr
Promet - Traffic&Transportation journal

Accelerating Discoveries in Traffic Science

Accelerating Discoveries in Traffic Science

PUBLISHED
-
LICENSE
Copyright (c) 2012 Jun-Hyuk Kim, Soonhu Soh

Designing Hub-and-Spoke School Bus Transportation Network: A Case Study of Wonkwang University

Authors:Jun-Hyuk Kim, Soonhu Soh

Abstract

This paper provides a case study of hub-and-spoke school bus transportation network design. The case study here utilizes a mathematical model that is the P-median optimization model to determine optimal hub locations. The P-median problem is a combinatorial optimization problem that includes many binary variables and constraints. The selected objective of the model is to minimize the total travel time satisfying other operational constraints. To elevate usability of decision making in the future, we implement the simulation model through the template model in spreadsheet platform. The developed model is used as a future reference to find operational directions of school bus managing policy and also tested on the case of Wonkwang University.

Keywords:hub-and-spoke network, school bus, P-median model, case study

References

  1. Aykin, T.: The hub location and routing problem, European Journal of Operational Research, Vol. 83, No. 1, 1995, pp. 200-219

    Ernst, A. T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem, Location Science, Vol. 4, No.3, 1996, pp. 139-154

    Elhedhli, S., Hu, F. X.: Hub-and-spoke network design with congestion, Computers and Operations Research, Vol. 32, No. 6, 2005, pp. 1615-1632

    Kim, J. H.: An Agent-based Model for Airline Evolution, Competition, and Airport Congestion, Ph.D. thesis, Dept. of Civil & Environmental Engineering, Virginia Polytechnic Institute & State University in Blacksburg, Virginia, U.S.A., 2005

    Campbell, J. F.: Integer programming formulations of discrete hub location problems, European Journal of Operational Research, Vol. 72, No. 2, 1994, pp. 387-405

    Tuljak-Suban, D., Twrdy, E.: Decision Support for Optimal Repositioning of Containers in a Feeder System,

    PROMET – Traffic & Transportation, Vol. 20, No. 2, 2008, pp. 71-77

    Shin, K. S., Kim, J. H., Kim, Y. K.: A Two-Leveled Multi-objective Symbiotic Evolutionary Algorithm for the Hub and Spoke Location Problem, Journal of Advanced Transportation, Vol. 43, No. 4, 2009, pp. 391-411

    Bodin, L. D., Berman, L.: Routing and scheduling of school buses by computer, Transportation Science, Vol. 13, No. 2, 1979, pp. 113-129

    Bowerman, R., Hall, B., Calamai, P.: A multi-objective optimization approach to urban school bus routing: formulation and solution method, Transportation Research Part A: Policy and Practice, Vol. 29, No. 2, 1995, pp. 107-123

    Braca, J., Bramel, J., Posner, B., Simchi-Levi, D.: A computerized approach to the New York City school bus routing problem, IIE Transactions, Vol. 29, No. 8, 1997, pp. 693-702

    Li, L., Fu, Z.: The school bus routing problem: A case study, Journal of the Operational Research Society, Vol. 53, No. 5, 2002, pp. 552-558

    Angel, R. D., Caudle, W. L., Noonan, R., Whinston, A.: Computer-assisted school bus scheduling, Management Science, Vol. 18, No. 6, 1972, pp. 279-288

    Bookbinder, J. H., Edwards, S. H.: School-bus routing for program scheduling, Computers and Operations Research, Vol. 17, No. 1, 1990, pp. 79-94

    Park, J., Kim, B.: The school bus routing problem: A review, European Journal of Operational Research, Vol. 202, No. 2, 2010, pp. 311-319

    Melkote, S., Daskin, M. S.: Capacitated facility location/network design problems, European Journal of Operational Research, Vol. 129, No. 3, 2001, pp. 481-495

    Revelle, C. S., Laporte, G.: The plant location problem: New models and research prospects, Operations Research, Vol. 44, No. 6, 1996, pp. 864-874

    Ebery, J., Krishnamoorthy, M., Ernst, A., Boland, N.: The capacitated multiple allocation hub location problem: formulations and algorithms, European Journal of Operational Research, Vol. 120, No. 3, 2000, pp. 614-631

    Beasley, J. E.: A note on solving large p-median problems, European Journal of Operational Research, Vol. 21, No.2, 1985, pp. 270-273

    Dai, Z., Cheung, T. Y.: A new heuristic approach for the p-median problem, Journal of Operational Research Society, Vol. 48, No. 9, 1997, pp. 950-960

    Alp, O., Erkut, E., Drezner, D.: An efficient genetic algorithm for the p-median problem, Annals of Operations Research, Vol. 122, No. 1-4, 2003, pp. 21-42

    Chaudhry, S. S., He, S., Chaudhry, P. E.: Solving a class of facility location problems using genetic algorithm, Expert Systems, Vol. 20, No. 2, 2003, pp. 86-91

    Topcuoglu, H., Corut, F., Ernis, M., Yilmaz, G.: Solving the uncapacitated hub location problem using genetic algorithms, Computers and Operations Research, Vol. 32, No. 4, 2005, pp. 967-984

    Mladenovic, N., Brimberg, J., Hansen, P., Moreno-Perez, J. A.: The p-median problem: A survey of metaheuristic approaches, European Journal of Operational Research, Vol. 179, No. 3, 2007, pp. 927-939

    Frontline Systems Inc., Risk Solver Platform for Excel, 2010 (Available from: http://www.solver.com/platform/risk-solver-platform.htm)

Show more

SPECIAL ISSUE IS OUT

Guest Editor: Eleonora Papadimitriou, PhD

Editors: Marko Matulin, PhD; Dario Babić, PhD; Marko Ševrović, PhD.

RECENT PAPERS

Browse through the selection of our recent research


Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal