The driver and vehicle routing problem

Domínguez-Martín, Bencomo; Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José

doi:10.1016/j.cor.2017.12.010

Cited by 17 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the most cases, the large-scale location problem is seen as a single objective optimization problem (Domínguez-Martín et al, 2018; Ibarra-Rojas et al, 2018), with various types of constraints, solved with the application of different metaheuristic methods. In this paper, the authors have attempted to define a problem as a multi-objective optimization problem, so the considered problem is more appropriately described.…”

Section: Resultsmentioning

confidence: 99%

Selection of recycling centre locations by using the interval type-2 fuzzy sets and two-objective genetic algorithm

Tadić

Đorđević²,

Aleksić

et al. 2018

Waste Manag Res

View full text Add to dashboard Cite

In the sense of contemporary industrial challenges, it may be said that many issues in the field of recycling may be analysed. In this paper, the model for choosing locations for construction of recycling centres equipped with new technology is proposed. The considered problem may be stated as a two-objective optimization problem, if the optimization criteria are presented as total distance and the overall suitability index sum. The relative importance and values of possible locations’ attributes are described by pre-defined linguistic expressions, and modelled by interval triangular type-2 fuzzy numbers. Type-2 fuzzy numbers provide a possibility to incorporate the uncertainty of membership functions into the fuzzy set theory. The procedure for determination of the overall suitability index is proposed. Selection of the most appropriate locations is achieved by a two-objective genetic algorithm, since it is very suitable for the routing issues. The proposed model application is illustrated with the real-life data that come from a few regions in Serbia.

show abstract

Section: Resultsmentioning

confidence: 99%

Selection of recycling centre locations by using the interval type-2 fuzzy sets and two-objective genetic algorithm

Tadić

Đorđević²,

Aleksić

et al. 2018

Waste Manag Res

View full text Add to dashboard Cite

show abstract

“…In this problem, the postal worker parks a vehicle, delivers mail to a subset of locations, and then returns to the vehicle to drive to the next delivery location. Domínguez-Martín et al (2018) examined a problem where vehicles can start and stop at different nodes but the drivers must come back to their starting depots. This requires drivers to change vehicles at some points.…”

Section: Literature Reviewmentioning

confidence: 99%

Improving the efficiency of last‐mile package deliveries using hybrid driver helpers

Clottey

2022

Decision Sciences

View full text Add to dashboard Cite

An approach widely used by parcel delivery companies to deal with increased shipping volumes, especially during peak seasons, is the use of temporary workers called driver helpers. There are two types of driver helpers: (1) dependent helpers (DH) who work alongside drivers to deliver packages on daily routes, and (2) independent helpers (IDH) who do not travel with the drivers but rather work alone at their assigned locations. The standard practice is for each helper to be used as either a DH or an IDH, but not both. This article introduces the concepts of multitasking to the parcel delivery literature by proposing a new type of helper called the hybrid helper, which allows parcel carriers to utilize each helper as both a DH and an IDH in the same route. The hybrid‐helper concept has several advantages over the existing DH or IDH concepts, including (1) reducing the transfer time of IDHs between locations, (2) allowing multiple delivery points to be serviced concurrently, and (3) increasing the daily work time of each helper. We develop a mathematical model that allows a vehicle to visit the same node more than once to enable IDH operations at selected nodes by a DH. Both numerical and field experiments show that our model outperforms other methods. Our results provide implications to practitioners on effective ways of utilizing helpers and suggest the need for future research to consider helpers in a broader context.

show abstract

“…Domínguez‐Martín et al. (2018) investigated a problem where vehicle routes must start and end at two different depots and drivers can switch vehicles at some customer locations to return to their base depot. Also, drivers can travel as passengers and the duration of those trips is counted as working hours.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The experimental results allowed the authors to conclude that vehicle exchanges are essential to obtain high-quality solutions, based on a set of generated instances with up to 96 requests and 6 locations. Domínguez-Martín et al (2018) investigated a problem where vehicle routes must start and end at two different depots and drivers can switch vehicles at some customer locations to return to their base depot. Also, drivers can travel as passengers and the duration of those trips is counted as working hours.…”

Section: Literature Reviewmentioning

confidence: 99%

A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows

Lucci

Severín

Zabala

2021

Int Trans Operational Res

View full text Add to dashboard Cite

A simultaneous vehicle routing and crew scheduling problem (SVRCSP) consists of planning routes for a fleet of vehicles and scheduling their crews, with the particularity that the vehicle-crew correspondence is not fixed through time. This allows a greater planning flexibility and a more efficient use of the fleet, but in counterpart it requires high synchronization. In this work, an SVRCSP is presented, where long-distance pickup-anddelivery requests must be fulfilled over a multiday planning horizon, subject to several constraints such as multiple time windows, hour of services regulation, among others. Crews can be composed of one or two drivers and any of them can be relieved in a given set of locations. Also, they are allowed to travel between locations with noncompany shuttles. The objective is to minimize the cost of travel in company and noncompany vehicles, which depends on the distance, and the penalization for completing requests with delay. A two-stage sequential approach is applied: a set of truck routes is computed in the first stage and a set of driver routes consistent with the previous routes is obtained in the second stage. An algorithm based on the GRASP × ILS metaheuristic, embedded with a repair heuristic to facilitate the construction of initial solutions, is proposed and evaluated for the latter stage. High-quality solutions were found for instances generated with up to 3000 requests and a planning horizon of one to four weeks spread over 15 Argentine cities in less than an hour. Additionally, the possibility of carrying an additional driver reduced the cost of external shuttles by 2.25 times on average compared to individual crews and, in some cases, removed this cost completely.

show abstract

The driver and vehicle routing problem

Cited by 17 publications

References 12 publications

Selection of recycling centre locations by using the interval type-2 fuzzy sets and two-objective genetic algorithm

Selection of recycling centre locations by using the interval type-2 fuzzy sets and two-objective genetic algorithm

Improving the efficiency of last‐mile package deliveries using hybrid driver helpers

A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows

Contact Info

Product

Resources

About