A multi-phase constructive heuristic for the vehicle routing problem with multiple trips

Authors:
R. J. Petch;S. Salhi
Affiliations:
Management Mathematics Group, School of Mathematics and Statistics, The University of Birmingham, UK;Management Mathematics Group, School of Mathematics and Statistics, The University of Birmingham, UK
Venue:
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Year:
2003

Citing 1
Cited 6

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

Computers and Operations Research

A cooperative strategy for a vehicle routing problem with pickup and delivery time windows

Computers and Industrial Engineering
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem

Computers and Operations Research
An optimization approach for communal home meal delivery service: A case study

Journal of Computational and Applied Mathematics
The multi-shift vehicle routing problem with overtime

Computers and Operations Research
Approximation algorithms for min-max capacitated path covers

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
An Exact Algorithm for the Multitrip Vehicle Routing Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the literature.