Publication Type

Conference Proceeding Article

Version

acceptedVersion

Publication Date

11-2001

Abstract

In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon's benchmark test cases for VRPTW. Experimental results show that our approach yields very good solutions when compared with the benchmarking solutions.

Keywords

Pickup and delivery problem, vehicle routing problem, tabu search, test case generation

Discipline

Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering

Publication

Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence ICTAI 2001, November 7-9, Dallas, Texas

First Page

333

Last Page

340

ISBN

9780769514178

Identifier

10.1109/ICTAI.2001.974481

Publisher

IEEE

City or Country

Piscataway, NJ

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://doi.org/10.1109/ICTAI.2001.974481

Comments

IEEE Computer Society Press,Dallas, Texas, United States

Download

Share

COinS