A Tabu Search Algorithm for a Routing and Container Loading Problem

This article addresses a problem that presents a combination of vehicle routing and three-dimensional loading. For example, a shipper must define the routes of its vehicle fleet to send goods, each consisting of a rectangular box of given size and weight, to a number of clients, while minimizing the total travel cost. The authors propose a tabu search algorithm that iteratively invokes an inner tabu search procedure for the solution of the loading subproblem. The algorithm is experimentally evaluated both on instances adapted from vehicle routing instances from the literature and on new real-world instances. The case studies used were provided by an Italian company producing bedroom furniture, including wardrobes, chests of drawers, night tables, and beds. Deliveries in Italy are handled through a fleet of privately owned vehicles.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Authors:
  • Gendreau, Michel
  • Iori, Manuel
  • Laporte, Gilbert
  • Martello, Silvano
• Publication Date: 2006-8

Language

• English

Media Info

• Media Type: Print
• Features: Figures; Maps; References; Tables;
• Pagination: pp 342-350
• Serial:
  • Transportation Science
  • Volume: 40
  • Issue Number: 3
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Algorithms; Costs; Delivery service; Delivery vehicles; Fleet management; Routing; Tabu search
• Uncontrolled Terms: Three-dimensional packing
• Geographic Terms: Italy
• Subject Areas: Administration and Management; Finance; Highways; Vehicles and Equipment; I10: Economics and Administration;

Filing Info

• Accession Number: 01037352
• Record Type: Publication
• Files: TRIS
• Created Date: Nov 28 2006 11:31AM