A Tabu Search Heuristic for the Heterogeneous Vehicle Routing Problem on a Multi-graph
David Lai, Ozgun Caliskan Demirag, Janny Leung
Abstract
David Lai, Ozgun Caliskan Demirag, Janny Leung
Abstract
The objectives of my Ph.D. studies include: modelling and solving shift rostering problems;• efficient heuristics for HVRP that generates nearoptimal feasible solutions in a short time;• modelling and solving the integrated vehicle andcrew scheduling problem with stochastic traveltimes;• efficient heuristics that repair and re-optimize disrupted vehicle and crew schedules.This paper describes a tabu search heuristic thatsolves the HVRP for near-optimal solutions in a shorttim
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The objectives of my Ph.D. studies include: modelling and solving shift rostering problems;• efficient heuristics for HVRP that generates nearoptimal feasible solutions in a short time;• modelling and solving the integrated vehicle andcrew scheduling problem with stochastic traveltimes;• efficient heuristics that repair and re-optimize disrupted vehicle and crew schedules.This paper describes a tabu search heuristic thatsolves the HVRP for near-optimal solutions in a shorttim
Key concepts: Tabu search, Vehicle routing problem, Computer science, Mathematical optimization, Graph, Routing (electronic design automation), Heuristic, Mathematics