An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines

Ghilas, Veaceslav; Demir, Emrah

doi:10.1016/j.cor.2016.01.018

Cited by 166 publications

(94 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Results show a very good performance in comparison to the results from Hemmelmayr et al (2012). Ghilas et al (2016aGhilas et al ( , 2016b use both exact and heuristic methods for their problem. They decided for a branch-and-price approach as an exact method and for an adaptive large neighborhood search heuristic method.…”

Section: Methods and Instancesmentioning

confidence: 87%

“…Ghilas et al. (, ) use both exact and heuristic methods for their problem. They decided for a branch‐and‐price approach as an exact method and for an adaptive large neighborhood search heuristic method.…”

Section: Single Region Problemsmentioning

confidence: 99%

“…Capacity limit and opening costs are considered for the depots. Ghilas et al (2016aGhilas et al ( , 2016b) use a very similar type of interdepot routes in their work. Their interdepot route is a scheduled active public transportation line traveling in the city of Amsterdam transporting both passengers and packages.…”

Section: Related Problemsmentioning

confidence: 99%

See 2 more Smart Citations

Multidepot pickup and delivery problems in multiple regions: a typology and integrated model

Dragomir

Nicola

Soriano

et al. 2017

Int Trans Operational Res

View full text Add to dashboard Cite

The rapid development experienced by the transportation industry in the past decades has led to many configurations of networks and therefore to an explosion of variants in transportation problems, motivating researchers to look at broader logistic problems, beyond the basic vehicle routing problems. This work introduces a new type of problem scenario combining various attributes: a pickup and delivery problem with multiple regions, multiple depots, and multiple transportation modes. We provide definitions, a literature review, and a step‐by‐step construction of the mathematical models from a simple and well‐known scenario to the multiregion multidepot pickup and delivery problem (MR‐MDPDP). For each step the relevant literature is examined. Furthermore, we suggest possible extensions for prospective research.

show abstract

Section: Methods and Instancesmentioning

confidence: 87%

Section: Single Region Problemsmentioning

confidence: 99%

See 1 more Smart Citation

Multidepot pickup and delivery problems in multiple regions: a typology and integrated model

Dragomir

Nicola

Soriano

et al. 2017

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…The Pickup and Delivery Problem with Time Windows and Scheduled Lines (PDPTW-SL) is examined in Ghilas et al (2016). The PDPTW-SL concerns integrating short-haul passenger and freight transportation using public transport and thus has many similarities with the IDARP.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The PDPTW-SL concerns integrating short-haul passenger and freight transportation using public transport and thus has many similarities with the IDARP. Ghilas et al (2016) present an Adaptive Large Neighborhood Search metaheuristic to efficiently solve the PDPTW-SL. They test the metaheuristic on generated instances with up to 100 freight requests.…”

Section: Literature Reviewmentioning

confidence: 99%

The integrated dial-a-ride problem with timetabled fixed route service

2016

View full text Add to dashboard Cite

This paper concerns operational planning of door-to-door transportation systems for the elderly and/or disabled, who often need a more flexible transportation system than the rest of the population. Highly flexible, but very costly direct transportation is often offered as a complement to standard fixed route public transport service. In the integrated dial-a-ride problem (IDARP), these modes of transport are combined and certain legs of the passengers journeys may be performed with the fixed route public transport system. We extend the IDARP and include timetables for the fixed route services, forcing the fleet of vehicles to schedule the arrival at transfer locations with care. Two mixed integer linear programming formulations of the integrated dial-a-ride problem with timetables (IDARP-TT) are presented and analyzed. The key modeling challenge is that of the transfers between the fleet of vehicles and the fixed route public transport system. The formulations differ in how the transfers are modeled and the differences are thoroughly discussed. The computational study compares the formulations in terms of network size, computational time and memory usage and conclusions about their performances are drawn.

show abstract