The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …

Publisher Summary This chapter discusses some of the most important vehicle routing
problem types. The vehicle routing problem lies at the heart of distribution management. It is …

This paper is the first part of a comprehensive survey on pickup and delivery problems.
Basically, two problem classes can be distinguished. The first class, discussed in this paper …

This article is a survey of heuristics for the Vehicle Routing Problem. It is divided into two
parts: classical and modern heuristics. The first part contains well‐known schemes such as …

Pergamon 0305-0548(95)00026-7 A TABU SEARCH HEURISTIC FOR THE MULTI-DEPOT
VEHICLE ROUTING PROBLEM Jacques Renaudl'2'3'4 t, Gilbe Page 1 Pergamon 0305-0548(95)00026-7 …

The generalized traveling salesman problem is a variation of the well-known traveling
salesman problem in which the set of nodes is divided into clusters; the objective is to find a …

This bibliography contains 500 references on four classical routing problems: the Traveling
Salesman Problem, the Vehicle Routing Problem, the Chinese Postman Problem, and the …

In this and the following chapter, we consider what approaches one should take when one is
confronted with a real-world application of the TSP. What algorithms should be used under …

5.1 Introduction Several families of heuristics have been proposed for the VRP. These can
be broadly classified into two main classes: classical heuristics, developed mostly between …

This article describes a generalized insertion heuristic for the Traveling Salesman Problem
with Time Windows in which the objective is the minimization of travel times. The algorithm …