Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder

DOI10.1016/J.EJOR.2007.06.060MaRDI QIDQ2378418zbMATH OpenOpenAlexFDO

Authors Pavel Borisovsky, Alexandre Dolgui, Anton Valentinovich Eremeev

Publication date 8 January 2009

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2007.06.060

zbMATH Keywords

genetic algorithmsinteger programmingrecombination operatorssupply chain management

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A genetic algorithm for a bicriteria supplier selection problem
• A genetic algorithm approach to the integrated inventory-distribution problem
• scientific article; zbMATH DE number 2040773
• The use of genetic algorithms to solve the economic lot size scheduling problem
• Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm

Cites work

• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• A tabu search heuristic procedure for the fixed charge transportation problem
• Approximation of the supply scheduling problem
• Exact algorithms for procurement problems under a total quantity discount structure
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Feature Article—Genetic Algorithms for the Operations Researcher
• Fundamentals of scatter search and path relinking
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 2159455 (Why is no real title available?)
• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• Metaheuristics for Hard Optimization
• Optimized Crossover for the Independent Set Problem
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• The concave cost supply problem.
• The minimum shift design problem
• The use of dynamic programming in genetic algorithms for permutation problems

Cited in

(7)

• Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
• A genetic algorithm for a bicriteria supplier selection problem
• scientific article; zbMATH DE number 2040773 (Why is no real title available?)
• Hybridizations of evolutionary algorithms with large neighborhood search
• The problem of scheduling for call-centre operators
• Integer programming models and metaheuristics for customer order scheduling
• Contemporary approaches in matheuristics an updated survey

Describes a project that uses

Uses Software

• CPLEX
• Scatter Search

This page was built for publication: Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378418)