TITLE

Disrupted capacitated vehicle routing problem with order release delay

AUTHOR(S)
Mu, Qianxin; Eglese, Richard
PUB. DATE
August 2013
SOURCE
Annals of Operations Research;Aug2013, Vol. 207 Issue 1, p201
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
With the popularity of the just-in-time system, more and more companies are operating with little or no inventories, which make them highly vulnerable to delays on supply. This paper discusses a situation when the supply of the commodity does not arrive at the depot on time, so that not enough of the commodity is available to be loaded on all vehicles at the start of the delivery period. New routing plans need to be developed in such a case to reduce the impact the delay of supply may have on the distribution company. The resulting vehicle routing problem is different from other types of vehicle routing problems as it involves waiting and multiple trips. Two approaches have been developed to solve the order release delay problem, both of which involve a Tabu Search algorithm. Computational results show the proposed approaches can largely reduce the disruption costs that are caused by the delayed supply and they are especially effective when the length of delay is long.
ACCESSION #
89046812

 

Related Articles

  • OPTIMIZACIÓN APLICADA A UN PROBLEMA DE RECOLECCIÓN DE RESIDUOS INDUSTRIALES. OSORTO, JAVIER ARIAS // Gerencia Tecnologica Informatica; 

    This paper show the second phase of research work developed about vehicle routing on Cerromatoso Inc. and presented at the Number 21 of this journal two years ago with title: "Transport scheduling applied to system of waste collection routes". On this phase, we considered the original problem...

  • Modeling the Time Windows Vehicle Routing Problem in Cross-docking Strategy Using Two Meta-heuristic Algorithms. Fakhrzada, M. B.; Sadri Esfahani, A. // International Journal of Engineering (1025-2495);Jul2014, Vol. 27 Issue 7, p1113 

    In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses...

  • A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem. Escobar, John; Linfati, Rodrigo; Toth, Paolo; Baldoquin, Maria // Journal of Heuristics;Oct2014, Vol. 20 Issue 5, p483 

    In this paper, we propose a hybrid Granular Tabu Search algorithm to solve the Multi-Depot Vehicle Routing Problem (MDVRP). We are given on input a set of identical vehicles (each having a capacity and a maximum duration), a set of depots, and a set of customers with deterministic demands and...

  • Heuristics for an oil delivery vehicle routing problem. Prescott-Gagnon, Eric; Desaulniers, Guy; Rousseau, Louis-Martin // Flexible Services & Manufacturing Journal;Dec2014, Vol. 26 Issue 4, p516 

    Companies distributing heating oil typically solve vehicle routing problems on a daily basis. Their problems may involve various features such as a heterogeneous vehicle fleet, multiple depots, intra-route replenishments, time windows, driver shifts and optional customers. In this paper, we...

  • THE VEHICLE ROUTING PROBLEM WITH LIMITED VEHICLE CAPACITIES. Taracena Sanz, Fernando; Escobar Gómez, Elías Neftalí // International Journal for Traffic & Transport Engineering;2013, Vol. 3 Issue 3, p260 

    The vehicle routing problem (VRP) has been an important research topic during the last decades because of his vital role in the productive systems efficiency. Most of the work done in this area has been directed to solve large scale problems which may not apply for small companies which are a...

  • A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem. Chetty, Sivashan; Adewumi, Aderemi O. // Discrete Dynamics in Nature & Society;3/18/2015, Vol. 2015, p1 

    The Just-In-Time (JIT) scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To...

  • Hubbing and routing in postal delivery systems. Çetiner, Selim; Sepil, Canan; Süral, Haldun // Annals of Operations Research;Dec2010, Vol. 181 Issue 1, p109 

    We consider the combined hubbing and routing problem in postal delivery systems and develop an iterative two-stage solution procedure for the problem. In the first stage, hub locations are determined and postal offices are multiply allocated to the hubs. The second stage gives the routes in hub...

  • The Pallet-Packing Vehicle Routing Problem. Zachariadis, Emmanouil E.; Tarantilis, Christos D.; Kiranoudis, Chris T. // Transportation Science;Aug2012, Vol. 46 Issue 3, p341 

    This article introduces and solves a new transportation problem called the pallet-packing vehicle routing problem (PPVRP). PPVRP belongs to the category of practical routing models integrated with loading constraints, and assumes that customers raise a deterministic demand in the form of...

  • ALGORITMO MEMÉTICO PARA RESOLVER EL PROBLEMA DE ENRUTAMIENTO DE VEHÍCULOS CON CAPACIDAD LIMITADA. JARAMILLO POSADA, JUAN RODRIGO // Revista EIA;dic2013, Issue 20, p13 

    Solving the Capacitated Vehicle Routing Problem is critical for the success of many companies. The Capacitated Vehicle Routing Problem belongs to the family of NP-Hard problems. Consequently, the development of Meta-heuristics is critical for its solution. This work presents a Memetic Algorithm...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics