A Tabu Search Heuristic for Multi-Trip Vehicle Routing Problem with Time Windows

Title
A Tabu Search Heuristic for Multi-Trip Vehicle Routing Problem with Time Windows
Authors
이덕룡
Keywords
atabusearchheuristicformultitripvehicleroutingproblemwithtimewindows
Issue Date
2010
Publisher
인하대학교
Abstract
Vehicle Routing Problems (VRP) arise in many real-life applications within transportation and logistics. This paper describes a novel tabu search heuristic methodology for the Multi-Trip Vehicle Routing Problem with Time Windows (MTVRPTW). Unlike the cla
Description
ABSTRACT 1 Chapter 1 Introduction 3 1.1 Problem Definition and Notations 4 1.2 Related Works 7 Chapter 2 Tabu Search Heuristic for MVRPTW Overview 9 Chapter 3 Tabu Search Heuristic for MVRPTW Construction 11 3.1 Constraint definition 11
URI
http://dspace.inha.ac.kr/handle/10505/20082
Appears in Collections:
College of Engineering(공과대학) > Computer Engineering (컴퓨터공학) > Theses(컴퓨터정보공학 석박사 학위논문)
Files in This Item:
19672.pdfDownload

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse