Multi-Objective Vehicle Routing Problems with Time Windows: a Vector Evaluated Artificial Bee Colony Approach

The vehicle routing problem with time windows, widely used in practice, is a nondeterministic polynomial time (NP)-hard problem. The proposed optimization algorithm is based on the artificial bee colony algorithm combined with the vector evaluated technique for solving the problem as a multi-objective problem. Unlike traditional two-steps algorithms, this algorithm provides a simultaneous solution set. The approach was tested on standard Solomon benchmark problems and the result shows that this algorithm was better than or equal to other heuristic algorithms.

• Supplemental Notes:
  • This paper was sponsored by TRB committee AT015(3) CFP - Freight Transportation and Logistics Modeling.
• Corporate Authors:

  Transportation Research Board

  500 Fifth Street, NW
  Washington, DC  United States  20001
• Authors:
  • Nahum, Oren E
  • Hadas, Yuval
  • Spiegel, Uriel
• Conference:
  • Transportation Research Board 92nd Annual Meeting
  • Location: Washington DC, United States
  • Date: 2013-1-13 to 2013-1-17
• Date: 2013

Language

• English

Media Info

• Media Type: Digital/other
• Features: Appendices; Figures; References; Tables;
• Pagination: 18p
• Monograph Title: TRB 92nd Annual Meeting Compendium of Papers

Subject/Index Terms

• TRT Terms: Algorithms; Combinatorial analysis; Mathematical programming; Routing; Time windows
• Uncontrolled Terms: Ant colony optimization; Multi-objective programming; Vehicle routing problem
• Subject Areas: Planning and Forecasting; Transportation (General); I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01475797
• Record Type: Publication
• Report/Paper Numbers: 13-0106
• Files: TRIS, TRB, ATRI
• Created Date: Mar 15 2013 9:48AM