scientific article; zbMATH DE number 1961994
From MaRDI portal
Publication:4418384
Recommendations
- Review and comparison of three methods for the solution of the car sequencing problem
- scientific article; zbMATH DE number 2079896
- Solving real car sequencing problems with ant colony optimization
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
- Two local search approaches for solving real-life car sequencing problems
Cited in
(31)- Sequencing mixed-model assembly lines: survey, classification and model critique
- A column generation approach and new bounds for the car sequencing problem
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Iterative beam search for car sequencing
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
- Solving real car sequencing problems with ant colony optimization
- Car sequencing versus mixed-model sequencing: a computational study
- Empirical study of the greedy heuristic as applied to the link selection problem
- Bi-objective memetic GP with dispersion-keeping Pareto evaluation for real-world regression
- Review and comparison of three methods for the solution of the car sequencing problem
- A decomposition approach for the car resequencing problem with selectivity banks
- Large neighborhood improvements for solving car sequencing problems
- scientific article; zbMATH DE number 2079896 (Why is no real title available?)
- Objective selection for cancer treatment: an inverse optimization approach
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
- The maximum length car sequencing problem
- Instance space analysis for the car sequencing problem
- Mixed-model sequencing with stochastic failures: a case study for automobile industry
- A GRASP approach for the extended car sequencing problem
- Comments on ``solving real car sequencing problems with ant colony optimization [\textit{C. Gagné} et al., Eur. J. Oper. Res. 174, No. 3, 1427--1448 (2006: Zbl 1103.90409)]
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
- Two local search approaches for solving real-life car sequencing problems
- Iterated tabu search for the car sequencing problem
- Local search and suffix tree for car-sequencing problem with colors
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- Greedy approach and multi-criteria simulated annealing for the car sequencing problem
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Solving the car sequencing problem via branch \& bound
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
- A beam search approach for the optimization version of the car sequencing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418384)
