A multi-start variable neighborhood search for solving the single path multicommodity flow problem

DOI10.1016/j.amc.2014.10.123zbMath1328.90019OpenAlexW2061787683MaRDI QIDQ902982

Adel Guitouni, Hela Masri, Saoussen Krichen

Publication date: 4 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.10.123

zbMATH Keywords

variable neighborhood searchrouting problemmulticommodity flow problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

Heterogeneous flow distribution at the peak load in the multiuser network ⋮ Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances ⋮ Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network

Uses Software

• LINDO
• LINGO

Cites Work

• Attraction probabilities in variable neighborhood search
• Variable neighborhood search
• Routing and scheduling connections in networks that support advance reservations
• 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
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey
• An ant colony optimization metaheuristic for single-path multicommodity network flow problems
• Variable neighborhood search: Principles and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A multi-start variable neighborhood search for solving the single path multicommodity flow problem