BEGIN:VCALENDAR VERSION:2.0 PRODID:-//Computational Optimisation Group - ECPv5.16.1.1//NONSGML v1.0//EN CALSCALE:GREGORIAN METHOD:PUBLISH X-WR-CALNAME:Computational Optimisation Group X-ORIGINAL-URL:https://optimisation.doc.ic.ac.uk X-WR-CALDESC:Events for Computational Optimisation Group BEGIN:VTIMEZONE TZID:Europe/Paris BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:20180325T010000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:20181028T010000 END:STANDARD END:VTIMEZONE BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20180417T140000 DTEND;TZID=Europe/Paris:20180417T153000 DTSTAMP:20240328T163633 CREATED:20180410T110415Z LAST-MODIFIED:20180410T110415Z UID:1055-1523973600-1523979000@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Large neighbourhood Benders' search DESCRIPTION:Title: Large neighbourhood Benders’ search\nSpeaker: Dr. Stephen Maher\nAffiliation: Lancaster University Management School\nLocation: Room 218 Huxley Building\nTime: 14:00 – 15:30 \nAbstract. Enhancements for the Benders’ decomposition algorithm can be derived from large neighbourhood search (LNS) heuristics. While mixed-integer programming (MIP) solvers are endowed with an array of LNS heuristics\, their use is typically limited in bespoke Benders’ decomposition implementations. To date\, only ad hoc approaches have been developed to enhance the Benders’ decomposition algorithm using large neighbourhood search techniques—namely local branching and proximity search. A general implementation of Benders’ decomposition has been developed within the MIP solver SCIP to permit a greater use of LNS heuristics with the expectation that it will enhance the solution algorithm. Benders’ decomposition is employed for all LNS heuristics to improve the quality of the identified solutions and generate additional cuts that can be used to improve the convergence of the main solution algorithm. Focusing on the heuristics of proximity search\, RINS and DINS\, the results will demonstrate the value of using Benders’ decomposition within LNS. URL:https://optimisation.doc.ic.ac.uk/event/seminar-large-neighbourhood-benders-search/ END:VEVENT END:VCALENDAR