The multicommodity network flow problem: state of the art classification, applications, and solution methods

K Salimifard, S Bigharaz - Operational Research, 2022 - Springer
Over the past decades, the Multicommodity Network Flow (MCNF) problem has grown
popular in the academic literature and a growing number of researchers are interested in …

Liner container assignment model with transit-time-sensitive container shipment demand and its applications

S Wang, Q Meng, CY Lee - Transportation Research Part B …, 2016 - Elsevier
This paper proposes a practical tactical-level liner container assignment model for liner
shipping companies, in which the container shipment demand is a non-increasing function …

[HTML][HTML] The multi-commodity network flow problem with soft transit time constraints: Application to liner shipping

A Trivella, F Corman, DF Koza, D Pisinger - Transportation Research Part …, 2021 - Elsevier
The multi-commodity network flow problem (MCNF) consists in routing a set of commodities
through a capacitated network at minimum cost and is relevant for routing containers in liner …

A novel hybrid-link-based container routing model

S Wang - Transportation Research Part E: Logistics and …, 2014 - Elsevier
Container routing determines how to transport containers from their origins to their
destinations in a liner shipping network. Container routing needs to be solved a number of …

Traffic engineering with precomputed pathbooks

M Leconte, A Destounis… - IEEE INFOCOM 2018 …, 2018 - ieeexplore.ieee.org
This paper addresses a major challenge in traffic engineering: the selection of a set of paths
that minimizes routing cost for a random traffic matrix. We introduce the concept of pathbook …

Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem

H Masri, S Krichen, A Guitouni - International Transactions in …, 2019 - Wiley Online Library
Single‐path multicommodity flow problem (SMCFP) is a well‐known combinatorial
optimization problem, in which the flow of each commodity can be transmitted using only …

A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem

A Melchiori, A Sgalambro - Computers & Operations Research, 2018 - Elsevier
The literature on k-splittable flows, see Baier et al.(2002), provides evidence on how
controlling the number of used paths enables practical applications of flows optimization in …

A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem

A Melchiori, A Sgalambro - European Journal of Operational Research, 2020 - Elsevier
In the literature on Network Optimization, k-splittable flows were introduced to enhance
modeling accuracy in cases where an upper bound on the number of supporting paths for …

Optimal location of safety landing sites

L Xu - 2021 - hal.science
Vertical Take Off and Landing (VTOLs) vehichules are used to move passengers between
skyports in urban air mobility. Safety landing sites (SLSs) cover the trajectory of VTOLs for …

Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem

M Gamst, B Petersen - European Journal of Operational Research, 2012 - Elsevier
The Multi-Commodity k-splittable Maximum Flow Problem consists in routing as much flow
as possible through a capacitated network such that each commodity uses at most k paths …