Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances

DOI10.1016/j.cor.2023.106154arXiv2303.15558MaRDI QIDQ6164352

Alain Haït, Emmanuel Rachelson, Cédric Baudoin, François Lamothe, Jean-Baptiste Dupé

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.15558

zbMATH Keywords

heuristicscolumn generationmixed integer linear programmingroutingunsplittable flows

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• On service consistency in multi-period vehicle routing
• A hybrid column generation with GRASP and path relinking for the network load balancing problem
• Stochastic uncapacitated hub location
• A multi-start variable neighborhood search for solving the single path multicommodity flow problem
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Models for the piecewise linear unsplittable multicommodity flow problems
• The vehicle routing problem with profits and consistency constraints
• Multi-period traffic routing in satellite networks
• On the minimum cost multiple-source unsplittable flow problem
• Handbook of Approximation Algorithms and Metaheuristics
• Bandwidth Packing: A Tabu Search Approach
• An ant colony optimization metaheuristic for single-path multicommodity network flow problems