Hacktoberfest 2026: los issues que los mantenedores marcaron para octubre, abiertos y aptos para principiantes. Explorar issues de Hacktoberfest

Allow SubListSwapMoveSelector to swap 1..n elements with 1..n unassigned elements

Abierto
  • ¿Algo no está bien?
#2,212 0 comentarios 2 reacciones 0 asignados Ver en GitHub

Los mantenedores suelen responder en 1 día

Nadie ha tomado este issue todavía.

Evaluación

Dificultad
5/5
Tiempo estimado
Más de una semana
Aptitud para principiantes
35/100
Tipo de issue
Nueva funcionalidad
Claridad
Bastante claro
Estado de actividad
Tranquilo
Stack tecnológico
java
Área
ai

Línea de trabajo

Start with the SubListSwapMoveSelector and SubListSwapMove entry points, then read the documentation on ruin and recreate and nearby selection to compare the proposed behavior. Define how 1..n assigned entities exchange with 1..n randomly selected unassigned entities, including whether construction ordering is required; done means the selected move is supported with its intended behavior verified.

Escrito por el modelo de indexación a partir del texto del issue.

Descripción

process/needs triage

Is your feature request related to a problem? Please describe.
For over-constrained datasets, bulk swapping assigned entities with unassigned entities might be beneficial to escape local optima.

Describe the solution you'd like
Allow SubListSwapMove to exchange a sub list of 1..n elements with 1..n unassigned elements.

Describe alternatives you've considered
This could also implemented as separate move and not become part of SubListSwapMove.

Further considerations

  • This is also somewhat related to ruin and recreate, but if I understand the documentation correctly, ruin and recreate first unassigns multiple entities and then reassigns those same entities. The proposed move would allow unassigning 1..n and then assigning 1..n randomly selected unassigned entities.
  • When multiple unassigned entities are assigned at once, some sort of construction heuristic might be required to determine the order of those entities as optimally as possible (which makes this also similar to ruin & recreated). Not sure if utilizing nearby selection for this is feasible (as e.g. ruin & recreate doesn't do this), but it would most probably be beneficial for routing models.
Lenguaje dominante
Java
Estrellas
1.8k
Forks
238
Merge medio
3 d 1 h
PR fusionados (30 d)
55

Preparar el entorno

Primeros pasos

  1. Lee el issue completo y luego la guía de contribución del proyecto.
  2. Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
  3. Haz un fork del repositorio y trabaja en una rama.
  4. Abre un pull request que haga referencia al número del issue.

Más de TimefoldAI/timefold-solver

Todos los issues de TimefoldAI/timefold-solver

Issues similares

Más issues de Java

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.