list.iid.ciirc.cvut.cz
Sign In Sign Up
Manage this list Sign In Sign Up

Keyboard Shortcuts

Thread View

  • j: Next unread message
  • k: Previous unread message
  • j a: Jump to all threads
  • j l: Jump to MailingList overview

Scheduling seminar

Thread Start a new thread
Download
Threads by month
  • ----- 2025 -----
  • May
  • April
  • March
  • February
  • January
  • ----- 2024 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2023 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2022 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2021 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
schedulingseminar@rtime.felk.cvut.cz

March 2025

  • 1 participants
  • 2 discussions
Premysl Sucha (CTU in Prague) | April 9 | Machine Learning Inside Decomposition of Scheduling Problems
by Zdenek Hanzalek 25 Mar '25

25 Mar '25
Dear scheduling researcher, We are delighted to announce the talk given by Premysl Sucha (CTU in Prague). The title is "Machine Learning Inside Decomposition of Scheduling Problems". The seminar will take place on Zoom on Wednesday, April 9 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/93077786062?pwd=Cj5lSGL0PI5el3qj3nBkbTXMh3ZTKc.1 Meeting ID: 930 7778 6062 Passcode: 851384 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/… [View More]channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Problem decomposition refers to general techniques for efficiently solving large instances. The fact that decomposition splits the problem into smaller subproblems and then combines their solutions into a solution to the original problem opens up many possibilities for applying machine learning. There are two main advantages why it is suitable. The first is that the subproblems are solved repeatedly/recursively, so similar instances are solved multiple times. The second is that the subproblems are smaller and thus easier to combine with machine learning. In this talk, we show two successful applications of machine learning to speed up scheduling algorithms based on decomposition techniques, namely branch and price and Lawler's decomposition. The talk by Christian Blum (IIIA-CSIC) planed on March 26 is cancelled due to personal reasons of the speaker. Nevertheless, the next talk in our series will be: Christian Blum (IIIA-CSIC) | April 23 | CMSA: A Hybrid Metaheuristic for Combinatorial Optimization For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/ [View Less]
1 0
0 0
Daniele Vigo (Unibo CIRI-ICT) | March 12 | One Million ... and Beyond! Solving Huge-Scale Vehicle Routing Problems in a Handful of Minutes
by Zdenek Hanzalek 07 Mar '25

07 Mar '25
Dear scheduling researcher, We are delighted to announce the talk given by Daniele Vigo (Unibo CIRI-ICT). The title is "One Million ... and Beyond! Solving Huge-Scale Vehicle Routing Problems in a Handful of Minutes". The seminar will take place on Zoom on Wednesday, March 12 at 14:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/96957110178?pwd=buNswAwkpAcTOreAfQ2qHG5yZr0kJd.1 Meeting ID: 969 5711 0178 Passcode: 723073 You can follow the seminar online or offline on our Youtube channel … [View More]as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Vehicle routing is a hard and extensively studied combinatorial optimization problem which has numerous practical applications in transportation and logistics. In the last two decades several effective solution methods were proposed for the heuristic solution of the vehicle routing problem (VRP) and its many variants but most of these methods do not scale well with respect to the computing time when the size of the problem grows. We discuss a family of approaches, originated from the FILO framework, which were explicitly designed to obtain a linear growth of the computing time making it possible to solve very large instances with up to one million customers within a very limited computing time. The next talk in our series will be: Christian Blum (IIIA-CSIC) | March 26 | CMSA: A Hybrid Metaheuristic for Combinatorial Optimization For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/ [View Less]
1 0
0 0

HyperKitty Powered by HyperKitty version 1.3.12.