scientific article; zbMATH DE number 2079896

zbMATH Open1044.68791MaRDI QIDQ4472036FDOQ4472036

Authors: Markus Puchta, Jens Gottlieb 

Publication date: 3 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2279/22790132.htm

Title of this publication is not available (Why is that?)

Recommendations

• Two local search approaches for solving real-life car sequencing problems
• scientific article; zbMATH DE number 1961994
• Review and comparison of three methods for the solution of the car sequencing problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Greedy approach and multi-criteria simulated annealing for the car sequencing problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Production models (90B30)

Cited In (22)

• Iterative beam search for car sequencing
• Solving real car sequencing problems with ant colony optimization
• Local search and suffix tree for car-sequencing problem with colors
• Algorithms for the car sequencing and the level scheduling problem
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
• Soft car sequencing with colors: lower bounds and optimality proofs
• A GRASP approach for the extended car sequencing problem
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Large neighborhood improvements for solving car sequencing problems
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Car sequencing versus mixed-model sequencing: a computational study
• Title not available (Why is that?)
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Title not available (Why is that?)
• Solving the car sequencing problem via branch \& bound
• A beam search approach for the optimization version of the car sequencing problem
• Two local search approaches for solving real-life car sequencing problems
• 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
• Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for 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 Q4472036)