TRB Pubsindex
Text Size:
x

« Prev Next »

Return to Results | New Search

Bookmark and Share

Title:

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

Accession Number:

01475797

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States

Abstract:

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.

Monograph Accession #:

01470560

Report/Paper Numbers:

13-0106

Language:

English

Corporate Authors:

Transportation Research Board

500 Fifth Street, NW
Washington, DC 20001 United States

Authors:

Nahum, Oren E
Hadas, Yuval
Spiegel, Uriel

Pagination:

18p

Publication Date:

2013

Conference:

Transportation Research Board 92nd Annual Meeting

Location: Washington DC, United States
Date: 2013-1-13 to 2013-1-17
Sponsors: Transportation Research Board

Media Type:

Digital/other

Features:

Appendices; Figures; References; Tables

Subject Areas:

Planning and Forecasting; Transportation (General); I72: Traffic and Transport Planning

Source Data:

Transportation Research Board Annual Meeting 2013 Paper #13-0106

Files:

TRIS, TRB, ATRI

Created Date:

Feb 5 2013 12:11PM