An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem
From MaRDI portal
Publication:5116037
zbMATH Open1463.90010MaRDI QIDQ5116037FDOQ5116037
Authors: Ovidiu Cosma, Petrica Pop, Corina Pop Sitar 
Publication date: 21 August 2020
Recommendations
- A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
- A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes
- scientific article; zbMATH DE number 6897337
- A matheuristic for the two-stage fixed-charge transportation problem
- A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (8)
- An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow
- Effective assignment algorithm for continuous two-stage activities in loading and transportation management
- An iterative algorithm for two level hierarchical time minimization transportation problem
- A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
- A matheuristic for the two-stage fixed-charge transportation problem
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots
- A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes
This page was built for publication: An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116037)
