Exact and heuristic algorithms for the design of hub networks with multiple lines

被引：38

作者：

de Sa, Elisangela Martins ^{[1
]}

Contreras, Ivan ^{[2
]}

Cordeau, Jean-Francois ^{[3
]}

机构：

[1] Univ Fed Minas Gerais, Dept Ind Engn, Belo Horizonte, MG, Brazil

[2] Concordia Univ, Dept Mech & Ind Engn, Montreal, PQ, Canada

[3] HEC Montreal, Dept Logist & Operat Management, Montreal, PQ, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2015年 / 246卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Hub location; Hub-and-spoke networks; Lines; Network design; ARC LOCATION-PROBLEMS; BENDERS DECOMPOSITION; NEIGHBORHOOD SEARCH; TREE;

D O I：

10.1016/j.ejor.2015.04.017

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper we study a hub location problem in which the hubs to be located must form a set of interconnecting lines. The objective is to minimize the total weighted travel time between all pairs of nodes while taking into account a budget constraint on the total set-up cost of the hub network, A mathematical programming formulation, a Benders-branch-and-cut algorithm and several heuristic algorithms, based on variable neighborhood descent, greedy randomized adaptive search, and adaptive large neighborhood search, are presented and compared to solve the problem. Numerical results on two sets of benchmark instances with up to 70 nodes and three lines confirm the efficiency of the proposed solution algorithms. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.

引用

页码：186 / 198

页数：13

共 50 条

[41] Exact methods in disassembly sequencing as a benchmark for heuristic algorithms
Lambert, AJD
[J]. ENVIRONMENTALLY CONSCIOUS MANUFACTURING IV, 2004, 5583 : 1 - 11
[42] Heuristic and exact algorithms for the spanning tree detection problem
Yamada, T
Kataoka, S
Watanabe, K
[J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (02) : 239 - 255
[43] Heuristic Algorithms for Solving Survivability Problem in the Design of Last Mile Communication Networks
Vo Khanh Trung
Nguyen Thi Minh
Huynh Thi Thanh Binh
[J]. INTELLIGENT INFORMATION AND DATABASE SYSTEMS (ACIIDS 2012), PT II, 2012, 7197 : 519 - 528
[44] Tactical design of rail freight networks. Part I: exact and heuristic methods
Universidad Politecnica de Madrid, Madrid, Spain
[J]. Eur J Oper Res, 1 (26-44):
[45] Comparison of Heuristic and Metaheuristic Evolutionary Algorithms on Optimal Design of Water Distribution Networks
Pandey, Prerna
Singh, Devang
Dongre, Shilpa
Gupta, Rajesh
[J]. Lecture Notes in Civil Engineering, 2023, 339 LNCE : 259 - 273
[46] Component-Based Design and Assembly of Heuristic Multiple Sequence Alignment Algorithms
Shi, Haihe
Zhang, Xuchu
[J]. FRONTIERS IN GENETICS, 2020, 11
[47] Heuristic Algorithms for Multiple Messenger Problem with Multiple Depots
Fabry, Jan
[J]. MATHEMATICAL METHODS IN ECONOMICS (MME 2014), 2014, : 191 - 196
[48] A Heuristic Design Procedure for Water-Using Networks with Multiple Contaminants
Liu, Zhi-Yong
Yang, Yi
Wan, Lin-Zhan
Wang, Xi
Hou, Kai-Hu
[J]. AICHE JOURNAL, 2009, 55 (02) : 374 - 382
[49] Design of static resilient WDM mesh networks with multiple heuristic criteria
Dacomo, A
De Patre, S
Maier, G
Pattavina, A
Martinelli, M
[J]. IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 1793 - 1802
[50] EXACT AND APPROXIMATE DIMENSIONS - TOWARDS A HEURISTIC OF DESIGN
HAMBURGER, B
[J]. LOTUS INTERNATIONAL, 1983, 37 : 5 - 13

← 1 2 3 4 5 →