Meta-heuristic Approach to Solve Mixed Vehicle Routing Problem with Backhauls in Enterprise Information System of Service Industry

This chapter presents the development of simulated annealing (SA) for a health care application which is modeled as Single Depot Vehicle routing problem called Mixed Vehicle Routing Problem with Backhauls (MVRPB), an extension of Vehicle Routing Problem with Backhauls (VRPB). This variant involves both delivery and pick-up customers and sequence of visiting the customers is mixed. The entire pick-up load should be taken back to depot. The latest rapid advancement of meta-heuristics has shown that it can be applied in practice if they are personified in packaged information technology (IT) solutions along with the combination of a Supply Chain Management (SCM) application integrated with an enterprise resource planning (ERP) resulted to this decision support tool. This chapter provides empirical proof in sustain of the hypothesis, that a population extension of SA with supportive transitions leads to a major increase of efficiency and solution quality for MVRPB if and only if the globally optimal solution is located close to the center of all local optimal solutions. DOI: 10.4018/978-1-61520-625-4.ch015

[1]  R. Elston,et al.  A Statistical Approach to Ordering and Usage Policies for a Hospital Blood Bank * , 1963 .

[2]  N. Wassan.  Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls , 2007, J. Oper. Res. Soc..

[3]  Eric Brodheim,et al.  Computer-based regional blood distribution , 1979, Comput. Oper. Res..

[4]  Roberto Aringhieri,et al.  An asymmetric vehicle routing problem arising in the collection and disposal of special waste , 2004, Electron. Notes Discret. Math..

[5]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[6]  Amit Mitra,et al.  Developing an Enterprise Wide Knowledge Warehouse: Challenge of Optimal Designs in the Media Industry , 2008, Int. J. Enterp. Inf. Syst..

[7]  Said Salhi,et al.  A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..

[8]  D. Lambert,et al.  Supply Chain Management: Implementation Issues and Research Opportunities , 1998 .

[9]  Paolo Toth,et al.  An Exact Algorithm for the Vehicle Routing Problem with Backhauls , 1997, Transp. Sci..

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  R. D. Carvalho.  Free and Open Source Enterprise Resources Planning , 2009 .

[12]  E. Brodheim,et al.  Setting Inventory Levels for Hospital Blood Banks , 2003, Transfusion.

[13]  Jean-Yves Potvin,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows , 1997, Transp. Sci..

[14]  S. New.  The scope of supply chain management research , 1997 .

[15]  Steven Nahmias.  Technical Note - Comparison between Two Dynamic Perishable Inventory Models , 1977, Oper. Res..

[16]  Paolo Toth,et al.  A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls , 1999, Eur. J. Oper. Res..

[17]  T. T. Narendran,et al.  CLOSE: a heuristic to solve a precedence-constrained travelling salesman problem with delivery and pickup , 2005 .

[18]  William P. Pierskalla,et al.  Optimal Issuing Policies for Perishable Inventory , 1972 .

[19]  Omar E. M. Khalil,et al.  IT Adoption and Industry Type: Some Evidence from Kuwaiti Manufacturing Companies , 2005, Int. J. Enterp. Inf. Syst..

[20]  T. T. Narendran,et al.  CLASH: a heuristic to solve vehicle routing problems with delivery, pick-up and time windows , 2007 .

[21]  J Dethloff,et al.  Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls , 2002, J. Oper. Res. Soc..

[22]  E. Bolisani.  Knowledge Assets in Virtual Enterprises: Sources of Risk and Management Issues , 2010 .

[23]  Gur Mosheiov,et al.  The Travelling Salesman Problem with pick-up and delivery , 1994 .

[24]  Roberto Baldacci,et al.  An Exact Method for the Vehicle Routing Problem with Backhauls , 1999, Transp. Sci..

[25]  Stavros Ponis.  Managing Risk in Virtual Enterprise Networks: Implementing Supply Chain Principles , 2010 .

[26]  G. Prastacos.  Blood Inventory Management: An Overview of Theory and Practice , 1984 .

[27]  Chris Butterworth,et al.  Value Stream Management , 1998 .

[28]  Morris A. Cohen.  Analysis of Single Critical Number Ordering Policies for Perishable Inventories , 1976, Oper. Res..

[29]  Kenneth E. Kendall,et al.  Management Control of Blood Through a Short-Term Supply-Demand Forecast System , 1974 .

[30]  K. Mohandas,et al.  COG: a composite genetic algorithm with local search methods to solve a mixed vehicle routing problem with backhauls , 2009 .

[31]  T. T. Narendran,et al.  CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up , 2007, Eur. J. Oper. Res..

[32]  José Brandão,et al.  Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls , 2005, J. Oper. Res. Soc..

[33]  David Perry.  Analysis of a Sampling Control Scheme for a Perishable Inventory System , 1999, Oper. Res..

[34]  W. Pierskalla,et al.  Target Inventory Levels for a Hospital Blood Bank or a Decentralized Regional Blood Banking System , 1979, Transfusion.

[35]  Barrie M. Baker,et al.  A visual interactive approach to the classical and mixed vehicle routing problems with backhauls , 2009 .

[36]  The Financial Appraisal Profile (FAP) Model for Evaluation of Enterprise-Wide Information Technology: A Case Example , 2007 .

[37]  C C Pegels,et al.  A Computer‐Based Interactive Planning System for Scheduling Blood Collections , 1975, Transfusion.

[38]  Ioannis Ignatiadis,et al.  The Impact of Enterprise Systems on Organizational Control and Drift: A Human-Machine Agency Perspective , 2007, Int. J. Enterp. Inf. Syst..

[39]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[40]  Gur Mosheiov,et al.  Vehicle routing with pick-up and delivery: tour-partitioning heuristics , 1998 .

[41]  Gregory P. Prastacos,et al.  PBDS: A Decision Support System for Regional Blood Management , 1980 .

[42]  Shoshana Anily,et al.  The vehicle-routing problem with delivery and back-haul options , 1996 .

[43]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

[44]  S. Lubbe.  Managing Information Communication Technology Investments in Successful Enterprises , 2007 .

[45]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[46]  K E Kendall.  Multiple objective planning for regional blood centers. , 1980, Long range planning.

[47]  John B. Houlihan.  International Supply Chains: A New Approach , 1988 .

[48]  M. Goetschalckx,et al.  The vehicle routing problem with backhauls , 1989 .

[49]  T. T. Narendran,et al.  TASTE: a two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up , 2008 .

[50]  Gábor Nagy,et al.  A heuristic method for the vehicle routing problem with mixed deliveries and pickups , 2008, J. Sched..

[51]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[52]  M A Cohen,et al.  An Overview of a Hierarchy of Planning Models for Regional Blood Bank Management , 1979, Transfusion.

[53]  Madjid Tavana.  Competition, Strategy, and Modern Enterprise Information Systems , 2012 .

[54]  Philip Payne,et al.  Research frameworks in logistics: three models, seven dinners and a survey , 1995 .

[55]  Said Salhi,et al.  An investigation into a new class of vehicle routing problem with backhauls , 2002 .

[56]  Gur Mosheiov.  The pickup delivery location problem on networks , 1995, Networks.

[57]  John B. Jennings,et al.  Blood Bank Inventory Control , 1973 .