Skip to main content

MIP neighborhood search heuristics for a service network design problem with design-balanced requirements

Abstract

Service network design problems are used to address a variety of services in transportation and logistics planning. In the present paper, we consider the service network design problem with design-balanced requirements. This problem is particularly relevant to operations for consolidation transportation systems and determines the transportation network configuration and the characteristics of the corresponding services. We present a solution approach that combines a capacity scaling procedure for finding an initial feasible solution and a MIP neighborhood search for improving the solutions. Computational experiments on benchmark instances show that the proposed heuristic finds high-quality solutions in a short computation time.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3

References

  • Andersen, J., Crainic, T.G., Christiansen, M.: Service network design with management and coordination of multiple fleets. Eur. J. Oper. Res. 193(2), 377–389 (2009)

    MathSciNet  Article  Google Scholar 

  • Andersen, J., Christiansen, M., Crainic, T.G., Grønhaug, R.: Branch and price for service network design with asset management constraints. Transp. Sci. 45(1), 33–49 (2011)

    Article  Google Scholar 

  • Bai, R., Kendal, G., Li, J.: An efficient guided local search approach for service network design problem with asset balancing. ICLSIM 1, 110–115 (2010)

    Google Scholar 

  • Bai, R., Kendal, G., Qu, R., Atkin, J.: Tabu assisted guided local search approaches for freight service network design. Inf. Sci. 189(15), 266–281 (2012)

    Article  Google Scholar 

  • Bai, R., Wallace, S.W., Li, J., Chong, A.Y.: Stochastic service network design with rerouting. Transp. Res. Part B 60, 50–65 (2014)

    Article  Google Scholar 

  • Bai, R., Woodward, J., Subramanian, N., Cartlidge, J.: Optimisation of transportation service network using k-node large neighbourhood search. Comput. Oper. Res. 89, 193–205 (2018)

    MathSciNet  Article  Google Scholar 

  • Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Network design. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 311–334. Wiley, New York (1997)

    Google Scholar 

  • Boland, N., Hewitt, M., Marshall, L., Savelsbergh, M.: The continuous-time service network design problem. Oper. Res. 65, 1115–1428 (2017)

    MathSciNet  Article  Google Scholar 

  • Chouman, M., Crainic, T.G.: MIP-based tabu search for service network design with design-balanced requirements. Tech. Rep. CIRRELT-2011-68, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, Université de Montréal (2011)

  • Chouman, M., Crainic, T.G.: Cutting-plane matheuristic for service network design with design-balanced requirements. Transp. Sci. 49(1), 99–113 (2015)

    Article  Google Scholar 

  • Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Maritime transportation. In: C. Barnhart, G. Laporte (eds.) Handbooks in Operations Research and Management Science, Vol. 14, pp. 189–284. North Holland (2007)

  • Crainic, T., Hewitt, M., Toulouse, M., Vu, D.: Service network design with resource constraints. Transp. Sci. 50(4), 1380–1393 (2016)

    Article  Google Scholar 

  • Crainic, T.G.: Long-haul freight transportation. In: Hall, R.W. (ed.) Handbook of Transportation Science, pp. 451–516. Kluwer Academic Publishers, Norwell, MA (2003)

    Chapter  Google Scholar 

  • Crainic, T.G., Gendreau, M.: A scatter search heuristic for the fixed-charge capacitated network design problem. In: K.F. Doerner, M. Gendreau, P. Greistorfer, W. Gutjahr, R.F. Hartl, M. Reimann (eds.) Metaheuristics, pp. 25–40. Springer (2007)

  • Crainic, T.G., Hewitt, M., Toulouse, M., Vu, D.M.: Scheduled service network design with resource acquisition and management. EURO J. Transp. Logist. 7, 277–309 (2018)

    Article  Google Scholar 

  • Katayama, N.: A combined capacity scaling and local branching approach for capacitated multi-commodity network design problem. Far East J. Appl. Math. 92, 1–30 (2015a)

    Article  Google Scholar 

  • Katayama, N.: A combined matheuristics for service network design problem. Int. Fed. Logist. SCM Syst. 8, 11–20 (2015b)

    Google Scholar 

  • Katayama, N.: A combined fast greedy heuristic for the capacitated multicommodity network design problem. J. Oper. Res. Soc. 70(11), 1983–1996 (2019)

    Article  Google Scholar 

  • Li, X., Wei, K., Aneja, Y., Tian, P., Cui, Y.: Matheuristics for the single-path design-balanced service network design problem. Comput. Oper. Res. 77, 141–153 (2017)

    MathSciNet  Article  Google Scholar 

  • Minoux, M.: Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19, 313–360 (1989)

    MathSciNet  Article  Google Scholar 

  • Momeni, M., Sarmadi, M.: A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design. Netw. Sp. Econ. 16(2), 447–468 (2016)

    MathSciNet  Article  Google Scholar 

  • Pedersen, M.B., Crainic, T.G., Madsen, O.B.G.: Models and tabu search metaheuristics for service network design with asset-balance requirements. Transp. Sci. 43, 158–177 (2009)

    Article  Google Scholar 

  • Pochet, Y., Vyve, M.V.: A general heuristic for production planning problems. J. Comput. 16, 316–327 (2004)

    MathSciNet  MATH  Google Scholar 

  • Scott, A.J.: The optimal network problem: some computational procedures. Transp. Res. 3, 201–210 (1969)

    Article  Google Scholar 

  • Vu, D.M., Crainic, T.G., Toulouse, M.: A three-stage matheuristic for the capacitated multi-commodity fixed-cost network design with design-balance constraints. J. Heuristics 19, 757–795 (2013)

    Article  Google Scholar 

  • Wang, X., Crainic, T.G., Wallace, S.W.: Stochastic network design for planning scheduled transportation services: the value of deterministic solutions. Inf. J. Comput. 31 (2019a). https://doi.org/10.1287/ijoc.2018.0819

  • Wang, Z., Qi, M., Cheng, C., Zhang, C.: A hybrid algorithm for large-scale service network design considering a heterogeneous fleet. Eur. J. Oper. Res. 276, 483–494 (2019b)

    MathSciNet  Article  Google Scholar 

  • Wieberneit, N.: Service network design for freight transportation: a review. OR Spectr. 30(1), 77–112 (2008)

    MathSciNet  Article  Google Scholar 

  • Yaghini, M., Karimi, M., Rahbar, M., Sharifitabaro, M.H.: A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem. Inf. J. Comput. 27(1), 45–58 (2016)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by JSPS KAKENHI Grant Number JP17K01268.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Naoto Katayama.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Katayama, N. MIP neighborhood search heuristics for a service network design problem with design-balanced requirements. J Heuristics 26, 475–502 (2020). https://doi.org/10.1007/s10732-020-09437-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-020-09437-x

Keywords

  • Service network design
  • Capacity scaling
  • MIP
  • Neighborhood search