Using cost change estimates in a local search heuristic for the Pollution Routing Problem

Onur C. Saka, S. Gurel, T. van Woensel

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

8 Citaten (Scopus)
1 Downloads (Pure)

Samenvatting

We consider the pollution routing problem (PRP) with deadlines and heterogeneous fleet for which we implement a local search heuristic using inter-route relocate, exchange and intra-route relocate moves. The subproblem of finding optimal speed levels of a truck for a given tour gives optimality properties which relate the marginal speedup costs for each leg on the tour. We use the derived optimality properties and marginal speedup costs to evaluate possible search moves and choose the most promising ones to implement in local search heuristic. Computational results show that this approach improves solution times significantly while improving solution quality for large instances.
Originele taal-2Engels
Pagina's (van-tot)557-587
Aantal pagina's31
TijdschriftOR Spectrum
Volume39
Nummer van het tijdschrift2
DOI's
StatusGepubliceerd - mrt 2017

Vingerafdruk Duik in de onderzoeksthema's van 'Using cost change estimates in a local search heuristic for the Pollution Routing Problem'. Samen vormen ze een unieke vingerafdruk.

Citeer dit