A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes

DOI10.1016/j.cor.2020.104906zbMath1458.90073OpenAlexW3005954507MaRDI QIDQ2185523

Petrică C. Pop, Ovidiu Cosma, Daniela Dănciulescu

Publication date: 4 June 2020

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

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

zbMATH Keywords

genetic algorithmsoperations researchmatheuristic algorithmstwo-stage transportation problem with fixed costs

Mathematics Subject Classification ID

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

Related Items (1)

The transportation problem with packing constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls
• 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 matheuristic for the two-stage fixed-charge transportation problem
• A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
• A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem
• Fixed-cost transportation problems
• An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots

This page was built for publication: A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes