Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem (Q6160231): Difference between revisions

Latest revision as of 03:14, 1 August 2024

scientific article; zbMATH DE number 7683560

Language	Label	Description	Also known as
English	Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem	scientific article; zbMATH DE number 7683560

Statements

instance of

scholarly article

0 references

title

Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem (English)

0 references

DOI

10.3138/infor.48.1.023

0 references

0 references

0 references

0 references

INFOR: Information Systems and Operational Research

0 references

publication date

9 May 2023

0 references

Mathematics Subject Classification ID

0 references

0 references

hybrid metaheuristic

0 references

genetic algorithm

0 references

integer linear programming model

0 references

crossover

0 references

car-sequencing problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.3138/infor.48.1.023

0 references

OpenAlex ID

W2104642814

0 references

cites work

On the solution of traveling salesman problems

0 references

An Introduction to Metaheuristic Techniques

0 references

A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem

0 references

Rank Transformations as a Bridge Between Parametric and Nonparametric Statistics

0 references

Embedding branch and bound within evolutionary algorithms

0 references

Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints

0 references

Large neighborhood improvements for solving car sequencing problems

0 references

Two local search approaches for solving real-life car sequencing problems

0 references

Local branching

0 references

Q3829367

0 references

Q4418384

0 references

Review and comparison of three methods for the solution of the car sequencing problem

0 references

Variable neighborhood decomposition search

0 references

On the complexity of the car sequencing problem.

0 references

LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search

0 references

An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem

0 references

Q4472036

0 references

Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6160231

@@ Property / full work available at URL @@
+https://doi.org/10.3138/infor.48.1.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2104642814
@@ Property / OpenAlex ID: W2104642814 / rank @@
+Normal rank
@@ Property / cites work @@
+On the solution of traveling salesman problems
@@ Property / cites work: On the solution of traveling salesman problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Introduction to Metaheuristic Techniques
@@ Property / cites work: An Introduction to Metaheuristic Techniques / rank @@
+Normal rank
@@ Property / cites work @@
+A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
+Normal rank
@@ Property / cites work @@
+Rank Transformations as a Bridge Between Parametric and Nonparametric Statistics
+Normal rank
@@ Property / cites work @@
+Embedding branch and bound within evolutionary algorithms
+Normal rank
@@ Property / cites work @@
+Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints
+Normal rank
@@ Property / cites work @@
+Large neighborhood improvements for solving car sequencing problems
+Normal rank
@@ Property / cites work @@
+Two local search approaches for solving real-life car sequencing problems
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / cites work @@
+Q3829367
@@ Property / cites work: Q3829367 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4418384
@@ Property / cites work: Q4418384 / rank @@
+Normal rank
@@ Property / cites work @@
+Review and comparison of three methods for the solution of the car sequencing problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood decomposition search
@@ Property / cites work: Variable neighborhood decomposition search / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the car sequencing problem.
@@ Property / cites work: On the complexity of the car sequencing problem. / rank @@
+Normal rank
@@ Property / cites work @@
+LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
+Normal rank
@@ Property / cites work @@
+An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
+Normal rank
@@ Property / cites work @@
+Q4472036
@@ Property / cites work: Q4472036 / rank @@
+Normal rank
@@ Property / cites work @@
+Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6160231