Czech Technical University in Prague
Hybridization of Constraint Programming for Scheduling Problems with Complex Criteria
마감2025.01.10~2025.01.31
채용 정보
접수 기간
2025.01.10 00:00~2025.01.31 23:45
접수 방법
홈페이지지원더보기
채용 구분
경력 무관
고용 형태
계약직
지원 자격
박사
모집 전공
제어계측공학, 정보・통신공학, 전자공학, 전산학・컴퓨터공학, 전기공학, 의공학, 응용소프트웨어공학, 광학공학, 통계학, 수학더보기
기관 유형
대학교
근무 지역
해외(체코)더보기
Today, Large Neighborhood Search (LNS) [PER] is the preferred heuristic algorithm in solvers like CP Optimizer, Google OR-Tools, or OptalCP, as it offers a better ability to escape local optima and higher diversity in the exploration than previously often used Local Search. At the same time, Failure-Directed Search (FDS) [VIL] is used to efficiently explore the whole search space using a Fail-First principle to prove that no solution or better solution than the one found so far exists.
Nevertheless, CP solvers are less efficient when a criterion is more complex than, e.g., makespan minimization in scheduling.
But any algorithm that quickly provides a good solution, even without optimality guarantees, can be used inside the CP solver in the same way as LNS even if such algorithm is not as generic as CP when used to solve a specific scheduling problem, for example. The objective values of found solutions can be used as bounds (hard constraints on objective value), limiting the search space for the FDS. Thus, the better the provided solution is, the faster FDS explores the whole solution space.
This reasoning opens up research areas like a hybridization of problem-oriented heuristics and CP solvers that can lead to better performance while sharing the objective value and no-goods among heuristics and CP workers. We expect to explore utilizing machine learning (ML) in search algorithms, such as guiding search branching. Due to our collaboration with Petr Vilím, OptalCP [OPT] developer, we expect to exchange more information between the heuristic and the solver during the algorithm run.
About the group: The Industrial Informatics Department, led by Zdenek Hanzalek, is oriented towards scheduling, combinatorial optimization, and automated cars. The group collaborates strongly with high-tech companies (CEZ – Czech Energy Group, Porsche Engineering Services, EATON, Skoda Auto, ST Microelectronics, Volkswagen, DHL, …).
[PER] L. Perron, P. Shaw, V. Furnon, Propagation guided large neighborhood search, in: M. Wallace (Ed.), Principles and Practice of Constraint Programming – CP 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 468–481.
[OPT] ScheduleOpt: OptalCP’s solver landing page (2023). URL https://scheduleopt.com/
[VIL ]P. Vilím, P. Laborie, P. Shaw, Failure-directed search for constraint-based scheduling, in: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research,
Springer, 2015, pp. 437–453.
근무 예정지
대표Czech Technical University in Prague(해외) : Technická 5, 160 00 Praha 6-Dejvice
관련 키워드
기관 정보
Czech Technical University in Prague
닫기신규 공고 알림받기 관심 기관 설정으로 신규 공고를 누구보다
먼저 받아보세요.
기관유형
대학교(해외)
대표전화
+420 220 441 111
대표주소
Technická 5, 160 00 Praha 6-Dejvice
홈페이지
이 공고와 함께
많이 본 공고
다른 사람이 본 공고가
로그인하고 확인하기
궁금하다면?
로그인 후 확인해보세요!
이런 공고는 어떠세요?
연구원
Johannes Kepler University
University Assistant (Doctorate/Ph.D.)
D-23
공고 스크랩연구원
University of Southern Denmark
Postdoctoral Position in Computer Science
D-20
공고 스크랩연구원
Nanyang Technological University
AI-for-X Postdoctoral Fellowship (AI4X-PDF)
D-60
공고 스크랩연구원
National Hellenic Research Foundation
Postdoctoral Position in the thematic Area of Information Technology- Medicine - Mathematics
오늘 마감
공고 스크랩연구원
Polytechnic University of Catalonia
Postdoctoral Researcher in Information Theory
오늘 마감
공고 스크랩연구원
Hebrew University of Jerusalem
Postdoc for Physical Oceanography
D-451
공고 스크랩연구원
University of Stavanger
Postdoctoral Fellowship in Algebraic and Symplectic Geometry
D-14
공고 스크랩연구원
King Abdullah University of Science and Technology
Postdoctoral Researcher / Research Scientist in Data Science for Mineral Exploration
D-272
공고 스크랩연구원
Slovak Academy of Sciences
IMPULZ 2025 CALL FOR APPLICATIONS
D-1
공고 스크랩연구원
IFP Energies nouvelles
18-month postdoc at IFPEN -- Development of a Dynamic Modeling Methodology for Urban Mobility with MATSim Using Dynamic Data
D-29
공고 스크랩연구원
IFP Energies nouvelles
18-month postdoc at IFPEN - Monitoring mobility patterns: detection of punctual anomalies and long-lasting disruptions
D-29
공고 스크랩연구원
분당서울대학교병원
분당서울대학교병원 단시간일반직(선임급연구원) 채용
D-7
공고 스크랩