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

DOI10.1111/itor.12378OpenAlexW2587219052MaRDI QIDQ6070981

Adel Guitouni, Saoussen Krichen, Hela Masri

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12378

zbMATH Keywords

metaheuristicsnonlinear programmingnetwork flowsmultiple-objective programming

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

Heterogeneous flow distribution at the peak load in the multiuser network ⋮ Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network ⋮ Estimate of resource distribution with the shortest paths in the multiuser network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• Variable neighborhood search for location routing
• Theory and practice of natural computing. Second international conference, TPNC 2013, Cáceres, Spain, December 3--5, 2013. Proceedings
• Solving multi-objective traffic assignment
• The biobjective undirected two-commodity minimum cost flow problem
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
• Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
• Variable neighborhood search
• Parallel machine earliness and tardiness scheduling with proportional weights
• Multi-objective vehicle routing problems
• MOAQ and ant-Q algorithm for multiple objective optimization problems
• Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
• A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
• Approximability of unsplittable shortest path routing problems
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• Multicommodity network flows—A survey
• An ant colony optimization metaheuristic for single-path multicommodity network flow problems
• Finding the K Shortest Loopless Paths in a Network
• Approximation and Online Algorithms
• Variable neighborhood search: Principles and applications

This page was built for publication: Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem