BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jean-François Cordeau (HEC Montréal)
DTSTART:20230310T233000Z
DTEND:20230311T003000Z
DTSTAMP:20260513T193638Z
UID:SFUOR/19
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SFUOR/19/">T
 he Park-and-loop Technician Routing Problem</a>\nby Jean-François Cordeau
  (HEC Montréal) as part of PIMS-CORDS SFU Operations Research Seminar\n\n
 Lecture held in **SUR 2746**.\n\nAbstract\nMotivated by an application in 
 the routing of technicians at a\nFrench public utility\, we introduce a hi
 ghly efficient heuristic together\nwith a branch-price-and-cut algorithm f
 or the doubly open park-and-loop\nrouting problem. This problem is an exte
 nsion of the classical vehicle\nrouting problem in which routes may involv
 e a main tour performed by driving\na vehicle as well as a set of subtours
  that are carried out on foot after\nparking the vehicle. In addition\, ro
 utes do not start and end at a central\ndepot\, but rather at customer loc
 ations. We first describe a matheuristic\nbased on a split procedure that 
 generates high quality solutions fast. We\npresent computational experimen
 ts on a set of real instances with up to\n3\,800 customers. We also apply 
 the matheuristic to a related problem called\nthe vehicle routing problem 
 with transportable resources\, where the method\nfound new best solutions 
 on 32 out of 40 benchmark instances from the\nliterature. We then present 
 an exact algorithm\, based on a set-covering\nformulation of the problem w
 ith columns representing complete routes\, which\nis capable of solving to
  optimality instances with up to 50 customers.\n
LOCATION:https://researchseminars.org/talk/SFUOR/19/
END:VEVENT
END:VCALENDAR