Pages that link to "Item:Q932175"
From MaRDI portal
The following pages link to An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem (Q932175):
Displaying 13 items.
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem (Q932211) (← links)
- Iterated tabu search for the car sequencing problem (Q932213) (← links)
- Soft car sequencing with colors: lower bounds and optimality proofs (Q932214) (← links)
- Local search and suffix tree for car-sequencing problem with colors (Q932215) (← links)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints (Q932216) (← links)
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem (Q932219) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A column generation approach and new bounds for the car sequencing problem (Q1639282) (← links)
- An iterative local search approach applied to the optimal stratification problem (Q3002556) (← links)
- Large neighborhood improvements for solving car sequencing problems (Q3534210) (← links)
- Heuristics and matheuristics for a real‐life machine reassignment problem (Q5246825) (← links)
