Design-balanced capacitated multicommodity network design with heterogeneous assets

被引:25
|
作者
Li, Xiangyong [1 ]
Wei, Kai [1 ]
Aneja, Y. P. [2 ]
Tian, Peng [3 ]
机构
[1] Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China
[2] Univ Windsor, Odette Sch Business, Windsor, ON, Canada
[3] Shanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200052, Peoples R China
关键词
Service network design; Design-balanced constraints; Heterogeneous assets; Tabu search; Heuristic; VEHICLE-ROUTING PROBLEM; CYCLE-BASED NEIGHBORHOODS; TRANSPORTATION; ALGORITHM;
D O I
10.1016/j.omega.2016.05.001
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Management of assets plays an essential role in determination of service plans operated by carriers in the transportation and logistics system. In this paper, we introduce certain issues related to management of heterogeneous assets in the well-known design-balanced capacitated multicommodity network design, where design-balanced requirements are explicitly defined based on heterogeneous assets. Taking vehicles as an example of heterogeneous assets, we first present an arc-based formulation for the proposed problem and discuss two associated subproblems. We then propose a tabu search based metaheuristic for this problem. Over a wide range of network design instances, we respectively compare our approach with CPLEX with one-hour and ten-hour time limits. Computational results demonstrate that the proposed approach performs very well in terms of solution quality and computing time, especially for large instances. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:145 / 159
页数:15
相关论文
共 50 条
  • [1] Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements
    Chouman, Mervat
    Crainic, Teodor Gabriel
    [J]. TRANSPORTATION SCIENCE, 2015, 49 (01) : 99 - 113
  • [2] Matheuristics for the single-path design-balanced service network design problem
    Li, Xiangyong
    Wei, Kai
    Aneja, Y. P.
    Tian, Peng
    Cui, Youzhi
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 77 : 141 - 153
  • [3] Benders, metric and cutset inequalities for multicommodity capacitated network design
    Costa, Alysson M.
    Cordeau, Jean-Francois
    Gendron, Bernard
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2009, 42 (03) : 371 - 392
  • [4] A first multilevel cooperative algorithm for capacitated multicommodity network design
    Crainic, TG
    Li, Y
    Toulouse, M
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (09) : 2602 - 2622
  • [5] Benders, metric and cutset inequalities for multicommodity capacitated network design
    Alysson M. Costa
    Jean-François Cordeau
    Bernard Gendron
    [J]. Computational Optimization and Applications, 2009, 42 : 371 - 392
  • [6] A capacity scaling heuristic for the multicommodity capacitated network design problem
    Katayama, N.
    Chen, M.
    Kubo, M.
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 232 (01) : 90 - 101
  • [7] MIP neighborhood search heuristics for a service network design problem with design-balanced requirements
    Katayama, Naoto
    [J]. JOURNAL OF HEURISTICS, 2020, 26 (04) : 475 - 502
  • [8] MIP neighborhood search heuristics for a service network design problem with design-balanced requirements
    Naoto Katayama
    [J]. Journal of Heuristics, 2020, 26 : 475 - 502
  • [9] A combined fast greedy heuristic for the capacitated multicommodity network design problem
    Katayama, Naoto
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2019, 70 (11) : 1983 - 1996
  • [10] 0-1 reformulations of the multicommodity capacitated network design problem
    Frangioni, Antonio
    Gendron, Bernard
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (06) : 1229 - 1241