A branch-and-price algorithm for solving the single-hub feeder network design problem

Hellsten, Erik Orm; Sacramento, David; Pisinger, David

doi:10.1016/j.ejor.2021.08.046

Cited by 7 publications

(4 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hellsten et al [17] proposed an adaptive neighborhoodsearch algorithm to solve the feeder shipping network design model. Hellsten et al [1] formulated a vehicle routing optimization model with specific service frequency and simultaneous pickup-and-delivery characteristics for the feeder liner shipping network design. Medić et al [18] developed a trunk-and-feeder network optimization method to address the case in the Adriatic Sea.…”

Section: Feeder Shipping Network Optimizationmentioning

confidence: 99%

See 1 more Smart Citation

Integrated Planning of Feeder Route Selection, Schedule Design, and Fleet Allocation with Multimodal Transport Path Selection Considered

Guo

Zheng

et al. 2023

JMSE

View full text Add to dashboard Cite

In the shipping network optimization, the feeder liner companies not only need to decrease the operation cost by comprehensively optimizing the route, schedule, and fleet but also try to increase the operation income by attracting more shippers, with multimodal transport-path selection considered. Therefore, this paper proposes the integrated planning of feeder route selection, schedule design, and fleet allocation with shippers’ transport-path selection considered. We utilize the nested Logit model to analyze the shipper selection behavior for the multimodal transport path and then formulate a mixed-integer nonlinear programming model of integrated optimization for route, schedule, and fleet. To solve our nonlinear model, we propose a particle swarm optimization (PSO) framework embedded with CPLEX solver by combining the constraint relaxations and the linearization techniques with the heuristic rules. Based on the multimodal transport system in Northern China, computational experiments were conducted to verify the effectiveness of our model and algorithm. The sensitivity analyses of model parameters show that with the increase in ship rent, feeder liner companies should reduce the ship capacity or try to increase the number of port call. With the increase in fuel price, feeder liner companies should reduce the ship speed under the constraints of the arrival-time window and schedule interval. If shippers’ time utility coefficient is high, feeder liner companies should shorten the sailing time of ships by decreasing the number of port calls or shorten the at-port time of ships by increasing the service frequency. If the multimodal transport paths are cost-advantaged or if the waterway transport time has a small impact on multimodal transport time, feeder liner companies should weigh the increase in income and cost when using the measures of time saving. These management insights provide decision support for the operation practice of liner shipping network optimization.

show abstract

Section: Feeder Shipping Network Optimizationmentioning

confidence: 99%

“…Maritime transport undertakes the majority of intercontinental trade. Liner shipping is the most widely used method of transporting container goods in maritime transport [1]. According to the UNCTAD report on maritime transportation 2020, there are 152 million twenty-foot containers and about 5200 containerships worldwide [2].…”

Section: Introductionmentioning

confidence: 99%

Integrated Planning of Feeder Route Selection, Schedule Design, and Fleet Allocation with Multimodal Transport Path Selection Considered

Guo

Zheng

et al. 2023

JMSE

View full text Add to dashboard Cite

show abstract

“…The results are reported for instances derived from LINER-LIB. A recent contribution is by Hellsten et al (2021), who consider the FNDP for a weekly shipping system with cargo rejection at a penalty cost. The problem is solved using a branch-and-price framework, which can solve instances with up to 12 ports to proven optimality, as well as the BALTIC instance from LINER-LIB.…”

Section: Papermentioning

confidence: 99%

An Adaptive Heuristic for Feeder Network Design with Optional Transshipment

Bergmann¹,

Msakni²,

Hemmati³

et al. 2022

SSRN Journal

View full text Add to dashboard Cite

“…Algumas aplicações de modelos de rede podem ser vistas em (Belieres, Hewitt, & Jozefowiez, 2021) Cordeau, Pasin e Solomon (2006), sobre logística de produtos; (Bharath-Kumar e Jaffe (1983)), sobre redes de computadores e o encaminhamento de mensagens via rede (Liang, Lu, & Shen, 2021) sobre serviços relacionados à Internet e computação em nuvem. Há aplicações também nas áreas de distribuição de energia elétrica como em Dantzig (1962) e Ramírez-Rosado e Domínguez-Navarro (2006); de tráfego (Conceição & Correia, 2020); de transporte público (Contreras, Fernández e Marín (2009); Contreras, Fernández e Marín, 2010); de fornecimento de suprimentos Hatefi, Moshashaee e Mahdavi (2019); de distribuição marítima (Koza & Desaulniers, 2020) e (Hellsten & Sacramento, 2021); de distribuição farmacêutica (Janatyan, Zandieh, & Alem-Tabriz, 2021) de coletagem e reciclagem de pneus (Fathollahi-Fard, Hajiaghaei-Keshteli e Mirjalili ( 2018)); de coletagem e abastecimento de água (Fathollahi-Fard, Hajiaghaei-Keshteli, & Tian, 2020); de transporte de materiais perigosos (Fontaine, Crainic, Gendreau e Minner 2020); de resíduos perigosos (Yu, Sun, Solvang, & Laporte, 2020), entre outras. Em todas essas aplicações é implementado um modelo de redes, visando sua otimização.…”

Section: Introductionunclassified

Desenvolvimento de um Algoritmo para a Expansão de Capacidade do Problema de Projeto de Redes sob Efeito de Congestionamento

Freitas

Santos

Rodrigues

2021

Exacta

View full text Add to dashboard Cite

Uma área da Pesquisa Operacional bastante estudada é o problema de projeto de redes. Alguns problemas impactam diretamente nas redes, diminuindo sua qualidade de serviço, como o congestionamento, sendo o principal problema abordado neste trabalho. Dessa forma, objetiva-se desenvolver um algoritmo capaz de tratar o problema de projetos de rede sob efeito de congestionamento. A formulação matemática do problema foi elaborada, abrangendo a expansão de capacidade, onde a quantidade de commodities enviada nos links é expandida e a instalação de novos links; sendo, em seguida, desenvolvido o algoritmo. Na realização de testes neste artigo foram utilizadas as instâncias de Nugent, os resultados obtidos foram apresentados, e, para melhor compreensão dos mesmos, foi representada graficamente a instância de 15 nós. Finalmente, conclui-se que o algoritmo foi capaz de modificar a rede de acordo com a expansão de capacidade nos links, e, tratar o congestionamento, melhorando a qualidade de serviço das redes.

show abstract

A branch-and-price algorithm for solving the single-hub feeder network design problem

Cited by 7 publications

References 39 publications

Integrated Planning of Feeder Route Selection, Schedule Design, and Fleet Allocation with Multimodal Transport Path Selection Considered

Integrated Planning of Feeder Route Selection, Schedule Design, and Fleet Allocation with Multimodal Transport Path Selection Considered

An Adaptive Heuristic for Feeder Network Design with Optional Transshipment

Desenvolvimento de um Algoritmo para a Expansão de Capacidade do Problema de Projeto de Redes sob Efeito de Congestionamento

Contact Info

Product

Resources

About