Routing relatively few customers per route

Wout Dullaert, Olli Bräysy

Research output: Contribution to JournalArticleAcademicpeer-review


Abstract This paper presents a modification of the well-known Solomon (1987) sequential insertion heuristic I1 for the Vehicle Routing\r\nProblem with Time Windows (VRPTW). VRPTW involves servicing customers within a pre-specified service time window by homogeneously\r\ncapacitated vehicles from a single depot. By using two new measures for the additional time needed to insert a customer in\r\nthe route, significantly better solutions are obtained for relatively short routes compared to the original Solomon (1987)\r\nsequential insertion heuristic I1. Because high-quality initial heuristics often allow local searches and metaheuristics to\r\nachieve better solutions more quickly, the new approach is likely to help generating better solutions to practical routing\r\nproblems.
Original languageEnglish
Pages (from-to)325-336
Number of pages12
Issue number2
Publication statusPublished - 2003


Dive into the research topics of 'Routing relatively few customers per route'. Together they form a unique fingerprint.

Cite this