Affordable Access

Improved exact method for the double TSP with multiple stacks

Authors
Publisher
John/Wiley & Sons, Inc. John/Wiley & Sons Ltd.
Publication Date
Keywords
  • The Double Tsp With Multiple Stacks Is A Logistics Problem Where One Must
  • Using A Container
  • Transport A Given Number Of Orders From A Set Of Pickup Customers To A Set Of Delivery Customers At
  • Each Order Corresponds To The Movement Of One Pallet
  • All Pickups Must Be Completed Before The First Delivery
  • And The Container Cannot Be Repacked Once Packed
  • In This Paper We Improve The Previously Proposed Exact Method Of Lusby Et Al
  • (Int Trans Oper Res 17 (2010)
  • 637–652) Through An Additional Preprocessing Technique That Uses The Longest Common Subsequence Be
  • The Results Suggest An Impressive Improvement
  • And We Report
  • For The First Time
  • Optimal Solutions To Several Unsolved Instances From The Literature Containing 18 Customers
  • Instances With 28 Customers Are Also Shown To Be Solvable Within A Few Percent Of Optimality
  • © 2011 Wiley Periodicals
  • Inc
  • Networks
  • Vol
  • 58(4)
  • 290–300 2011

Abstract

Improved exact method for the double TSP with multiple stacks - DTU Orbit (17/04/14) Improved exact method for the double TSP with multiple stacks - DTU Orbit (17/04/14) Lusby, Richard Martin and Jesper Larsen. "Improved exact method for the double TSP with multiple stacks". Networks. 2011, 58(4). 290-300. Available: 10.1002/net.20473

There are no comments yet on this publication. Be the first to share your thoughts.