A discrete-event driven metaheuristic for dynamic home service routing with synchronised trip sharing

Abstract

It is common practice in the home service industry that each staff member operates a separate vehicle to visit customers. Facilitating trip sharing and walking policies allows reducing the number of required vehicles, however, often does not succeed due to operational difficulties in routing and planning. In particular, coordinating arrival times of staff members and vehicles at pickup locations introduces major complexity. Previous work in this field focusses on static problem settings where all data is known in advance. Real world-operations, however, are dynamic as cancellations or new requests can happen at any time. This requires decisions to be made in real-time. To assist planners, we propose a flexible discrete-event driven metaheuristic to deal with dynamic routing and scheduling scenarios using combined trip sharing and walking. The computational experiments show that our approach generates solutions in a fast and efficient way, thus, facilitating real-world operations and enabling rescheduling and rerouting. [(2016) 'A discrete-event driven metaheuristic for dynamic home service routing with synchronised trip sharing', European J.

Electric Vehicles in Logistics and Transportation: A Survey on Emerging Environmental, Strategic, and Operational Challenges

“…Simheuristics allow considering uncertainty both in the objective function and the constraints of a VRP model, thus making these models a more accurate representation of real-life routing distribution systems. These hybrid methods not only can deal with uncertainty and real-time decision making [103], but they can also consider aspects such as richer objective functions (including environmental costs), dynamism [104], diversity of vehicle driving ranges, multi-periodicity in the distribution activity, integration with other supply chain components, etc.…”

A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem

“…Biased‐randomization techniques make use of Monte Carlo simulation to enhance the performance of constructive heuristics (Faulin and Juan, ; Faulin et al., ). These techniques have been successfully employed to deal with different optimization problems, including vehicle routing problems (Fikar et al., ; Belloso et al., ), scheduling problems (Juan et al., ; Brandão et al., , ), facility‐location problems (Quintero‐Araujo et al., , ), open stacks problems (Gonçalves et al., ), and quasi‐clique problems (Pinto et al., ), among many others.…”

Evaluation of trip and car sharing concepts for home health care services

“…Expanding on the ideas presented in Fikar et al (2016), an event-driven randomised heuristic to derive nurses' schedules and vehicle routes for concepts where each nurse uses a separate vehicle was developed. Therefore, a wide range of promising solutions is generated within a short time-frame.…”

“…Each minute after 2 pm results in waiting for the nurse, which leads to additional costs. For trip sharing, three different metaand matheuristic solution procedures were developed in previous work (Fikar and Hirsch 2015;Fikar et al 2016). The matheuristic TS-SPBS (Fikar and Hirsch 2015) was selected for this work as it performs best in respect to solution quality.…”