A matheuristic for the two-stage fixed-charge transportation problem

DOI10.1016/j.cor.2018.03.007zbMath1458.90068OpenAlexW2794263392WikidataQ130093141 ScholiaQ130093141MaRDI QIDQ1652635

Herminia I. Calvete, Carmen Galé, José A. Iranzo, Paolo Toth

Publication date: 11 July 2018

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

Full work available at URL: https://doi.org/10.1016/j.cor.2018.03.007

zbMATH Keywords

transportationevolutionary algorithmfixed chargematheuristictwo-stage

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes ⋮ Solving biobjective network flow problem associated with minimum cost-time loading ⋮ The transportation problem with packing constraints ⋮ A transportation planning problem with transfer costs in uncertain environment ⋮ An uncertain two-echelon fixed charge transportation problem

Cites Work

• Unnamed Item
• A simulated annealing algorithm for a two-stage fixed charge distribution problem of a supply chain
• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
• A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
• A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem
• Fixed-cost transportation problems
• Matheuristics
• The fixed charge problem

This page was built for publication: A matheuristic for the two-stage fixed-charge transportation problem