TITLE

Fifty Years of Vehicle Routing

AUTHOR(S)
Laporte, Gilbert
PUB. DATE
August 2009
SOURCE
Transportation Science;Aug2009, Vol. 43 Issue 3, p408
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title "The Truck Dispatching Problem." The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.
ACCESSION #
45409311

 

Related Articles

  • A CENTROID-BASED HEURISTIC ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM. Kwangcheol SHIN; Sangyong HAN // Computing & Informatics;2011, Vol. 30 Issue 4, p721 

    The vehicle routing problem (VRP) is famous as a nondeterministic polynomial-time hard problem. This study proposes a centroid-based heuristic algorithm to solve the capacitated VRP in polynomial time. The proposed algorithm consists of three phases: cluster construction, cluster adjustment, and...

  • An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Baldacci, Roberto; Mingozzi, Aristide; Roberti, Roberto; Calvo, Roberto Wolfler // Operations Research;Mar/Apr2013, Vol. 61 Issue 2, p298 

    In the two-echelon capacitated vehicle routing problem (2E-CVRP), the delivery to customers from a depot uses intermediate depots, called satellites. The 2E-CVRP involves two levels of routing problems. The first level requires a design of the routes for a vehicle fleet located at the depot to...

  • TETRAHEURÍSTICA SISTÉMICA (THS) PARA EL TSP. Rave, Jorge Iván Pérez; Álvarez, Gloria Patricia Jaramillo; Mesa, Carlos Mario Parra; Velásquez, Luis Fernando Moreno // INGENIARE - Revista Chilena de Ingeniería;may-ago2010, Vol. 18 Issue 2, p187 

    This paper presents a novel method to solve instances of the TSP. This method is comparable in effectiveness and efficiency with "nearest neighbour", "cheapest insertion", "two-way exchange improvement" and "branch and bound". The first section provides a literature review of the combinatorial...

  • Driver's Workload Comparison in Waste Collection Vehicle Routing Problem. Benjamin, Aida Mauziah; Abdul-Rahman, Syariza // AIP Conference Proceedings;2016, Vol. 1782 Issue 1, p1 

    This paper compares the workload of the drivers for a waste collection benchmark problem. The problem involves ten data sets with different number of customers to be served and different number of disposal facilities available. Previous studies proposed a heuristic algorithm, namely Different...

  • New Genetic Algorithm for the Travelling Salesman Problem. Erol, Ayşe Hande; Bulkan, Serol // Proceedings of the International Conference on Industrial Engine;2012, p1711 

    Given a collection of cities and the cost of travel between each pair of them, the traveling salesman problem is to find the cheapest way of visiting all of the cities and returning to starting point. The simplicity of the statement of the problem is deceptive, the traveling salesman problem is...

  • Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem.  // Business Systems Research;Jun2012, Vol. 3 Issue 1, p14 

    Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. Objectives: In this paper we study the influence of hybridization of a genetic...

  • Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem. Ho-Yoeng Yun; Suk-Jae Jeong; Kyung-Sup Kim // Journal of Applied Mathematics;2013, p1 

    We propose a novel heuristic algorithm based on the methods of advanced Harmony Search and Ant Colony Optimization (AHS-ACO) to effectively solve the Traveling Salesman Problem (TSP). The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases...

  • A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP. KIZILATEŞ, Gözde; NURİYEVA, Fidan // Anadolu University of Sciences & Technology - B: Theoretical Sci;Oct2013, Vol. 2 Issue 2, p143 

    The Traveling Salesman Problem (TSP) is an important and well known combinatoriyal optimization problem. The goal of the problem is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Although the definition of the travelling...

  • Probabilistic Traveling Salesman Problem with Deadlines. Campbell, Ann M.; Thomas, Barrett W. // Transportation Science;Feb2008, Vol. 42 Issue 1, p1 

    Time-constrained deliveries are one of the fastest growing segments of the delivery business, and vet there is surprisingly little literature that addresses time constraints in the context of stochastic customer presence. We begin to fill that void by introducing the probabilistic traveling...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics