scientific article; zbMATH DE number 1961994

Jens Gottlieb, Christine Solnon, Markus Puchta

Publication date: 10 August 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (25)

A GRASP approach for the extended car sequencing problem ⋮ A column generation approach and new bounds for the car sequencing problem ⋮ A decomposition approach for the car resequencing problem with selectivity banks ⋮ 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)] ⋮ Bi-objective memetic GP with dispersion-keeping Pareto evaluation for real-world regression ⋮ Objective Selection for Cancer Treatment: An Inverse Optimization Approach ⋮ Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem ⋮ Large neighborhood improvements for solving car sequencing problems ⋮ 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 ⋮ 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 ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ Iterative beam search for car sequencing

Uses Software

CSPLib

This page was built for publication: