The time-dependent capacitated profitable tour problem with time windows and precedence constraints

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

14 Citaten (Scopus)
4 Downloads (Pure)

Samenvatting

We introduce the time-dependent capacitated profitable tour problem with time windows and precedence constraints. This problem concerns determining a tour and its departure time at the depot that maximizes the collected profit minus the total travel cost (measured by total travel time). To deal with road congestion, travel times are considered to be time-dependent. We develop a tailored labeling algorithm to find the optimal tour. Furthermore, we introduce dominance criteria to discard unpromising labels. Our computational results demonstrate that the algorithm is capable of solving instances with up to 150 locations (75 pickup and delivery requests) to optimality. Additionally, we present a restricted dynamic programing heuristic to improve the computation time. This heuristic does not guarantee optimality, but is able to find the optimal solution for 32 instances out of the 34 instances.
Originele taal-2Engels
Pagina's (van-tot)1058-1073
Aantal pagina's16
TijdschriftEuropean Journal of Operational Research
Volume264
Nummer van het tijdschrift3
DOI's
StatusGepubliceerd - 1 feb 2018

Vingerafdruk Duik in de onderzoeksthema's van 'The time-dependent capacitated profitable tour problem with time windows and precedence constraints'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit