Gendreau, Michel
November 2009
Transportation Science;Nov2009, Vol. 43 Issue 4, p407
Academic Journal
The author focuses on the vehicle routing problem (VRP). He mentions that VRP is the main problem in distribution management and that it has triggered several solutions to deal with it. He states that VRP has contributed to the development of heuristic techniques from improvement procedures to metaheuristics.


Related Articles

  • Heuristic Search Techniques to Solve the Vehicle Routing with Private Fleet and Common Carrier. Euchi, Jalel.; Chabchoub, Habib. // International Journal of Universal Computer Science;2010, Vol. 1 Issue 1, p10 

    This paper describes a Tabu Search heuristic with Ejection chains neighborhood to solve the Vehicle Routing Problem with Private fleet and common Carrier (VRPPC). The VRPPC is a variant of the well-known Vehicle Routing Problem in which a fixed internal fleet (Private fleet) is available at the...

  • A Genetic Algorithm for the Multi-Depot Vehicle Routing Problem. Rybickova, Alena; Brodsky, Jakub; Karaskova, Adela; Mockova, Denisa // Applied Mechanics & Materials;2015, Vol. 803, p69 

    In this paper, we focus on the optimization of the system of the spare parts distribution for authorized garages in the Czech Republic. A spare parts market belongs to one of the key elements of the car industry. However, it has to adapt to still higher requirements on accuracy, speed and...

  • A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints. Wei Tu; Qingquan Li; Zhixiang Fang; Baoding Zhou // ISPRS International Journal of Geo-Information;2015, Vol. 4 Issue 4, p2019 

    Vehicle routing optimization (VRO) designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard) complexity, many VROs involved in real-world applications require too much computing effort. Shortening computing...

  • Pickup and Delivery with Split Loads. Nowak, Maciek; Ergun, Öziem; White, III, Chelsea C. // Transportation Science;Feb2008, Vol. 42 Issue 1, p32 

    Splitting loads such that the delivery of certain loads is completed in multiple trips rather than one trip results in opportunities for a reduction in cost and the number of vehicles used. Several studies have shown the benefit of split deliveries for the vehicle routing problem, in which a...

  • A Vehicle Routing Problem with Inventory in a Hybrid Uncertain Environment. Malekly, A. // International Journal of Applied Operational Research;Apr2012, Vol. 2 Issue 1, p65 

    Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints --...

  • Using Genetic Algorithm to Solve Mixed Delivery Optimization in Tobacco Logistics. Li Zhao // Advanced Materials Research;2014, Issue 926-930, p4146 

    Considering the minimal delivery route and the receiving time window, the mixed delivery optimization based on genetic algorithm in tobacco logistics is presented in this paper. The existing developments of tobacco logistics are elaborated, with which the characteristic of tobacco delivery is...

  • An Application of Immune Algorithm for the Periodic Delivery Planning of Vending Machines. Yi-Chih Hsieh; Peng-Sheng You; Yung-Cheng Lee // Journal of Computers;Jul2014, Vol. 9 Issue 7, p1525 

    This paper investigates the periodic delivery planning of vending machine problem (PDPVMP). The problem is a periodic vehicle routing problem (PVRP), which is also an extension of the typical vehicle routing problem (VRP). The considered PDPVMP contains multiple vending machines with periodic...

  • Probabilistic analysis of a combined aggregation and math programming heuristic for a general... Federgruen, Awi; Ryzin, Garrett van // Management Science;Aug1997, Vol. 43 Issue 8, p1060 

    We propose and analyze a heuristic that uses region partitioning and an aggregation scheme for customer attributes (load size, time windows, etc.) to create a finite number of customer types. A math program is solved based on these aggregated customer types to generate a feasible solution to the...

  • A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem. Grønhaug, Roar; Christiansen, Marielle; Desaulniers, Guy; Desrosiers, Jacques // Transportation Science;Aug2010, Vol. 44 Issue 3, p400 

    We consider a maritime inventory routing problem in the liquefied natural gas (LNG) business, called the LNG inventory routing problem (LNG-IRP). Here, an actor is responsible for the routing of the fleet of special purpose ships, and the inventories both at the liquefaction plants and the...


Read the Article


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

Try another library?
Sign out of this library

Other Topics